Abstract
The clusters tend to have vague or imprecise boundaries in some fields such as web mining, since clustering has been widely used. Fuzzy clustering is sensitive to noises and possibilistic clustering is sensitive to the initialization of cluster centers and generates coincident clusters. Based on combination of fuzzy clustering and possibilistic clustering, a novel possibilistic fuzzy leader (PFL) clustering algorithm is proposed in this paper to overcome these shortcomings. Considering the advantages of the leader algorithm in time efficiency and the initialization of cluster, the framework of the leader algorithm is used. In addition, a λ-cut set is defined to process the overlapping clusters adaptively. The comparison of experimental results shows that our proposed algorithm is valid, efficient, and has better accuracy.
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
Asharaf, S., Murty, M.N.: An adaptive rough fuzzy single pass algorithm for clustering 1arge data sets. Pattern Recognition 36, 3015–3018 (2003)
Barni, M., Cappellini, V., Mecocci, A.: Comments on A possibilistic approach to clustering. IEEE Trans Fuzzy Systems 4(3), 393–396 (1996)
Bezdek, J.C.: Pattern recognition with fuzzy objective function algorithms. Plenum Press, New York (1981)
Chen, J., Lu, H., Song, Y., Song, S., Xu, J., Xie, C., Ni, W.: A Possibility Fuzzy Clustering Algorithm Based on the Uncertainty Membership. Journal of Computer Research and Development 45(9), 1486–1492 (2008)
Joshi, A., Krishnapuram, R.: Robust Fuzzy Clustering Methods to Support Web Mining. In: Proceedings of the Workshop on Data Mining and Knowledge Discovery, SIGMOD, pp. 15/1–15/8 (1998)
Krishnapuram, R., Keller, J.: A possibilistic approach to clustering. IEEE Trans Fuzzy systerms 1(2), 98–110 (1993)
Lingras, P.: Interval set c1ustering of web users with rough k-means. Journal of Intelligent Information System 23(1), 5–16 (2004)
Pal, R., Pal, K., Bezdek, J.C.: A possibilistic fuzzy c-means clustering algorithm. IEEE Tram Fuzzy Systems 13(4), 517–530 (2005)
Spath, H.: Cluster analysis algorithm for date reduction and classification of objects. Ellis Horwood Publ., Chichester (1980)
UCIrvine Machine Learning Repository: http://archive.ics.uci.edu/ml/
Wu, X., Zhou, J.: A novel possibilistic fuzzy c-means clustering. ACTA Electronica Sinica 10, 1996–2000 (2008)
Zadeh, L.A.: Fuzzy sets. Information and Control 8, 338–353 (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, H., Luo, H. (2009). A Novel Possibilistic Fuzzy Leader Clustering Algorithm. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-10646-0_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10645-3
Online ISBN: 978-3-642-10646-0
eBook Packages: Computer ScienceComputer Science (R0)