Clustering attributed graphs: Models, measures and methods

By Cécile Bothorel, Juan David Cruz, Matteo Magnani, Barbora Micenková. 2015

244 citations recorded by the source corpus.

Abstract Clustering a graph, i.e., assigning its nodes to groups, is an important operation whose best known application is the discovery of communities in social networks. Graph clustering and community detection have traditionally focused on graphs without attributes, with the notable exception of edge weights. However, these models only provide a partial representation of real social systems, that are thus often described using node attributes, representing features of the actors, and edge attributes, representing different kinds of relationships among them. We refer to these models as attributed graphs. Consequently, existing graph clustering methods have been recently extended to deal with node and edge attributes. This article is a literature survey on this topic, organizing, and presenting recent research results in a uniform way, characterizing the main existing clustering methods and highlighting their conceptual differences. We also cover the important topic of clustering evaluation and identify current open problems.

Subfields: Artificial Intelligence, Statistical and Nonlinear Physics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Stephan Günnemann
  2. Aleksandar Bojchevski
  3. Aaron Clauset
  4. Mark Newman
  5. Daniel Zügner
  6. Marinka Zitnik
  7. William L. Hamilton
  8. Santo Fortunato

In Statistical and Nonlinear Physics

  1. Stephan Günnemann
  2. Aaron Clauset
  3. Aleksandar Bojchevski
  4. Mark Newman
  5. Santo Fortunato
  6. Jure Leskovec
  7. Nistor Grozavu
  8. Younès Bennani

Citations in the corpus