Title of article
Layered clusters of tightness set functions Original Research Article
Author/Authors
B. Mirkin، نويسنده , , I. Muchnik، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
5
From page
147
To page
151
Abstract
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.
Keywords
Layered cluster , Monotone linkage , Greedy optimization
Journal title
Applied Mathematics Letters
Serial Year
2002
Journal title
Applied Mathematics Letters
Record number
897318
Link To Document