z-logo
open-access-imgOpen Access
Text Documents Clustering using Genetic Algorithm and Discrete Differential Evolution
Author(s) -
Yogesh KumarMeena,
Shashank Shashank,
Vibhav Prakash Singh
Publication year - 2012
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/6067-8221
Subject(s) - computer science , cluster analysis , differential (mechanical device) , data mining , genetic algorithm , algorithm , information retrieval , artificial intelligence , machine learning , physics , thermodynamics
Clustering in data mining is a discovery process that groups a set of documents such that documents within a cluster have high similarity while documents in different clusters have low similarity. Existing clustering method like K-means is a popular method but its results are based on choice of cluster centers so it easily results in local optimization. Genetic Algorithm (GA) is an optimization method which can be applied for finding out the best cluster centers easily. But sometimes it takes more iteration for finding best cluster centers. In this paper, we use features of GA with the features of Discrete Differential Evolution (DDE) to solve text documents clustering problem. To test the efficiency of our algorithm we have taken sample database of Reuters-21578. From the experimental results, it is clear that our algorithm performs better than GA and DDE.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom