A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 algorithmdoi:10.1109/icmlc.2003.1259663 fatcat:ordyg2uvarcwte7brjlhw3s4t4