2014 | OriginalPaper | Buchkapitel
A New Hybrid Algorithm for Document Clustering Based on Cuckoo Search and K-means
verfasst von : Ishak Boushaki Saida, Nadjet Kamel, Bendjeghaba Omar
Erschienen in: Recent Advances on Soft Computing and Data Mining
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we propose a new approach for document clustering based on Cuckoo Search and K-means. Due to the random initialization of centroids, cuckoo search clustering can reach better solution but the number of iterations may increase drastically. In order to overcome this drawback, we propose to replace this randomness by k-means at the beginning step. The effectiveness of the proposed approach was tested on the benchmark extracted from Reuters 21578 Text Categorization Dataset and the UCI Machine Learning Repository. The obtained results show the efficiency of the new approach in term of reducing the number of iterations and fitness values. Furthermore, it can improve the quality of clustering measured by the famous F-measure.