Normalized mutual information is a biased measure for classification and community detection
Not on the map. Why?
Abstract (arXiv)
Normalized mutual information is widely used as a similarity measure for evaluating the performance of clustering and classification algorithms. In this paper, we argue that results returned by the normalized mutual information are biased for two reasons: first, because they ignore the information content of the contingency table and, second, because their symmetric normalization introduces spurious dependence on algorithm output. We introduce a modified version of the mutual information that remedies both of these shortcomings. As a practical demonstration of the importance of using an unbiased measure, we perform extensive numerical tests on a basket of popular algorithms for network community detection and show that one's conclusions about which algorithm is best are significantly affected by the biases in the traditional mutual information.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 15 of its 69 references that are in the map. First posted on arXiv 3 Jul 2023.
Builds on
15 of 69 references.
References · 15
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 379
- 2016Community detection in networks: A user guidecited by 105
- 2013Community detection thresholds and the weak Ramanujan propertycited by 47
- 2016The ground truth about metadata and community detection in networkscited by 42
- 2017The Impact of Random Models on Clustering Similaritycited by 34
- 2016A Comparative Analysis of Community Detection Algorithms on Artificial Networkscited by 23
- 2016Nonparametric Bayesian inference of the microcanonical stochastic block modelcited by 21
- 2018Prioritizing network communitiescited by 14
- 2022Inference of hyperedges and overlapping communities in hypergraphscited by 13
- 2015Evaluating accuracy of community detection using the relative normalized mutual informationcited by 7
- 2020Revealing consensus and dissensus between network partitionscited by 7
- 2023Network community detection via neural embeddingscited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 3; 2026: 2.
7 papers.
- 2024Dial-In LLM: Human-Aligned LLM-in-the-loop Intent Clustering for Customer Service Dialoguescited by 11
- 2023Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detectioncited by 4
- 2026Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Modelcited by 1
- 2025Robust Markov stability for community detection at a scale learned based on the structurecited by 0
- 2025Assessing wildfire susceptibility in Iran: Leveraging machine learning for geospatial analysis of climatic and anthropogenic factorscited by 0
- 2025Unifying Information-Theoretic and Pair-Counting Clustering Similaritycited by 0
- 2026NMINE: Normalized Mutual Information Neural Estimationcited by 0
- 2026NMINE: Normalized Mutual Information Neural Estimation30 Jul 2026
- 2026Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Model9 Jan 2026
- 2025Unifying Information-Theoretic and Pair-Counting Clustering Similarity4 Nov 2025
- 2025Assessing wildfire susceptibility in Iran: Leveraging machine learning for geospatial analysis of climatic and anthropogenic factors20 May 2025
- 2025Robust Markov stability for community detection at a scale learned based on the structure15 Apr 2025
- 2024Dial-In LLM: Human-Aligned LLM-in-the-loop Intent Clustering for Customer Service Dialogues12 Dec 2024
- 2023Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection17 Oct 2023