Empirical Evaluation of Clustering Algorithms for Large Networks

Guillaume Artignan 1, * Mountaz Hascoët 1
* Auteur correspondant
1 LIRMM/HE - Hors Équipe
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Clustering is probably one of the most frequently used approaches when facing a scaling problem in large networks. In many situations, however, the choice of the most appropriate algorithm for clustering can turn into a real dilemma. Numerical criteria have been proposed to evaluate the quality of the results of clustering algorithms. However, so many different criteria have been proposed that the dilemma gets even worse. Most criteria reveal different aspects of the quality of the results and hide others. The aim of this paper is to help with the understanding of clustering and to facilitate the comparison and the choice of clustering algorithm for a given purpose. Our proposal consists of studying both quality evaluation criteria and clustering algorithms. We start by discussing a selected set of representative criteria, and further conduct a case study on a large set of real data, measuring not only the quality of different representative clustering algorithms but also the impact of each criterion on the ranking of the algorithms. By providing empirical results on several large-scale corpus of either inter-related documents or lexical networks, we hope to clarify the field and facilitate designers' choices.
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

Contributeur : Guillaume Artignan <>
Soumis le : lundi 5 décembre 2011 - 15:42:12
Dernière modification le : jeudi 24 mai 2018 - 15:59:21
Document(s) archivé(s) le : mardi 6 mars 2012 - 02:35:52


Fichiers produits par l'(les) auteur(s)


  • HAL Id : lirmm-00648389, version 1


Guillaume Artignan, Mountaz Hascoët. Empirical Evaluation of Clustering Algorithms for Large Networks. 2011. 〈lirmm-00648389〉



Consultations de la notice


Téléchargements de fichiers