Double layered genetic algorithm for document clustering

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

Abstract

Genetic algorithm for document clustering(GC) shows good performance. However the genetic algorithm has problem of performance degradation by premature convergence phenomenon(PCP). In this paper, we propose double layered genetic algorithm for document clustering(DLGC) to solve this problem. The clustering algorithms including DLGC are tested and compared on Reuter-21578 data collection. The results show that our DLGC has the best performance among traditional clustering algorithms(K-means, Group Average Clustering) and GC in various experiments. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Choi, L. C., Lee, J. S., & Park, S. C. (2011). Double layered genetic algorithm for document clustering. In Communications in Computer and Information Science (Vol. 257 CCIS, pp. 212–218). https://doi.org/10.1007/978-3-642-27207-3_21

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