Normalized Mutual Information to evaluate overlapping community finding algorithms

Abstract

Given the increasing popularity of algorithms for overlapping clustering, in particular in social network analysis, quantitative measures are needed to measure the accuracy of a method. Given a set of true clusters, and the set of clusters found by an algorithm, these sets of clusters must be compared to see how similar or different the sets are. A normalized measure is desirable in many contexts, for example assigning a value of 0 where the two sets are totally dissimilar, and 1 where they are identical. A measure based on normalized mutual information, [1], has recently become popular. We demonstrate unintuitive behaviour of this measure, and show how this can be corrected by using a more conventional normalization. We compare the results to that of other measures, such as the Omega index [2].

References in corpus (1)

• Detecting the overlapping and hierarchical community structure of complex networks

Cited by in corpus (35)

• Structure and inference in annotated networks
• A Large-Scale Community Structure Analysis In Facebook
• Improved mutual information measure for classification and community detection
• CLARE: A Semi-supervised Community Detection Algorithm
• GenPerm: A Unified Method for Detecting Non-overlapping and Overlapping Communities
• Overlapping Community Detection with Graph Neural Networks
• Connected but Segregated: Social Networks in Rural Villages
• Comparing network covers using mutual information
• Learning Intra-Batch Connections for Deep Metric Learning
• CoarSAS2hvec: Heterogeneous Information Network Embedding with Balanced Network Sampling
• Reducing over-clustering via the powered Chinese restaurant process
• Nested partitions from hierarchical clustering statistical validation
• Clique percolation method: memory efficient almost exact communities
• A survey on Bayesian inference for Gaussian mixture model
• Exploring triad-rich substructures by graph-theoretic characterizations in complex networks
• Overlapping Communities in Social Networks
• Benchmarking community detection methods on social media data
• Core-periphery Detection Based on Masked Bayesian Non-negative Matrix Factorization
• Clubmark: a Parallel Isolation Framework for Benchmarking and Profiling Clustering Algorithms on NUMA Architectures
• The Atlas for the Aspiring Network Scientist
• Exploiting Contextual Information with Deep Neural Networks
• Hidden Community Detection in Social Networks
• Metrics for Community Analysis: A Survey
• Overlapping Community Detection in Temporal Text Networks
• Weighted Label Propagation Algorithm based on Local Edge Betweenness
• Deep learning tackles single-cell analysis A survey of deep learning for scRNA-seq analysis
• Community detection algorithm evaluation with ground-truth data
• MLAS: Metric Learning on Attributed Sequences
• Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Perspective
• Correlation-Based Community Detection
• To Word Senses and Beyond: Inducing Concepts with Contextualized Language Models
• GI-OHMS: Graphical Inference to Detect Overlapping Communities
• Sparse-Interest Network for Sequential Recommendation
• Performance Analysis and Robustification of Single-query 6-DoF Camera Pose Estimation
• High-Quality Disjoint and Overlapping Community Structure in Large-Scale Complex Networks