Research map / Learning theory and algorithms / Clustering
MPC: Multi-View Probabilistic Clustering
Junjie Liu, Junlong Liu, Shaotian Yan, Rongxin Jiang, Xiang Tian, Boxuan Gu, Yaowu Chen, Chen Shen, Jianqiang Huang
Check 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 the multi-view Bayesian posterior probability fusion formula rather than mean aggregation (ablation) | MPC · Handwritten, views 1–4 | ARI: 85.34 -> 89.15 | Improved |
| Use the multi-view Bayesian posterior probability fusion formula rather than min aggregation (ablation) | MPC · Handwritten, views 1–4 | ARI: 82.71 -> 89.15 | Improved |
| Use the multi-view Bayesian posterior probability fusion formula rather than max aggregation (ablation) | MPC · Handwritten, views 1–4 | ARI: 76.17 -> 89.15 | Improved |
| Add path propagation to co-neighbor propagation (ablation) | MPC · Handwritten | ARI: 76.75 -> 83.04 | Improved |
| Add co-neighbor propagation to path propagation (ablation) | MPC · Handwritten | ARI: 79.18 -> 83.04 | Improved |
| Use fast probabilistic clustering rather than K-means on the refined probabilities (ablation) | MPC · Handwritten | ARI: 74.56 -> 83.04 | Improved |
| Use fast probabilistic clustering rather than spectral clustering on the refined probabilities (ablation) | MPC · Handwritten | ARI: 71.45 -> 83.04 | Improved |
| Use fast probabilistic clustering rather than K-means on the refined probabilities (ablation) | MPC · Humbi240 | ARI: 82.39 -> 95.47 | Improved |
| Use fast probabilistic clustering rather than spectral clustering on the refined probabilities (ablation) | MPC · Humbi240 | ARI: 90.02 -> 95.47 | Improved |
| Use MPC instead of the strongest reported baseline | multi-view clustering · Handwritten, complete MVC | ARI: 76.51 -> 83.04 | Improved |
| Use MPC instead of the strongest reported baseline | multi-view clustering · Handwritten, IMVC (0.5 missing rate) | ARI: 72.95 -> 75.13 | Improved |
| Use MPC instead of the strongest reported baseline | multi-view clustering · 100Leaves, IMVC (0.5 missing rate) | ARI: 52.18 -> 57.94 | Improved |
Closest papers by meaning
- Investigating and Mitigating the Side Effects of Noisy Views for Self-Supervised Clustering Algorithms in Practical Multi-View Scenarios (CVPR 2024 · similarity 0.90)
- A Non-parametric Graph Clustering Framework for Multi-View Data (AAAI 2024 · similarity 0.90)
- Robust Multi-view Clustering against Imperfect Information (NeurIPS 2026 · similarity 0.89)
- Attribute-Missing Multi-view Graph Clustering (CVPR 2025 · similarity 0.88)
- Medusa: A Multi-Scale High-order Contrastive Dual-Diffusion Approach for Multi-View Clustering (CVPR 2025 · similarity 0.88)
- Multi-View Stochastic Block Models (ICML 2024 · 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.
