The ground truth about metadata and community detection in networks

08/20/2016
by   Leto Peel, et al.
0

Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system's components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate the performance of community detection algorithms by their ability to find so-called "ground truth" communities. This works well in synthetic networks with planted communities because such networks' links are formed explicitly based on those known communities. However, there are no planted communities in real world networks. Instead, it is standard practice to treat some observed discrete-valued node attributes, or metadata, as ground truth. Here, we show that metadata are not the same as ground truth, and that treating them as such induces severe theoretical and practical problems. We prove that no algorithm can uniquely solve community detection, and we prove a general No Free Lunch theorem for community detection, which implies that there can be no algorithm that is optimal for all possible community detection tasks. However, community detection remains a powerful tool and node metadata still have value so a careful exploration of their relationship with network structure can yield insights of genuine worth. We illustrate this point by introducing two statistical techniques that can quantify the relationship between metadata and community structure for a broad class of models. We demonstrate these techniques using both synthetic and real-world networks, and for multiple types of metadata and community structure.

READ FULL TEXT
research
02/28/2018

Evaluating Overfit and Underfit in Models of Network Community Structure

A common data mining task on networks is community detection, which seek...
research
10/24/2018

A Map Equation with Metadata: Varying the Role of Attributes in Community Detection

As the No Free Lunch theorem formally states [1], algorithms for detecti...
research
09/30/2022

Local dominance unveils clusters in networks

Clusters or communities can provide a coarse-grained description of comp...
research
11/12/2013

Hypothesis Testing for Automated Community Detection in Networks

Community detection in networks is a key exploratory tool with applicati...
research
06/10/2014

A Flexible Fitness Function for Community Detection in Complex Networks

Most community detection algorithms from the literature work as optimiza...
research
11/09/2021

Metadata-informed community detection with lazy encoding using absorbing random walks

Integrating structural information and metadata, such as gender, social ...
research
06/09/2021

Streaming Belief Propagation for Community Detection

The community detection problem requires to cluster the nodes of a netwo...

Please sign up or login with your details

Forgot password? Click here to reset