Research map / Learning theory and algorithms / Clustering
Learning from Disjoint Views: A Contrastive Prototype Matching Network for Fully Incomplete Multi-View Clustering
Yiming Wang, Qun Li, Dongxia Chang, Jie Wen, Hua Dai, Fu Xiao, Yao Zhao
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes a contrastive prototype matching network for fully incomplete multi-view clustering, where views have no cross-view sample correspondences.
Problem
Multi-view clustering when views are fully incomplete, i.e., no correspondences exist across views, so methods relying on partial alignment fail.
Approach
Uses contrastive learning with prototype matching to align disjoint views without requiring any cross-view sample correspondence; details truncated in the provided abstract.
Closest papers by meaning
- Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding (AAAI 2024 · similarity 0.91)
- Medusa: A Multi-Scale High-order Contrastive Dual-Diffusion Approach for Multi-View Clustering (CVPR 2025 · similarity 0.90)
- Sample-Level Cross-View Similarity Learning for Incomplete Multi-View Clustering (AAAI 2024 · similarity 0.90)
- EASEMVC:Efficient Dual Selection Mechanism for Deep Multi-View Clustering (CVPR 2025 · similarity 0.90)
- Incomplete Multi-view Clustering via Diffusion Contrastive Generation (AAAI 2025 · similarity 0.90)
- Ambiguous Instance-Aware Contrastive Network with Multi-Level Matching for Multi-View Document Clustering (AAAI 2025 · similarity 0.89)
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.
