Multi-objective genetic algorithms, NSGA-II and SPEA2, for document clustering

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

Abstract

This paper proposes the multi-objective genetic algorithm (MOGA) for document clustering. The studied, hierarchical agglomerative algorithms,k-means algorithm and general genetic algorithm (GA) are more progressing in document clustering. However, in hierarchical agglomerative algorithms, efficiency is a problem (O(n 2logn)), k-means algorithm depends on too much the initial centroids, and general GA can converge to the local optimal value when defining an objective function which is not suitable. In this paper, two of MOGA's algorithms, NSGA-II and SPEA2 are applied to document clustering in order to complete these disadvantages. We compare to NSGA-II, SPEA2 and the existing clustering algorithms (k-means, general GA). Our experimental results show the average values of NSGA-II and SPEA2 are about 28% higher the clustering performance than the k-means algorithm and about 17% higher the clustering performance than the general GA. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Lee, J. S., Choi, L. C., & Park, S. C. (2011). Multi-objective genetic algorithms, NSGA-II and SPEA2, for document clustering. In Communications in Computer and Information Science (Vol. 257 CCIS, pp. 219–227). https://doi.org/10.1007/978-3-642-27207-3_22

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