Research map / Learning theory and algorithms / Clustering
COPER: Correlation-based Permutations for Multi-View Clustering
Ran Eisenberg, Jonathan Svirsky, Ofir Lindenbaum
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 COPER, an end-to-end deep multi-view clustering framework for general data types that uses correlation-based permutations instead of a two-stage representation-then-clustering pipeline.
Problem
Multi-view clustering is usually domain-specific or relies on a suboptimal, computationally expensive two-stage process of representation learning followed by clustering.
Approach
An end-to-end deep multi-view clustering framework for general data types (images and tabular data, per the abstract) that is trained jointly rather than in two stages, using correlation-based permutations to align views.
Closest papers by meaning
- Medusa: A Multi-Scale High-order Contrastive Dual-Diffusion Approach for Multi-View Clustering (CVPR 2025 · similarity 0.90)
- Enhanced then Progressive Fusion with View Graph for Multi-View Clustering (CVPR 2025 · similarity 0.89)
- Incomplete and Unpaired Multi-View Graph Clustering with Cross-View Feature Fusion (AAAI 2025 · similarity 0.89)
- EASEMVC:Efficient Dual Selection Mechanism for Deep Multi-View Clustering (CVPR 2025 · similarity 0.89)
- Partial Multi-View Clustering via Self-Supervised Network (AAAI 2024 · similarity 0.89)
- A Non-parametric Graph Clustering Framework for Multi-View Data (AAAI 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.
