Research map / Learning theory and algorithms / Clustering
Bit-swapping Oriented Twin-memory Multi-view Clustering in Lifelong Incomplete Scenarios
Shengju Yu, Pei Zhang, Siwei Wang, Suyuan Liu, Xinhang Wan, Zhibin Dong, Tiejun Li, Xinwang Liu
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 bit-swapping, twin-memory multi-view clustering method for lifelong incomplete multi-view data, addressing knowledge propagation across newly arriving views.
Problem
Multi-view clustering in lifelong incomplete scenarios, where views arrive over time and data are partially missing; existing feature-library mechanisms ignore per-view basis embedding information and mapping alters learned landmarks and affinities.
Approach
Uses a twin-memory design with bit-swapping to retain per-view basis embedding information and avoid value drift of learned landmarks and affinities caused by mapping during continual view arrival, instead of relying only on a feature library.
Closest papers by meaning
- Medusa: A Multi-Scale High-order Contrastive Dual-Diffusion Approach for Multi-View Clustering (CVPR 2025 · similarity 0.90)
- Robust Multi-view Clustering against Imperfect Information (NeurIPS 2026 · similarity 0.88)
- EASEMVC:Efficient Dual Selection Mechanism for Deep Multi-View Clustering (CVPR 2025 · similarity 0.88)
- A Non-parametric Graph Clustering Framework for Multi-View Data (AAAI 2024 · similarity 0.88)
- Incomplete and Unpaired Multi-View Graph Clustering with Cross-View Feature Fusion (AAAI 2025 · similarity 0.88)
- From Spectrum-free towards Baseline-view-free: Double-track Proximity Driven Multi-view Clustering (ICML 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.
