Normalized Mutual Information to evaluate overlapping community finding algorithms

Aaron F. McDaid, Derek Greene, Neil Hurley
10/11/2011
physics.soc-phcs.SIphysics.data-an

Official code: aaronmcdaid/Overlapping-NMI (54 stars, last commit 2016-10-24).

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].

View on arXivView PDF

Code Implementations(1)

5425C, C++Feb 27, 20119 years ago

Cite this paper

@article{mcdaid2011normalized,
  title  = {Normalized Mutual Information to evaluate overlapping community finding algorithms},
  author = {Aaron F. McDaid and Derek Greene and Neil Hurley},
  year   = {2011},
  eprint = {1110.2515},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1110.2515}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1110.2515.svg)](https://codeofpaper.com/paper/1110.2515)

Discussion