Fast and Simple Deterministic Seeding of KMeans for Text Document Clustering - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Fast and Simple Deterministic Seeding of KMeans for Text Document Clustering

, (1) ,
1
Ehsan Sherkat
  • Fonction : Auteur
Evangelos E. Milios
  • Fonction : Auteur

Résumé

KMeans is one of the most popular document clustering algorithms. It is usually initialized by random seeds that can drastically impact the final algorithm performance. There exists many random or order-sensitive methods that try to properly initialize KMeans but their problem is that their result is non-deterministic and unrepeatable. Thus KMeans needs to be initialized several times to get a better result, which is a time-consuming operation. In this paper, we introduce a novel deter-AQ1 ministic seeding method for KMeans that is specifically designed for text document clustering. Due to its simplicity, it is fast and can be scaled to large datasets. Experimental results on several real-world datasets demonstrate that the proposed method has overall better performance compared to several deterministic, random, or order-sensitive methods in terms of clustering quality and runtime.
Fichier principal
Vignette du fichier
clef-2018.pdf (1.59 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01953432 , version 1 (12-12-2018)

Identifiants

Citer

Ehsan Sherkat, Julien Velcin, Evangelos E. Milios. Fast and Simple Deterministic Seeding of KMeans for Text Document Clustering. 9th Conference and Labs of the Evaluation Forum (CLEF), Sep 2018, Avignon, France. pp.76-88, ⟨10.1007/978-3-319-98932-7_7⟩. ⟨hal-01953432⟩
54 Consultations
365 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More