Research map / Learning theory and algorithms / Clustering
A Flexible EM-Like Clustering Algorithm for Noisy Data
Violeta Roizman, Matthieu Jonckheere, Frédéric Pascal
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use F-EM instead of GMM-EM | clustering · 20newsgroup | AMI: 0.3526 -> 0.4873 | Improved |
| use F-EM instead of GMM-EM | clustering · small NORB | AMI: 0.0476 -> 0.5321 | Improved |
| use F-EM instead of t-EM | clustering · small NORB | AMI: 0.4370 -> 0.5321 | Improved |
| use F-EM instead of t-EM | clustering · MNIST 7-1 | AMI: 0.8947 -> 0.8811 | Hurt |
| use F-EM instead of spectral clustering | clustering · MNIST 3-8-6 | AMI: 0.8272 -> 0.7918 | Hurt |
| use F-EM instead of TCLUST | clustering · MNIST 3-8-6 + noise | AMI: 0.6047 -> 0.4664 | Hurt |
| use F-EM instead of spectral clustering | clustering · MNIST 3-8-6 + noise | AMI: 0.3511 -> 0.4664 | Improved |
| use F-EM instead of GMM-EM | clustering · Synthetic setup 5 (mixed distributions per cluster) | ARI: 0.0187 -> 0.6946 | Improved |
| use F-EM instead of GMM-EM | clustering · Synthetic setup 3 (K, t, Gaussian clusters) | ARI: 0.7056 -> 0.9722 | Improved |
| use F-EM instead of t-EM | clustering · Synthetic setup 1 (t, dof=3) | ARI: 0.7895 -> 0.7513 | Hurt |
| use F-EM instead of t-EM | clustering · Synthetic setup 2 (t, dof=10) | ARI: 0.9233 -> 0.9208 | No clear effect |
| use F-EM instead of TCLUST | clustering · Synthetic setup 4 (uniform noise) | ARI: 0.9690 -> 0.8159 | Hurt |
Closest papers by meaning
- Clustering Semi-Random Mixtures of Gaussians (ICML 2018 · similarity 0.89)
- A Variational EM Acceleration for Efficient Clustering at Very Large Scales (TPAMI 2021 · similarity 0.89)
- Achieving Optimal Clustering in Gaussian Mixture Models with Anisotropic Covariance Structures (NeurIPS 2024 · similarity 0.86)
- Distributed $k$-Clustering for Data with Heavy Noise (NeurIPS 2018 · similarity 0.86)
- Fast Algorithms for Distributed k-Clustering with Outliers (ICML 2023 · similarity 0.86)
- Near-Linear Time Approximation Algorithms for k-means with Outliers (ICML 2024 · similarity 0.85)
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.
