Abstract
In this paper, we examine the performance of fuzzy clustering algorithms as the major technique in pattern recognition. Both possibilistic and probabilistic approaches are explored. While the Possibilistic C-Means (PCM) has been shown to be advantageous over Fuzzy C-Means (FCM) in noisy environments, it has been reported that the PCM has an undesirable tendency to produce coincident clusters. Recently, an extension of the PCM has been presented by Timm et al., by introducing a repulsion term. This approach combines the partitioning property of the FCM with the robust noise insensibility of the PCM. We illustrate the advantages of both the possibilistic and probabilistic families of algorithms with several examples and discuss the PCM with cluster repulsion. We provide a cluster valid-ity function evaluation algorithm to solve the problem of parameter optimization. The algorithm is especially useful for the unsupervised case, when labeled data is unavailable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jain, A. K. and Dubes, R. C. (1988), Algorithms for clustering data, Prentice Hall, New Jersey.
Zadeh, L. A. (1965), “Fuzzy Sets,” Information and Control, vol. 8, pp. 338–353.
Bezdek, J. C., (1982), Pattern recognition with fuzzy objective function algorithms, Plenum Press, New York.
Krishnapuram, R. and Keller, J. (1993), “A possibilistic approach to clustering,” IEEE Trans. Fuzzy Systems, vol. 1, pp. 98–110.
Timm, H., Borgelt, C. and Kruse, R. (2001), “Fuzzy cluster analysis with cluster repulsion,” In Proc. of the European Symp. on Intelligent Tech., Hybrid Syst. and their implementation on Smart Adapt. Syst., Tenerife, Spain.
Krishnapuram, R. and Keller, J. (1996), “The Possibilistic C-Means algorithm: Insights and recommendations”, IEEE Trans. Fuzzy Systems, vol. 4, pp. 385–393.
Barni, M., Cappellini V., and Mecocci, A. (1996), “Comments on ‘A Possibilistic Approach to Clustering’,” IEEE Trans. Fuzzy Systems, vol. 4, pp. 393–396.
Bezdek, J. C. and Pal, N. R. (1998), “Some New Indexes of Cluster Validity,” IEEE Trans, on SMC, Part B, vol. 28, no.3, pp. 301–315.
Dave, R. N. and Krishnapuram, R. (1997), “Robust clustering methods: a unified view,” IEEE Trans. Fuzzy Systems, vol. 5 no. 2, pp.270–293.
Fisher, R. (1936), “The use of multiple measurements in taxonomic problems,” Annals of Eugenics, vol.7, no. 2, 179–188.
Merz, C. J. and Murphy, P. M. (1996), UCI Repository of Machine Learning Databases, http://www.ics.uci.edu/~mlearn/MLRepository.html, University of California, Department of Information and computer Science.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Wachs, J., Shapira, O., Stern, H. (2006). A Method to Enhance the ‘Possibilistic C-Means with Repulsion’ Algorithm based on Cluster Validity Index. In: Abraham, A., de Baets, B., Köppen, M., Nickolay, B. (eds) Applied Soft Computing Technologies: The Challenge of Complexity. Advances in Soft Computing, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31662-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-31662-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31649-7
Online ISBN: 978-3-540-31662-6
eBook Packages: EngineeringEngineering (R0)