Abstract
Fuzzy C-means (FCM) algorithm is a fuzzy clustering algorithm based on objective function compared with typical “hard clustering” such as k-means algorithm. FCM algorithm calculates the membership degree of each sample to all classes and obtain more reliable and accurate classification results. However, in the process of clustering, FCM algorithm needs to determine the number of clusters manually, and is sensitive to the initial clustering center. It is easy to generate problems such as multiple clustering iterations, slow convergence speed and local optimal solution. To address those problems, we propose to combine the FCM algorithm and DPC (Clustering by fast search and find of density peaks) algorithm. First, DPC algorithm is used to automatically select the center and number of clusters, and then FCM algorithm is used to realize clustering. The comparison experiments show that the improved FCM algorithm has a faster convergence speed and higher accuracy.
Similar content being viewed by others
References
Bailey KD (1994) Numerical taxonomy and cluster analysis. In: Typologies and taxonomies. Sage, California, issue 102, pp 34–57
Meilă Marina (2003) Comparing clusterings by the variation of information. Learning theory and kernel machines. Lect Notes Comput Sci 2777:173–187
Zhang Y, Li ZM, Zhang H, Yu Z, Lu TT (2018) Fuzzy c-means clustering-based mating restriction for multiobjective optimization. Int J Mach Learn Cybern 9:1609–1621
Ma HF, Zhang D, Jia MHZ, Lin XH (2019) A term correlation based semi-supervised microblog clustering with dual constraints. Int J Mach Learn Cybern 10:679–692
Wang Xizhao, Xing Hong-Jie, Li Yan et al (2015) A study on relationship between generalization abilities and fuzziness of base classifiers in ensemble learning. IEEE Trans Fuzzy Syst 23(5):1638–1654
Wang Ran, Wang Xizhao, Kwong Sam, Chen Xu (2017) Incorporating diversity and informativeness in multiple-instance active learning. IEEE Trans Fuzzy Syst 25(6):1460–1475
Wang Xizhao, Wang Ran, Chen Xu (2018) Discovering the relationship between generalization and uncertainty by incorporating complexity of classification. IEEE Trans Cybernet 48(2):703–715
Wang X, Zhang T, Wang R (2019) Non-iterative deep learning: incorporating restricted Boltzmann machine into multilayer random weight neural networks. IEEE Trans Syst Man Cybern Syst 49(7):1299–1380
Lin JCW, Yang L, Fournier-Viger P, Hong TP (2018) Mining of skyline patterns by considering both frequent and utility constraints. Eng Appl Artif Intell 77:229–238
Fournier-Viger P, Lin JCW, Kiran RU, Koh YS, Thomas R (2017) A survey of sequential pattern mining. Data Sci Pattern Recognit 1(1):54–77
Yang S, Han Y, Zhang X (2012) Kernel sparse representation for image classification and face recognition. Comput Vis ECCV 6314:1–14
Han JW, Kamber M, Pei J (2011) Data mining: concepts and techniques, 3rd edn. Morgan Kaufmann, Waltham, MA
Lim TS, Loh WY, Shih YS (2000) A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms. Mach Learn J 40:203–228
Fan JC, Niu ZH, Liang YQ, Zhao ZY (2016) Probability model selection and parameter evolutionary estimation for clustering imbalanced data without sampling. Neurocomputing 211:172–181
Kanungo T, Mount DM, Netanyahu NS, Piatko CD, Silverman R, Wu AY (2002) An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans Pattern Anal Mach Intell 24(7):881–892
Sander J, Ester M, Kriegel HP, Xu XW (1998) Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Min Knowl Discov 2(2):169–194
Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. In: Proceedings of the 1996 ACM SIGMOD international conference on management of data. pp 103–114
Arias-Castro E, Chen G, Lerman G (2011) Spectral clustering based on local linear approximations. Electron J Stat 5:1537–1587
Xie XL, Beni G (1991) A validity measure for fuzzy clustering. IEEE Trans Pami 13(13):841–847
Li Y, Fan J, Pan J-S, Mao G, Wu G (2019) A novel rough fuzzy clustering algorithm with a new similarity measurement. J Internet Technol 20(4):
Fan J (2015) OPE-HCA: an optimal probabilistic estimation approach for hierarchical clustering algorithm. Neural Comput Appl 8:20–25. https://doi.org/10.1007/s00521-015-1998-5
Kosko B (1994) Fuzzy systems as universal approximators. IEEE Trans Comput 43(11):1329–1333
Chen Chien-Ming, Xiang Bin, Liu Yining, Wang King-Hang (2019) A secure authentication protocol for internet of vehicles. IEEE Access 7(1):12047–12057
Chen C-M, Xiang B, Wang K-H, Yeh K-H, Wu T-Y (2018) A robust mutual authentication with a key agreement scheme for session initiation protocol. Appl Sci 8(10):1789
Ruspini EH (1969) A new approach to clustering. Inf Control 15(1):22–32
Dunn JC (1973) A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. J Cybern 3(3):32–57
Bezdek JC (1981) Pattern recognition with fuzzy objective function algorithms. Adv Appl Pattern Recognit 22(1171):203–239
Geweniger T, Zülke D, Hammer B, Villmann T (2010) Median fuzzy c-means for clustering dissimilarity data. Neurocomputing 73:1109–1116
Xue Z, Shang Y, Feng A (2010) Semi-supervised outlier detection based on fuzzy rough C-means clustering. Math Comput Simul 80:1911–1921
Ji Z, Sun Q, Xia D (2011) A modified possobilistic fuzzy c-means clustering algorithm for bias field estimation and segmentation of brain MR image. Comput Med Imaging Graph 35:383–397
Fritz H, García-Escudero LA, Mayo-Iscar A (2013) Robust constrained fuzzy clustering. Inf Sci 245:38–52
Lai JZC, Juan EYT, Lai FJC (2013) Rough clustering using generalized fuzzy clustering algorithm. Pattern Recognit 46:2538–2547
Wang ZH, Fan JC (2018) A rough-set based measurement for the membership degree of fuzzy C-means algorithm. In: Proceedings of SPIE-the international society for optical engineering, 3rd international workshop on pattern recognition
Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11(5):341–356
Fan JC, Li Y, Tang LY, Wu GK (2018) RoughPSO: rough set-based particle swarm optimisation. Int J Bio-inspired Comput 12:245–253
Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492–1496
Liu R, Wang H et al (2018) Shared-nearest-neighbor-based clustering by fast search and find of density peaks. Inf Sci 450:200–226
Bie R, Mehmood R, Ruan S et al (2016) Adaptive fuzzy clustering by fast search and find of density peaks. Pers Ubiquitous Comput 20(5):785–793
Zahn CT (1971) Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans Comput 20(1):68–86
Fahad A, Alshatri N, Tari Z et al (2014) A survey of clustering algorithms for big data: taxonomy and empirical analysis. IEEE Trans Emerg Top Comput 2(3):267–279
Acknowledgements
We would like to thank the anonymous reviewers for their valuable comments and suggestions. This work is supported by Shandong Provincial Natural Science Foundation of China under Grant ZR2018MF009, The State Key Research Development Program of China under Grant 2017YFC0804406, National Natural Science Foundation of China under Grant 91746104, the Special Funds of Taishan Scholars Construction Project, and Leading Talent Project of Shandong University of Science and Technology.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Liu, Xy., Fan, Jc. & Chen, Zw. Improved fuzzy C-means algorithm based on density peak. Int. J. Mach. Learn. & Cyber. 11, 545–552 (2020). https://doi.org/10.1007/s13042-019-00993-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-019-00993-8