Open Access Open Access  Restricted Access Subscription or Fee Access

Modified Fuzzy Possibilistic C-Means

K. Duraisamy, K. Haridass


A cluster is a group of objects which are similar to each other within a cluster and are dissimilar to the objects of other clusters. The similarity is typically calculated on the basis of distance between two objects or clusters. Two or more objects present inside a cluster and only if those objects are close to each other based on the distance between them.The major objective of clustering is to discover collection of comparable objects based on similarity metric. Fuzzy Possibilistic C-Means (FPCM) is the effective clustering algorithm available to cluster unlabeled data that produces both membership and typicality values during clustering process. In this approach, the efficiency of the Fuzzy Possibilistic C-means clustering approach is enhanced by using the penalized and compensated constraints based FPCM (PCFPCM). The proposed PCFPCM approach differ from the conventional clustering techniques by imposing the possibilistic reasoning strategy on fuzzy clustering with penalized and compensated constraints for updating the grades of membership and typicality. The performance of the proposed approaches is evaluated on the University of California, Irvine (UCI) machine repository datasets such as Iris, Wine, Lung Cancer and Lymphograma. The parameters used for the evaluation is Clustering accuracy, Mean Squared Error (MSE), Execution Time and Convergence behavior.


Unsupervised Learning, Fuzzy C-Mean, Fuzzy Possibilistic C-Means, Penalized and Compensated Constraints based FPCM.

Full Text:



A.M. Fahim, A.M. Salem, F.A. Torkey and M.A. Ramadan, “An Efficient enhanced k-means clustering algorithm,” Journal of Zhejiang University, Vol. 10, No. 7, Pp. 1626-1633, 2006.

AristidisLikas, Nikos Vlassis and Jakob J. Verbeek, “The global k-means clustering algorithm”, Journal of Pattern Recognition society, Elsevier, Vol. 36, No. 2, Pp. 451-461, 2003.

Baolin Yi, HaiquanQiao, Fan Yang and ChenweiXu, “An Improved Initialization Center Algorithm for K-Means Clustering”, International Conference on Computational Intelligence and Software Engineering (CiSE), Pp. 1–4, 2010.

Barakbah A.R and Kiyoki Y “A pillar algorithm for K-means optimization by distance maximization for initial centroid designation”, IEEE Symposium on Computational Intelligence and Data Mining (CIDM '09), Pp. 61–68, 2009.

Celikyilmaz A and BurhanTurksen I, “Enhanced Fuzzy System Models With Improved Fuzzy Clustering Algorithm”, IEEE Transactions on Fuzzy Systems, Vol. 16, No. 3, Pp. 779–794, 2008.

Chen Zhang and Shixiong Xia, “K-means Clustering Algorithm with Improved Initial Center”, Second International Workshop on Knowledge Discovery and Data Mining (WKDD), Pp. 790–792, 2009.

Chunhui Zhang, Yiming Zhou and Trevor Martin, “Similarity Based Fuzzy and Possibilistic c-means Algorithm”, Proceedings of the 11th Joint Conference on Information Sciences, Pp. 1-6, 2008.

D. Vanisri, Dr.C. Loganathan, “An Efficient Fuzzy Clustering Algorithm Based on Modified K-Means”, International Journal of Engineering Science and Technology, Vol. 2, No. 10, Pp. 5949-5958, 2010.

Fang Yuan, Zeng-Hui Meng, Hong-Xia Zhang and Chun-Ru Dong, “A new algorithm to get the initial centroids”, Proceedings of International Conference on Machine Learning and Cybernetics, Vol. 2, Pp. 1191–1193, 2004.

Filippone M, Masulli F and Rovetta S, “Applying the Possibilistic c-Means Algorithm in Kernel-Induced Spaces”, IEEE Transactions on Fuzzy Systems, Vol. 18, No. 3, Pp. 572–584, 2010.

Ganesan P and Rajini V, “A method to segment color images based on modified Fuzzy-Possibilistic-C-Means clustering algorithm”, Recent Advances in Space Technology Services and Climate Change (RSTSCC), Pp. 157–163, 2010.

Jiang-She Zhang and Yiu-Wing Leung, “Improved possibilistic C-means clustering algorithms”, IEEE Transactions on Fuzzy Systems, Vol. 4, No. 2, Pp. 209–217, 2004.

Kai Li, Hou-Kuan Huang and Kun-Lun Li, “A modified PCM clustering algorithm”, International Conference on Machine Learning and Cybernetics, Vol. 2, Pp. 1174–1179, 2003.

Ojeda-Magafia B, Ruelas R, Corona-Nakamura M.A and Andina D, “An Improvement to the Possibilistic Fuzzy c-Means Clustering Algorithm”, Automation Congress, Pp. 1–8, 2006.

Xiao-Hong Wu and Jian-Jiang Zhou, “Possibilistic Fuzzy c-Means Clustering Model Using Kernel Methods”, International Conference on Intelligent Agents, Web Technologies and Internet Commerce, Vol. 2, Pp. 465-470, 2005.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.