paper-with-me

홈 › Papers

$p$-value Adjustment for Monotonous, Unbiased, and Fast Clustering Comparison

2023-09-21 · NeurIPS 2023 11

Popular metrics for clustering comparison, like the Adjusted Rand Index and the Adjusted Mutual Information, are type II biased. The Standardized Mutual Information removes this bias but suffers from counterintuitive non-monotonicity and poor computational efficiency. We introduce the $p$-value adjusted Rand Index ($\operatorname{PMI}_2$), the first cluster comparison method that is type II unbiased and provably monotonous. The $\operatorname{PMI}_2$ has fast approximations that outperform the Standardized Mutual information. We demonstrate its unbiased clustering selection, approximation quality, and runtime efficiency on synthetic benchmarks. In experiments on image and social network datasets, we show how the $\operatorname{PMI}_2$ can help practitioners choose better clustering and community detection algorithms.

📄 PDF Abstract BibTeX

Code (1)

mad-lab-fau/pmi-experiments 공식 구현

Similar Papers 제목 키워드 기반

FastAMI -- a Monte Carlo Approach to the Adjustment for Chance in Clustering Comparison Metrics

2023-05-03 · Kai Klede, Leo Schwinn, Dario Zanca, Björn Eskofier

Clustering is at the very core of machine learning, and its applications proliferate with the increasing availability of data. However, as datasets grow, comparing clusterings with an adjustment for chance becomes comput…

Clustering

Adjustment and Alignment for Unbiased Open Set Domain Adaptation

2023-01-01 · CVPR 2023 1 · Wuyang Li, Jie Liu, Bo Han, Yixuan Yuan

Open Set Domain Adaptation (OSDA) transfers the model from a label-rich domain to a label-free one containing novel-class samples. Existing OSDA works overlook abundant novel-class semantics hidden in the source doma…

Domain AdaptationModel Optimization

Fusion Moves for Correlation Clustering

2015-06-01 · CVPR 2015 6 · Thorsten Beier, Fred A. Hamprecht, Jorg H. Kappes

Correlation clustering, or multicut partitioning, is widely used in image segmentation for partitioning an undirected graph or image with positive and negative edge weights such that the sum of cut edge weights is minim…

ClusteringImage SegmentationSemantic Segmentationvalid

Monotonous (Semi-)Nonnegative Matrix Factorization

2015-05-01 · Nirav Bhatt, Arun Ayyar

Nonnegative matrix factorization (NMF) factorizes a non-negative matrix into product of two non-negative matrices, namely a signal matrix and a mixing matrix. NMF suffers from the scale and ordering ambiguities. Often, t…

Higher-Order Spectral Clustering for Geometric Graphs

2020-09-23 · Konstantin Avrachenkov, Andrei Bobu, Maximilien Dreveton

The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalization, which we call higher-order spectral…

Clustering