Skip to Main content Skip to Navigation
Conference papers

Median Graph Shift: A New Clustering Algorithm for Graph Domain

Salim Jouili 1 Salvatore Tabbone 1 Vinciane Lacroix 2 
1 QGAR - Querying Graphics through Analysis and Recognition
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Salim Jouili Connect in order to contact the contributor
Submitted on : Sunday, October 17, 2010 - 6:46:49 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Long-term archiving on: : Thursday, June 30, 2011 - 1:33:38 PM


Files produced by the author(s)




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. pp.1051-4651, ⟨10.1109/ICPR.2010.238⟩. ⟨inria-00526991⟩



Record views


Files downloads