2019
DOI: 10.1007/978-3-030-36687-2_14
|View full text |Cite
|
Sign up to set email alerts
|

Metrics Matter in Community Detection

Abstract: We present a critical evaluation of normalized mutual information (NMI) as an evaluation metric for community detection. NMI exaggerates the leximin method's performance on weak communities: Does leximin, in finding the trivial singletons clustering, truly outperform eight other community detection methods? Three NMI improvements from the literature are AMI, rrNMI, and cNMI. We show equivalences under relevant random models, and for evaluating community detection, we advise one-sided AMI under the M all model … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 35 publications
0
5
0
Order By: Relevance
“…Adjusted Mutual Information (AMI) [ 60 , 61 ] is an adjustment of the Mutual Information (MI) score to account for chance. AMI augments NMI’s consistent upper bound (1.0) with a consistent zero expectation to adjust for chance clusterings.…”
Section: Resultsmentioning
confidence: 99%
“…Adjusted Mutual Information (AMI) [ 60 , 61 ] is an adjustment of the Mutual Information (MI) score to account for chance. AMI augments NMI’s consistent upper bound (1.0) with a consistent zero expectation to adjust for chance clusterings.…”
Section: Resultsmentioning
confidence: 99%
“…NMI is a useful information measure in information theory. It is introduced by Leon Danon et al [35] and used to measure the similarity between the detected communities and the known communities. Given two partitions A and B of a network in communities, let C be the confusion matrix whose element C ij is the number of nodes of community i of the partition A that are also in the community j of the partition B.…”
Section: Evaluation Metricsmentioning
confidence: 99%
“…Community mining algorithms are mainly divided into two categories: agglomeration [34], [35] and decomposition [36]. The basic idea of agglomeration algorithm is to add links for nodes with higher similarity.…”
Section: Construction Of the Community Structure Of Power Communmentioning
confidence: 99%