FastAMI - a Monte Carlo Approach to the Adjustment for Chance in Clustering Comparison Metrics
Kai Klede, Leo Schwinn, Dario Zanca, Björn M. 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 computationally difficult, preventing unbiased ground-truth comparisons and solution selection. We propose FastAMI, a Monte Carlo-based method to efficiently approximate the Adjusted Mutual Information (AMI) and extend it to the Standardized Mutual Information (SMI). The approach is compared with the exact calculation and a recently developed variant of the AMI based on pairwise permutations, using both synthetic and real data. In contrast to the exact calculation our method is fast enough to enable these adjusted information-theoretic comparisons for large datasets while maintaining considerably more accurate results than the pairwise approach.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- An Evaluative Measure of Clustering Methods Incorporating Hyperparameter SensitivitySiddhartha Mishra, Nicholas Monath, Michael Boratko, Ariel Kobren 等AAAI 2022 · 被引用 6 次
- A sampling-based approach for efficient clustering in large datasetsGeorgios Exarchakis, Omar Oubari, Gregor LenzCVPR 2022 · 被引用 5 次
- Revisiting Probability Distribution Assumptions for Information Theoretic Feature SelectionYuan Sun, Wei Wang, Michael Kirley, Xiaodong Li 等AAAI 2020 · 被引用 3 次
- Neural Mutual Information Estimation with Vector CopulasYanzhi Chen, Zijing Ou, Adrian Weller, Michael U. GutmannNeurIPS 2025 · 被引用 4 次
- Sliced Mutual Information: A Scalable Measure of Statistical DependenceZiv Goldfeld, Kristjan H. GreenewaldNeurIPS 2021 · 被引用 48 次
