Algorithms and complexity of range clustering. Issue 2 (19th September 2018)

• Record Type: Journal Article
• Authors: Hochbaum, Dorit S.
• Is Part Of: Networks. Volume 73:Issue 2(2019)
• Page Start: 170
• Page End: 186
• Publication Date: 2018-09-19
• Subjects: clustering -- range -- image segmentation -- complexity -- minimum cut -- partitioning; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21854
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract : We introduce a novel criterion in clustering that seeks clusters with limited range of values associated with each cluster's elements. In clustering or classification the objective is to partition a set of objects into subsets, called clusters or classes, consisting of similar objects so that different clusters are as dissimilar as possible. We propose a number of objective functions that employ the range of the clusters as part of the objective function. Several of the proposed objectives mimic objectives based on sums of similarities. These objective functions are motivated by image segmentation problems, where the diameter, or range of values associated with objects in each cluster, should be small. It is demonstrated that range‐based problems are in general easier, in terms of their complexity, than the analogous similarity‐sum problems. Several of the problems we present could therefore be viable alternatives to existing clustering problems which are NP‐hard, offering the advantage of efficient algorithms.