Fuzzy C-Means Clustering Problem Based on Improved DNA Genetic Algorithm and Point Density Weighting

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the every kinds of fuzzy clustering algorithm, the fuzzy c-means clustering (FCM) is widely used in the implementation process, because of it has better local search ability and easy operation. But the fuzzy c-means clustering algorithm also has some inherent flaw and the insufficiency. In this paper, we propose some improvement for this shortcomings. Firstly, we improve the calculation method of the membership degree. Secondly, we join the density in the calculation of the membership degree. At the same time, in order to find the global optimal solution, we use the DNA genetic algorithm to assist the FCM algorithm to jump out of local optimal. In this paper, we use the Matlab2014 to realize the simulation and experiment. Firstly, we utilize the test functions and artificial datasets to prove the effectiveness of the improved DNA genetic algorithm. Secondly, we utilize the UCI data sets to validate the effectiveness of the improved fuzzy c-means algorithm. Finally, the improved fuzzy c-means algorithm was used to realize the classification for the Sogou lab corpus of text and the result proved the validity of the algorithm.

Cite

CITATION STYLE

APA

Jiang, Z., & Liu, X. (2019). Fuzzy C-Means Clustering Problem Based on Improved DNA Genetic Algorithm and Point Density Weighting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11354 LNCS, pp. 406–415). Springer Verlag. https://doi.org/10.1007/978-3-030-15127-0_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free