pith. sign in

arxiv: 1110.2515 · v2 · pith:57DOSW63new · submitted 2011-10-11 · ⚛️ physics.soc-ph · cs.SI· physics.data-an

Normalized Mutual Information to evaluate overlapping community finding algorithms

classification ⚛️ physics.soc-ph cs.SIphysics.data-an
keywords measureclustersnormalizedsetsalgorithmsgiveninformationmeasures
0
0 comments X
read the original 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].

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Group-Aware Matrix Estimation and Latent Subspace Recovery

    stat.ML 2026-05 unverdicted novelty 6.0

    GAME is a convex estimator using overlapping nuclear-norm penalties on subgroup submatrices for low-rank matrix completion with known overlapping groups, providing finite-sample guarantees on reconstruction error and ...