Abstract : n the context of unsupervised clustering, a new algorithm for the domain of graphs is introduced. In this paper, the key idea is to adapt the mean-shift clustering and its variants proposed for the domain of feature vectors to graph clustering. These algorithms have been applied successfully in image analysis and computer vision domains. The proposed algorithm works in an iterative manner by shifting each graph towards the median graph in a neighborhood. Both the set median graph and the generalized median graph are tested for the shifting procedure. In the experiment part, a set of cluster validation indices are used to evaluate our clustering algorithm and a comparison with the well-known Kmeans algorithm is provided.
https://hal.inria.fr/inria-00526991
Contributeur : Salim Jouili
<>
Soumis le : dimanche 17 octobre 2010 - 18:46:49
Dernière modification le : mardi 24 avril 2018 - 13:37:14
Document(s) archivé(s) le : jeudi 30 juin 2011 - 13:33:38
Salim Jouili, Salvatore Tabbone, Vinciane Lacroix. Median Graph Shift: A New Clustering Algorithm for Graph Domain. 20th International Conference on Pattern Recognition - ICPR 2010, Aug 2010, Istanbul, Turkey. IEEE, pp.1051-4651, 2010, ICPR 2010 - 20th International Conference on Pattern Recognition. 〈http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5595828〉. 〈10.1109/ICPR.2010.238〉. 〈inria-00526991〉
