A new measure of clustering effectiveness: Algorithms and experimental studies

✍ Scribed by E.K.F. Dang; R.W.P. Luk; K.S. Ho; S.C.F. Chan; D.L. Lee

• Publisher: John Wiley and Sons
• Year: 2008
• Tongue: English
• Weight: 863 KB
• Volume: 59
• Category: Article
• ISSN: 1532-2882
• DOI: 10.1002/asi.20745

✦ Synopsis

Abstract

We propose a new optimal clustering effectiveness measure, called CS1, based on a combination of clusters rather than selecting a single optimal cluster as in the traditional MK1 measure. For hierarchical clustering, we present an algorithm to compute CS1, defined by seeking the optimal combinations of disjoint clusters obtained by cutting the hierarchical structure at a certain similarity level. By reformulating the optimization to a 0‐1 linear fractional programming problem, we demonstrate that an exact solution can be obtained by a linear time algorithm. We further discuss how our approach can be generalized to more general problems involving overlapping clusters, and we show how optimal estimates can be obtained by greedy algorithms.