Abstract
A novel fuzzy clustering algorithm, called kernel improved possibilistic c-means (KIPCM) algorithm, is presented based on kernel methods. KIPCM is an extension of the improved possibilistic c-means (IPCM) algorithm. Different from IPCM which is applied in Euclidean space, KIPCM can make data clustering in kernel feature space. With kernel methods the input data can be implicitly mapped into a high-dimensional feature space where the nonlinear pattern now appears linear. It is unnecessary to calculate in this high-dimensional feature space because we directly calculate inner products from the input data by kernel function. KIPCM can identify clusters of complex shapes and solve nonlinear separable problems better than IPCM and FCM (fuzzy c-means). Our experiments show that the proposed algorithm compares favorably with FCM and IPCM.
Chapter PDF
Similar content being viewed by others
References
Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)
Krishnapuram, R., Keller, J.: A Possibilistic Approach to Clustering. IEEE Trans. Fuzzy Systems 1(2), 98–110 (1993)
Barni, M., Cappellini, V., Mecocci, A.: Comments on A Possibilistic Approach to Clustering. IEEE Trans. Fuzzy Systems 4(3), 393–396 (1996)
Zhang, J.-S., Leung, Y.-W.: Improved possibilistic C-means clustering algorithms. IEEE Trans. Fuzzy Systems 12(2), 209–217 (2004)
Vapnik, V.: Statistical Learning Theory. Wiley, Chichester (1998)
Girolami, M.: Mercer kernel based clustering in feature space. IEEE Trans. on Neural Networks 13(13), 780–784 (2002)
Aizerman, M., Braverman, E., Rozonoer, L.: Theoretical foundations of the potential function method in pattern recognition learning. Automation and Remote Control 25, 821–837 (1964)
Pal, N.R., Pal, K., Bezdek, J.C.: A mixed c-means clustering model. Processings of the IEEE Trans. Fuzzy Systems, Spain, 11–21 (1997)
Anderson, E.: The Iris of Gasp Peninsula. Bulletin of American Iris Society 59, 2–5 (1935)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, XH., Zhou, JJ. (2006). An Improved Possibilistic C-Means Algorithm Based on Kernel Methods. In: Yeung, DY., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2006. Lecture Notes in Computer Science, vol 4109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11815921_86
Download citation
DOI: https://doi.org/10.1007/11815921_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37236-3
Online ISBN: 978-3-540-37241-7
eBook Packages: Computer ScienceComputer Science (R0)