Layered clusters of tightness set functions

A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The method is based on the layered structure of the problem of maximization of a set function de ned as the minimum value of linkages between a set and its elements and referred to as the tightness function. When the linkage function is monotone, the layered cluster can be easily found with a greedy type algorithm. Key words: layered cluster, monotone linkage, greedy optimization.

• Type: Journal
• Year: 2002
• Where: APPML
• Authors: Boris Mirkin, Ilya B. Muchnik
• Keywords: APPML 2002, Layered Structure, Structural Clustering, Subset-to-entity Linkages