Improved Cuckoo Search Algorithm for Document Clustering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Improved Cuckoo Search Algorithm for Document Clustering


Efficient document clustering plays an important role in organizing and browsing the information in the World Wide Web. K-means is the most popular clustering algorithms, due to its simplicity and efficiency. However, it may be trapped in local minimum which leads to poor results. Recently, cuckoo search based clustering has proved to reach interesting results. By against, the number of iterations can increase dramatically due to its slowness convergence. In this paper, we propose an improved cuckoo search clustering algorithm in order to overcome the weakness of the conventional cuckoo search clustering. In this algorithm, the global search procedure is enhanced by a local search method. The experiments tests on four text document datasets and one standard dataset extracted from well known collections show the effectiveness and the robustness of the proposed algorithm to improve significantly the clustering quality in term of fitness function, f-measure and purity.
Fichier principal
Vignette du fichier
339159_1_En_18_Chapter.pdf (427.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01789952 , version 1 (11-05-2018)





Saida Ishak Boushaki, Nadjet Kamel, Omar Bendjeghaba. Improved Cuckoo Search Algorithm for Document Clustering. 5th International Conference on Computer Science and Its Applications (CIIA), May 2015, Saida, Algeria. pp.217-228, ⟨10.1007/978-3-319-19578-0_18⟩. ⟨hal-01789952⟩
511 View
217 Download



Gmail Facebook Twitter LinkedIn More