A Possibilistic c-means Clustering Model with Cluster Size Estimation

Most c-means clustering models have serious difficulties when facing clusters of different sizes and severely outlier data. The possibilistic c-means (PCM) algorithm can handle both problems to some extent. However, its recommended initialization using a terminal partition produced by the probabilistic fuzzy c-means does not work when severe outliers are present. This paper proposes a possibilistic c-means clustering model that uses only two parameters independently of the number of clusters, which is able to correctly handle the above mentioned obstacles. Numerical evaluation involving synthetic and standard test data sets prove the advantages of the proposed clustering model.

[1]  James C. Bezdek,et al.  A mixed c-means clustering model , 1997, Proceedings of 6th International Fuzzy Systems Conference.

[2]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[3]  Mauro Barni,et al.  Comments on "A possibilistic approach to clustering" , 1996, IEEE Trans. Fuzzy Syst..

[4]  Sadaaki Miyamoto,et al.  Variables for Controlling Cluster Sizes on Fuzzy c-Means , 2013, MDAI.

[5]  László Szilágyi,et al.  Fuzzy-Possibilistic Product Partition: A Novel Robust Approach to c-Means Clustering , 2011, MDAI.

[6]  James M. Keller,et al.  A possibilistic fuzzy c-means clustering algorithm , 2005, IEEE Transactions on Fuzzy Systems.

[7]  James M. Keller,et al.  A possibilistic approach to clustering , 1993, IEEE Trans. Fuzzy Syst..

[8]  J. C. Dunn,et al.  A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters , 1973 .

[9]  Jacek M. Leski,et al.  Fuzzy c-ordered-means clustering , 2016, Fuzzy Sets Syst..

[10]  Rajesh N. Davé,et al.  Characterization and detection of noise in clustering , 1991, Pattern Recognit. Lett..