Normalized mutual information (NMI) is a widely used metric for performance evaluation of community detection methods, recently proven to be affected by finite size effects. To overcome this issue, a metric called relative normalized mutual information (rNMI) has been proposed. However, we show here that rNMI is still a biased metric and may lead, under given circumstances, to erroneous conclusions. The bias is an effect of the so-called reverse finite size effect. We discuss different strategies to address this issue, and then propose a new metric, the corrected normalized mutual information (cNMI), symmetric and well normalized, in the form of empirical calculation and closed-form expression. The experiments show that cNMI not only removes the finite size effect of NMI but also the reverse finite size effect of rNMI, and is hence more suitable for performance evaluation of community detection methods and for other approaches typical of the more general clustering context.

A corrected normalized mutual information for performance evaluation of community detection

Nardini Christine
2016

Abstract

Normalized mutual information (NMI) is a widely used metric for performance evaluation of community detection methods, recently proven to be affected by finite size effects. To overcome this issue, a metric called relative normalized mutual information (rNMI) has been proposed. However, we show here that rNMI is still a biased metric and may lead, under given circumstances, to erroneous conclusions. The bias is an effect of the so-called reverse finite size effect. We discuss different strategies to address this issue, and then propose a new metric, the corrected normalized mutual information (cNMI), symmetric and well normalized, in the form of empirical calculation and closed-form expression. The experiments show that cNMI not only removes the finite size effect of NMI but also the reverse finite size effect of rNMI, and is hence more suitable for performance evaluation of community detection methods and for other approaches typical of the more general clustering context.
2016
Istituto Applicazioni del Calcolo ''Mauro Picone''
clustering techniques
random graphs
networks
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/386743
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 8
social impact