A modified PCM clustering algorithm

Kai Li, Hou-Kuan Huang, Kun-Lun Li
Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693)  
A fast PCM clustering algorithm is proposed in this paper. First, the fumy and possibilistic c-means (FCM and PCM ) clustering algorithms are analyzed and some drawbacks and limitations are pointed out. Second, based on the reformulation theorem, by. means of modifying PCM model, an effective and efficient clustering algorithm is proposed here, which is referred to as a modified PCM clustering (MPCM). As eliminating the computation of membership parameters in each iteration, this algorithm
more » ... this algorithm saves an amount of running time. Finally, experiments are implemented by using MPCM clustering algorithm, and the chosen methods of parameters are also discussed. Experiments show that MPCM has not only abilitie of resisting noise and avoiding trivial solution, but has fast clustering ability.
doi:10.1109/icmlc.2003.1259663 fatcat:ordyg2uvarcwte7brjlhw3s4t4