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
Community Discovery in Dynamic Networks: A Survey
Giulio Rossetti,Rémy Cazabet +1 more
TL;DR: In this article, the authors present the distinctive features and challenges of dynamic community discovery and propose a classification of published approaches, which can be used to identify the set of approaches that best fit their needs.
Journal ArticleDOI
Global energy flows embodied in international trade: A combination of environmentally extended input–output analysis and complex network analysis
TL;DR: In this paper, the authors apply a variety of complex network analysis tools to uncover the structure of embodied energy flow network (EEFN) at global, regional and national level, based on environmentally extended input-output analysis (EEIOA).
Journal ArticleDOI
Metrics for Community Analysis: A Survey
TL;DR: A survey of the metrics used for community detection and evaluation can be found in this paper, where the authors also conduct experiments on synthetic and real networks to present a comparative analysis of these metrics in measuring the goodness of the underlying community structure.
Journal ArticleDOI
The modular organization of human anatomical brain networks: Accounting for the cost of wiring
Richard F. Betzel,John D. Medaglia,Lia Papadopoulos,Graham L. Baum,Ruben C. Gur,Raquel E. Gur,David R. Roalf,Theodore D. Satterthwaite,Danielle S. Bassett +8 more
TL;DR: A modification of an existing module detection algorithm that allowed it to focus on connections that are unexpected under a cost-reduction wiring rule and to identify modules from among these connections, which support the hypothesis that brain networks are composed of modules and provide additional insight into the function of those modules.
Journal ArticleDOI
Community detection in node-attributed social networks: A survey
TL;DR: An exhaustive search of known methods is performed and a classification of them based on when and how structure and attributes are fused is proposed, which pays attention to available information which methods outperform others and which datasets and quality measures are used for their evaluation.
References
More filters
Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs
Charles Bordenave,Marc Lelarge +1 more
TL;DR: In this paper, the largest eigenvalues of the non-backtracking matrix of the Erd}os-Renyi random graph and of the Stochastic Block Model in the regime where the number of edges is proportional to the number====== of vertices were studied.
Journal ArticleDOI
Clique Graphs and Overlapping Communities
TL;DR: A benchmark network is shown where clique graphs find the overlapping communities accurately while vertex partition methods fail, and how a clique graph may be exploited.
Journal ArticleDOI
Entropy of stochastic blockmodel ensembles.
TL;DR: This paper derives expressions for the entropy of stochastic blockmodel ensembles from several ensemble variants, including the traditional model as well as the newly introduced degree-corrected version, which imposes a degree sequence on the vertices, in addition to the block structure.
Proceedings ArticleDOI
Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs
TL;DR: In this article, the largest eigenvectors of the non-backtracking matrix of the Erdos-Renyi random graph and of the Stochastic Block Model in the regime where the number of edges is proportional to the total number of vertices were studied.
Proceedings ArticleDOI
Using community information to improve the precision of link prediction methods
TL;DR: It is shown that for many networks, the inclusion of community information improves the accuracy of similarity-based link prediction methods.