Clustering attributed graphs: models, measures and methods

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.

Accepted for publication, Network Science journal

References in corpus (8)

• Emergence of scaling in random networks
• Fast unfolding of communities in large networks
• Finding and evaluating community structure in networks
• Community detection in graphs
• Natural Scales in Geographical Patterns
• Uncovering the overlapping community structure of complex networks in nature and society
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Community detection in networks: Structural communities versus ground truth