Homogeneity Separateness: A New Validity Measure for Clustering Problems
Several validity indices have been designed to evaluate solutions obtained by clustering algorithms. Traditional indices are generally designed to evaluate center-based clustering, where clusters are assumed to be of globular shapes with defined centers or representatives. Therefore they are not suitable to evaluate clusters of arbitrary shapes, sizes and densities, where clusters have no defined centers or representatives. In this work, HS (Homogeneity Separateness) validity measure based on a different shape is proposed. It is suitable for clusters of any shapes, sizes and/or of different densities. The main concepts of the proposed measure are explained and experimental results on both synthetic and real life data set that support the proposed measure are given.
KeywordsCluster validity index homogeneity separateness spanning tree CS Measure
Unable to display preview. Download preview PDF.
- 1.Hartigan, J.A.: Clustering Algorithms. Wiley Series in Probability and Mathematical statistics (1975)Google Scholar
- 6.Gustafson, D.E., Kessel, W.C.: Fuzzy clustering with a fuzzy covariance matrix. In: Proceedings of the IEEE Conference on Decision and Control, San Diego, pp. 761–766 (January 1979)Google Scholar
- 7.Halkidi, M., Vazirgiannis, M.: Clustering validity assessment: Finding the optimal partitioning of a data set. In: Proc. IEEE ICDM, San Jose, CA, pp. 187–194 (2001)Google Scholar
- 8.Babuška, R., van der Veen, P.J., Kaymak, U.: Improved Covariance Estimation for Gustafson-Kessel Clustering, 0-7803-7280-8/02/$10.00 ©2002. IEEE (2002)Google Scholar
- 10.Kruskal, J.: On the shortest spanning subtree and the travelling salesman problem. In: Proceedings of the American Mathematical Society, pp. 48–50 (1956)Google Scholar
- 11.Nesetril, J., Milkova, E., Nesetrilova, H.: Otakar boruvka on minimum spanning tree problem: Translation of both the 1926 papers, comments, history. DMATH: Discrete Mathematics 233 (2001)Google Scholar
- 14.Asano, T., Bhattacharya, B., Keil, M., Yao, F.: Clustering Algorithms based on minimum and maximum spanning trees. In: Proceedings of the 4th Annual Symposium on Computational Geometry, pp. 252–257 (1988)Google Scholar