Open Access Open Access  Restricted Access Subscription or Fee Access

Similarity Based Fuzzy Possibilistic C-Means with Constraints

R. Shanmugasundram, Dr. S. Sukumaran

Abstract


Data analysis is recognized as a very essential science in the real world. Cluster analysis is an approach for categorizing data and it is a method for finding clusters of a data set with most relationship in the similar cluster and most variation between different clusters. It is extensively used in pattern recognition, image processing, and data analysis. The Fuzzy-Possibilistic C-Means (FPCM) approach is the effective clustering algorithm for clustering unlabeled data that produces both membership and typicality values during clustering process. FPCM constrains the typicality values so that the sum over all data points of typicalities to a cluster is one. The row sum constraint constructs unrealistic typicality values for large data sets. A Modification on fuzzy possibilistic clustering algorithm based on a prototype-driven learning of parameters was previously performed to obtain better quality clustering results. A similarity based fuzzy and possibilistic c-means algorithm is presented in this paper. The major purpose of the similarity based approach is to differentiate between the domain terms and the noisy terms. The efficiency of the Similarity based Fuzzy Possibilistic C-means clustering approach is enhanced by using the penalized and compensated constraints. Penalized and Compensated terms are embedded with the Modified fuzzy possibilistic clustering method’s objective function to construct the Similarity based Penalized and Compensated constraints based Modified FPCM (SPCMFPCM). Several numerical examples are given that compare MFPCM and SPCMFPCM. The experimental observations illustrate that SPCMFPCM clusters the data more accurately than the MFPCM. Since the proposed approach is less sensitive to outliers and can avoid coincident clusters, it is a strong candidate for fuzzy rule-based system identification.

Keywords


Fuzzy Possibilistic C-Means, Modified Fuzzy Possibilistic C-Means, Penalized and Compensated constraints

Full Text:

PDF

References


Pal, N.R.; Pal, K.; Keller, J.M. and Bezdek, J.C., "A Possibilistic Fuzzy c-Means Clustering Algorithm, IEEE Transactions on Fuzzy Systems, Vol: 13 , Issue: 4, Publication Year: 2005 , Pp: 517 – 530

Vuda. Sreenivasarao and Dr. S. Vidyavathi, "Comparative Analysis of Fuzzy C- Mean and Modified Fuzzy Possibilistic C -Mean Algorithms in Data Mining", IJCST Vol. 1, Issue 1, September 2010, Pp. 104-106

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, Publication Year: 2005 , Pp. 465 - 470

Ojeda-Magafia, B.; Ruelas, R.; Corona-Nakamura, M.A. and Andina, D., "An Improvement to the Possibilistic Fuzzy c-Means Clustering Algorithm", Automation Congress, 2006. WAC '06, Publication Year: 2006 , Pp. 1 – 8

Yang Yan and Lihui Chen, "Hyperspherical possibilistic fuzzy c-means for high-dimensional data clustering", ICICS 2009. 7th International Conference on Information, Communications and Signal Processing, 2009, Publication Year: 2009 , Pp. 1-5

Long Yu; Jian Xiao and Gao Zheng, "Robust Interval Type-2 Possibilistic C-means Clustering and its Application for Fuzzy Modeling", FSKD '09. Sixth International Conference on Fuzzy Systems and Knowledge Discovery, 2009, Vol: 4, Publication Year: 2009 , Pp. 360 – 365

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

J.C. Bezdek. Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York, 1981

J. C. Bezdek, “Pattern Recognition with Fuzzy Objective Function Algorithms”, New York, Plenum, 1981.

M. Barni, V. Cappellini, A. Mecocci, “Comments on A possibilistic approach to clustering", IEEE Trans on Fuzzy Systems, vol. 4: 393-396, 1996.

M R. Berthold and D. J. Hand, “Intelligent Data Analysis”.Springer-Verlag, Berlin, Germany 1999.

M. W. Berry, “Survey of Text Mining”, Springer-Verlag, New York, NY, USA 2003.

N. R. Pal, K. Pal and J. C. Bezdek, “A mixed c-means clustering model”, Proceedings of the Sixth IEEE International Conference on Fuzzy Systems, Vol. 1, pp. 11-21, Jul. 1997.

K. Lung, “A cluster validity index for fuzzy clustering”, Pattern Recognition Letters 25(2005) 1275-1291.

U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, “Advances in Knowledge Discovery and Data Mining”, AAAI Press and MIT Press, Menlo Park and Cambridge, MA, USA 1996.

M.S. Yang, On a class of fuzzy classi4cation maximum likelihood procedures, Fuzzy Sets and Systems 57 (1993) 365–375.

M.S. Yang, C.F. Su, On parameter estimation for normal mixtures based on fuzzy clustering algorithms, Fuzzy Sets and Systems 68 (1994) 13–28.

J.S. Lin, Fuzzy clustering using a compensated fuzzy hopfield network, Neural Process. Lett. 10 (1999) 35–48.

W.L. Hung, M Yang, D. Chen,” Parameter selection for suppressed fuzzy c-means with an application to MRI segmentation”, Pattern Recognition Letters 2005.

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




DOI: http://dx.doi.org/10.36039/AA102011009

Refbacks

  • There are currently no refbacks.


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