Improved mutual information measure for classification and community detection
The information theoretic quantity known as mutual information finds wide use in classification and community detection analyses to compare two classifications of the same set of objects into groups. In the context of classification algorithms, for instance, it is often used to compare discovered classes to known ground truth and hence to quantify algorithm performance. Here we argue that the standard mutual information, as commonly defined, omits a crucial term which can become large under real-world conditions, producing results that can be substantially in error. We demonstrate how to correct this error and define a mutual information that works in all cases. We discuss practical implementation of the new measure and give some example applications.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationCommunity DetectionGeneral ClassificationSimilar Papers 제목 키워드 기반
Normalized mutual information is a biased measure for classification and community detection
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 info…
Community DetectionCost-Effective Community-Hierarchy-Based Mutual Voting Approach for Influence Maximization in Complex Networks
Various types of promising techniques have come into being for influence maximization whose aim is to identify influential nodes in complex networks. In essence, real-world applications usually have high requirements on …
Resampled Mutual Information for Clustering and Community Detection
We introduce resampled mutual information (ResMI), a novel measure of clustering similarity that combines insights from information theoretic and pair counting approaches to clustering and community detection. Similar to…
ClusteringCommunity DetectionMutual Information in Community Detection with Covariate Information and Correlated Networks
We study the problem of community detection when there is covariate information about the node labels and one observes multiple correlated networks. We provide an asymptotic upper bound on the per-node mutual information…
Community DetectionUnderstanding Measures of Uncertainty for Adversarial Example Detection
Measuring uncertainty is a promising technique for detecting adversarial examples, crafted inputs on which the model predicts an incorrect class with high confidence. But many measures of uncertainty exist, including pre…
General Classification