AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

The Cluster Structure Function

Andrew R. Cohen, Paul M. B. Vitanyi

TPAMI 2023 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use CSF curves as input to a shallow feedforward network instead of Gap Statistic curvesMNIST digit-count estimation · MNIST digit setsaccuracy: 54% -> 86%Improved
use CSF instead of Gap Statistic for unsupervised K selection (K true > 1)MNIST digit sets · MNIST digit setscorrelation r: -0.84 -> 0.93Improved
omit digit sets with K true = 1 from the correlation (ablation)CSF unsupervised selection · MNIST digit setscorrelationImproved
use FLIF compressor instead of BZIP and JPEG2000 (ablation)NCD for MNIST · MNIST digit setsclustering qualityImproved
ensemble segmentation with optimality deficiency selection instead of best single radiuscell segmentation · Cell tracking challenge (12 movies)DET: p=5e-4Improved
ensemble segmentation instead of best single radiuscell segmentation · Cell tracking challenge (12 movies)TRA: p=2e-3Improved
CSF instead of Gap, AIC, BIC for estimating Ksynthetic 3 Gaussian clusters · Synthetic K=3K estimation accuracyImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy