I-Louvain: An Attributed Graph Clustering Method

David Combe (1) , Christine Largeron (1) , Mathias Géry (1) , Elod Egyed-Zsigmond (2)

1 LHC - Laboratoire Hubert Curien
2 DRIM - Distribution, Recherche d'Information et Mobilité

Modularity allows to estimate the quality of a partition into communities of a graph composed of highly interconnected vertices. In this article, we introduce a complementary measure, based on inertia, and specially conceived to evaluate the quality of a partition based on real attributes describing the vertices. We propose also I-Louvain, a graph nodes clustering method which uses our criterion , combined with Newman's modularity, in order to detect communities in attributed graph where real attributes are associated with the vertices. Our experiments show that combining the relational information with the attributes allows to detect the communities more efficiently than using only one type of information. In addition, our method is more robust to data degradation.

Mots clés: Attributed graph; Graph clustering; Social network; Community de-tection; Modularity

Domaines: Recherche d'information [cs.IR]

David Combe, Christine Largeron, Mathias Géry, Elod Egyed-Zsigmond. I-Louvain: An Attributed Graph Clustering Method. Intelligent Data Analysis, LaHC, University of Saint-Etienne, France, Oct 2015, Saint-Etienne, France. ⟨10.1007/978-3-319-24465-5_16⟩. ⟨ujm-01219447⟩