Minimal Spanning Tree based Fuzzy Clustering

Most of fuzzy clustering algorithms have some discrepancies, e.g. they are not able to detect clusters with convex shapes, the number of the clusters should be a priori known, they suffer from numerical problems, like sensitiveness to the initialization, etc. This paper studies the synergistic combination of the hierarchical and graph theoretic minimal spanning tree based clustering algorithm with the partitional Gath-Geva fuzzy clustering algorithm. The aim of this hybridization is to increase the robustness and consistency of the clustering results and to decrease the number of the heuristically defined parameters of these algorithms to decrease the influence of the user on the clustering results. For the analysis of the resulted fuzzy clusters a new fuzzy similarity measure based tool has been presented. The calculated similarities of the clusters can be used for the hierarchical clustering of the resulted fuzzy clusters, which information is useful for cluster merging and for the visualization of the clustering results. As the examples used for the illustration of the operation of the new algorithm will show, the proposed algorithm can detect clusters from data with arbitrary shape and does not suffer from the numerical problems of the classical Gath-Geva fuzzy clustering algorithm. Keywords—Clustering, fuzzy clustering, minimal spanning tree, cluster validity, fuzzy similarity.

[1]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[2]  Jack Minker,et al.  An Analysis of Some Graph Theoretical Cluster Techniques , 1970, JACM.

[3]  Vijay V. Raghavan,et al.  A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  L. Hubert,et al.  A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering , 1976 .

[5]  Monica Casale,et al.  Minimum spanning tree: ordering edges to identify clustering structure , 2004 .

[6]  James C. Bezdek,et al.  Validity-guided (re)clustering with applications to image segmentation , 1996, IEEE Trans. Fuzzy Syst..

[7]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[8]  J. Gower,et al.  Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .

[9]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[10]  José M. González-Barrios,et al.  A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree , 2003 .

[11]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[12]  J. Dunn.  Well-Separated Clusters and Optimal Fuzzy Partitions , 1974 .

[13]  Niina Päivinen.  Clustering with a minimum spanning tree of scale-free-like structure , 2005, Pattern Recognit. Lett..

[14]  J. Barrow,et al.  Minimal spanning trees, filaments and galaxy clustering , 1985 .

[15]  Venansius Baryamureeba,et al.  PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 8 , 2005 .

[16]  Richard Simon,et al.  Iterative class discovery and feature selection using Minimal Spanning Trees , 2004, BMC Bioinformatics.

[17]  Isak Gath,et al.  Unsupervised Optimal Fuzzy Clustering , 1989, IEEE Trans. Pattern Anal. Mach. Intell..