Leo Schwinn, Björn Eskofier, Kai Klede, Dario Zanca
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2305.03022")
get_code_for_paper("2305.03022")
have("2305.03022")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2305.03022.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2305.03022)
Connect an agent — have() is free.