mlsanityData to 7 Oct 2026

Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering

arXiv 1608.05560 ↗First posted 19 Aug 2016cs.LG stat.MLcited by 18

Not on the map. Why?

Abstract (arXiv)

Multi-view spectral clustering, which aims at yielding an agreement or consensus data objects grouping across multi-views with their graph laplacian matrices, is a fundamental clustering problem. Among the existing methods, Low-Rank Representation (LRR) based method is quite superior in terms of its effectiveness, intuitiveness and robustness to noise corruptions. However, it aggressively tries to learn a common low-dimensional subspace for multi-view data, while inattentively ignoring the local manifold structure in each view, which is critically important to the spectral clustering; worse still, the low-rank minimization is enforced to achieve the data correlation consensus among all views, failing to flexibly preserve the local manifold structure for each view. In this paper, 1) we propose a multi-graph laplacian regularized LRR with each graph laplacian corresponding to one view to characterize its local manifold structure. 2) Instead of directly enforcing the low-rank minimization among all views for correlation consensus, we separately impose low-rank constraint on each view, coupled with a mutual structural consensus constraint, where it is able to not only well preserve the local manifold structure but also serve as a constraint for that from other views, which iteratively makes the views more agreeable. Extensive experiments on real-world multi-view data sets demonstrate its superiority.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Aug 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 2; 2023: 6; 2024: 3; 2025: 1.

18 papers.

Sort:

  1. 2021Self-Supervised Discriminative Feature Learning for Deep Multi-View Clusteringcited by 41
  2. 2021Structured Graph Learning for Scalable Subspace Clustering: From Single-view to Multi-viewcited by 30
  3. 2023Investigating and Mitigating the Side Effects of Noisy Views for Self-Supervised Clustering Algorithms in Practical Multi-View Scenarioscited by 19
  4. 2022Seeking Commonness and Inconsistencies: A Jointly Smoothed Approach to Multi-view Subspace Clusteringcited by 13
  5. 2025A Comprehensive Survey on Spectral Clustering with Graph Structure Learningcited by 10
  6. 2021Combining pretrained CNN feature extractors to enhance clustering of complex natural imagescited by 7
  7. 2023Multi-view MERA Subspace Clusteringcited by 7
  8. 2023Fine-grained Cross-modal Fusion based Refinement for Text-to-Image Synthesiscited by 6
  9. 2023Federated Deep Multi-View Clustering with Global Self-Supervisioncited by 5
  10. 2024Manifold-based Incomplete Multi-view Clustering via Bi-Consistency Guidancecited by 5
  11. 2023Graph-Collaborated Auto-Encoder Hashing for Multi-view Binary Clusteringcited by 4
  12. 2021Smoothed Multi-View Subspace Clusteringcited by 3
6 more
  1. 2021Deep Adversarial Inconsistent Cognitive Sampling for Multi-view Progressive Subspace Clusteringcited by 0
  2. 2021Multi-view Clustering with Deep Matrix Factorization and Global Graph Refinementcited by 0
  3. 2022Deep Cost-sensitive Learning for Wheat Frost Detectioncited by 0
  4. 2023Domain Adaptive Person Search via GAN-based Scene Synthesis for Cross-scene Videoscited by 0
  5. 2024Scalable Multi-view Clustering via Explicit Kernel Features Mapscited by 0
  6. 2024Anchor Learning with Potential Cluster Constraints for Multi-view Clusteringcited by 0