Aggregation of Standard and Entropy Based Fuzzy c-Means Clustering by a Modified Objective Function

A generalized fuzzy c-means (FCM) clustering is proposed by modifying the standard FCM objective function and introducing some simplifications. FCM clustering results in very fuzzy partitions for data points that are far from all cluster centroids. This property distinguishes FCM from Gaussian mixture models or entropy based clustering. The generalized FCM clustering aims at aggregating standard FCM and entropy based FCM so that the generalized algorithm is furnished with the two distinctive properties for data points that are far from all centroids and for those that are close to any centroid. k-Harmonic means clustering are reviewed from the view point of FCM clustering. Graphical comparisons of the four classification functions are presented

[1]  Peter J. Huber,et al.  Robust Statistics , 2005, Wiley Series in Probability and Statistics.

[2]  Frank Nielsen,et al.  On weighting clustering , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  J. C. Peters,et al.  Fuzzy Cluster Analysis : A New Method to Predict Future Cardiac Events in Patients With Positive Stress Tests , 1998 .

[4]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[5]  K. Rose.  Deterministic annealing for clustering, compression, classification, regression, and related optimization problems , 1998, Proc. IEEE.

[6]  Rajesh N. Davé,et al.  Robust clustering methods: a unified view , 1997, IEEE Trans. Fuzzy Syst..

[7]  Sadaaki Miyamoto,et al.  METHODS OF FUZZY C-MEANS AND POSSIBILISTIC CLUSTERING USING A QUADRATIC TERM , 2004 .

[8]  Bin Zhang.  Generalized K-Harmonic Means -- Boosting in Unsupervised Learning , 2000 .

[9]  Donald Gustafson,et al.  Fuzzy clustering with a fuzzy covariance matrix , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

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

[11]  P. Holland,et al.  Robust regression using iteratively reweighted least-squares , 1977 .

[12]  Manfred K. Warmuth,et al.  Boosting as entropy projection , 1999, COLT '99.

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

[14]  Thomas A. Runkler,et al.  Alternating cluster estimation: a new tool for clustering and function approximation , 1999, IEEE Trans. Fuzzy Syst..

[15]  Hidetomo Ichihashi,et al.  Fuzzy c-Means Classifier with Deterministic Initialization and Missing Value Imputation , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

[16]  G. McLachlan,et al.  The EM algorithm and extensions , 1996 .

[17]  V. J. Rayward-Smith,et al.  Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition , 1999 .

[18]  T. Kunii,et al.  Soft Computing and Human-Centered Machines , 2013, Computer Science Workbench.

[19]  B. Ripley,et al.  Robust Statistics , 2018, Encyclopedia of Mathematical Geosciences.

[20]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[21]  Yoram Singer,et al.  Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.

[22]  Umeshwar Dayal,et al.  K-Harmonic Means - A Spatial Clustering Algorithm with Boosting , 2000, TSDM.