Comparative Study of Clustering Algorithms in Text Mining Context

• Autores: A. M. Jalil, I. Hafidi, L. Alami, E. Khouribga
• Localización: IJIMAI, ISSN-e 1989-1660, Vol. 3, Nº. 7, 2016, págs. 42-45
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • The spectacular increasing of Data is due to the appearance of networks and smartphones. Amount 42% of world population using internet [1]; have created a problem related of the processing of the data exchanged, which is rising exponentially and that should be automatically treated. This paper presents a classical process of knowledge discovery databases, in order to treat textual data. This process is divided into three parts: preprocessing, processing and post-processing. In the processing step, we present a comparative study between several clustering algorithms such as KMeans, Global KMeans, Fast Global KMeans, Two Level KMeans and FWKmeans. The comparison between these algorithms is made on real textual data from the web using RSS feeds. Experimental results identified two problems: the first one quality results which remain for algorithms, which rapidly converge. The second problem is due to the execution time that needs to decrease for some algorithms.