The ground truth about metadata and community detection in networks
Reads0
Chats0
TLDR
It is proved that no algorithm can uniquely solve community detection, and a general No Free Lunch theorem for community detection is proved, which implies that there can be no algorithm that is optimal for all possible community detection tasks.Abstract:
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 these 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. 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 structures.read more
Citations
More filters
Journal ArticleDOI
Mapping the community structure of the rat cerebral cortex with weighted stochastic block modeling
Joshua Faskowitz,Olaf Sporns +1 more
TL;DR: The findings demonstrate the potential benefits of adopting the WSBM, which can be applied to a single weighted and directed matrix such as the rat cerebral cortex connectome, to identify community structure with a broad definition that transcends the common modular approach.
Journal ArticleDOI
Multilayer Flows in Molecular Networks Identify Biological Modules in the Human Proteome
TL;DR: In this paper, the optimal value of the relax rate for the multiplex Infomap algorithm is proposed to characterize the meso-scale structure of multilayer networks. But the authors only consider the case of edge-colored networks.
Journal ArticleDOI
ClueNet: Clustering a temporal network based on topological similarity rather than denseness.
TL;DR: ClueNet is hypothesized that capturing temporal information earlier in the clustering process and doing so explicitly will improve results, and evaluated against six existing DNC methods on both social networks capturing evolving interactions between individuals and biological networks capturing interactions between biomolecules in the cell at different ages.
Posted Content
Community detection in node-attributed social networks: a survey
TL;DR: A recent survey of community detection in node-attributed social networks can be found in this article, where the authors perform an exhaustive search of known methods and propose a classification of them based on when and how structure and attributes are fused.
Journal ArticleDOI
Identifying Misaligned Inter-Group Links and Communities
TL;DR: This work provides algorithms that can identify misaligned links, network structures and communities, and applies these techniques to Reddit to demonstrate how these algorithms can be used to decipher inter-group dynamics in social media.
References
More filters
Journal ArticleDOI
Community structure in social and biological networks
Michelle Girvan,Mark Newman +1 more
TL;DR: This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Journal ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Proceedings ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Journal ArticleDOI
Community detection in graphs
TL;DR: A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists.
Journal ArticleDOI
Community detection in graphs
TL;DR: A thorough exposition of the main elements of the clustering problem can be found in this paper, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.