Research map / Learning theory and algorithms / Clustering
Generalized Information-theoretic Multi-view Clustering
Weitian Huang, Sirui Yang, Hongmin Cai
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 |
|---|---|---|---|
| add KL clustering term (gamma>0) vs k-means on representation (IMC-v2 -> IMC) (ablation) | IMC · UCI-digits | ACC: 84.01 -> 92.13 | Improved |
| add KL clustering term vs IMC-v2 (ablation) | IMC · BDGP | NMI: 73.31 -> 84.40 | Improved |
| add KL clustering term vs IMC-v2 (ablation) | IMC · Caltech20 | ACC: 52.42 -> 60.82 | Improved |
| add information shift term (beta>0) vs IMC-v1 (ablation) | IMC · UCI-digits | ACC: 90.01 -> 92.13 | Improved |
| add information shift term vs IMC-v1 (ablation) | IMC · Notting-Hill | ACC: 77.79 -> 87.10 | Improved |
| add information shift term vs IMC-v1 (ablation) | IMC · Caltech20 | ACC: 58.05 -> 60.82 | Improved |
| add information shift term vs IMC-v1 (ablation) | IMC · BDGP | NMI: 81.47 -> 84.40 | Improved |
| end-to-end IMC vs two-stage Completer | IMC · BDGP | ACC: 79.31 -> 91.46 | Improved |
| IMC vs Completer on Caltech20 | IMC · Caltech20 | NMI: 70.25 -> 69.20 | Hurt |
| IMC vs Completer on Caltech20 | IMC · Caltech20 | ACC: 62.31 -> 60.82 | Hurt |
| IMC vs DMVAE (beta=0, gamma=1 special case) | IMC · Notting-Hill | ACC: 76.22 -> 87.10 | Improved |
| sparse noise 10% to 50% of pixels | IMC · UCI-digits | NMI: 86.82 -> 70.35 | Hurt |
Earlier methods this paper compares with
Named baselines from earlier accepted papers in this paper's results tables: better than 1 of 1 on most shared results.
- Completer — COMPLETER: Incomplete Multi-View Clustering via Contrastive Prediction (CVPR 2021) · better on 10 of 12 shared results
Matched by method name in results tables read by AI. Authors' own tables tend to favour the newer method, and a comparison can be missed when a method is renamed.
Closest papers by meaning
- Enhancing Multi-View Clustering: A Sufficient Information-Theoretic Approach for Consistency Acquisition and Redundancy Elimination (TPAMI 2026 · similarity 0.91)
- Differentiable Information Bottleneck for Deterministic Multi-view Clustering (CVPR 2024 · similarity 0.90)
- Medusa: A Multi-Scale High-order Contrastive Dual-Diffusion Approach for Multi-View Clustering (CVPR 2025 · similarity 0.89)
- Deep Variational Incomplete Multi-View Clustering: Exploring Shared Clustering Structures (AAAI 2024 · similarity 0.89)
- EASEMVC:Efficient Dual Selection Mechanism for Deep Multi-View Clustering (CVPR 2025 · similarity 0.88)
- Incomplete and Unpaired Multi-View Graph Clustering with Cross-View Feature Fusion (AAAI 2025 · similarity 0.88)
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.
