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 defined 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. © 2002 Elsevier Science Ltd. All rights reserved.
Mirkin, B., & Muchnik, I. (2002). Layered clusters of tightness set functions. Applied Mathematics Letters, 15(2), 147–151. https://doi.org/10.1016/S0893-9659(01)00109-4