An Ellipsoidal K-Means for Document Clustering - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

An Ellipsoidal K-Means for Document Clustering

Résumé

We propose an extension of the spherical K-means algorithm to deal with settings where the number of data points is largely inferior to the number of dimensions. We assume the data to lie in local and dense regions of the original space and we propose to embed each cluster into its specific ellipsoid. A new objective function is introduced, analytical solutions are derived for both the centroids and the associated ellipsoids. Furthermore, a study on the complexity of this algorithm highlights that it is of same order as the regular K-means algorithm. Results on both synthetic and real data show the efficiency of the proposed method.
Fichier principal
Vignette du fichier
ellipsoidal_k_means.pdf (284.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01198898 , version 1 (14-09-2015)

Identifiants

Citer

Fabon Dzogang, Christophe Marsala, Marie-Jeanne Lesot, Maria Rifqi. An Ellipsoidal K-Means for Document Clustering. IEEE 12th International Conference on Data Mining (ICDM 2012), Dec 2012, Bruxelles, Belgium. pp.221-230, ⟨10.1109/ICDM.2012.126⟩. ⟨hal-01198898⟩
107 Consultations
119 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More