Multi-View Clustering via Block-Diagonal Low-Rank Graph Filtering
Authors:
- Wanrong GuWGWanrong Gu
- QiaoLei ZhuQZQiaoLei Zhu
- Haiyan WangHWHaiyan Wang
- Jiazhou ChenJCJiazhou Chen
- Hongmin CaiHCHongmin Cai
Preprint
- 25 July 2026
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
In recent years, graph-filter-based multi-view clustering methods have attracted increasing attention due to their robust feature learning capability. However, most existing approaches directly impose manifold smoothness on noisy initial graphs, which leads to insufficient feature discriminability. Moreover, graph filtering and clustering are typically performed independently, making it difficult for predefined filters to adapt to specific clustering objectives. To address these issues, we propose a Multi-View Clustering via Block-Diagonal Low-Rank Graph Filtering framework (BDLR‐GF). The core idea is to construct an ideal affinity matrix with a block-diagonal low-rank structure via the outer product of spectral embeddings, which replaces the original adjacency matrix directly used in conventional manifold regularization, thereby enabling the graph filter to learn from more reliable geometric constraints. BDLR‐GF jointly optimizes consensus graph construction and adaptive graph filtering by exploiting this purified affinity matrix, forming a closed-loop framework that dynamically adapts the filter to clustering needs and ultimately produces a consensus graph highly aligned with the clustering objective. Extensive experiments on multiple benchmark datasets demonstrate that BDLR‐GF outperforms state-of-the-art methods in terms of clustering accuracy and other metrics, verifying its superiority.Keywords
This publication has 29 references indexed in Scilit:
- Image Clustering With Transition Probabilities LearningIEEE Transactions on Image Processing, 2025
- Dual Consensus Anchor Learning for Fast Multi-View ClusteringIEEE Transactions on Image Processing, 2024
- Adaptive Consensus Clustering for Multiple K-Means Via Base Results RefiningIEEE Transactions on Knowledge and Data Engineering, 2023
- Self-Supervised Graph Completion for Incomplete Multi-View ClusteringIEEE Transactions on Knowledge and Data Engineering, 2023
- Fast Multi-View Clustering Via Ensembles: Towards Scalability, Superiority, and SimplicityIEEE Transactions on Knowledge and Data Engineering, 2023
- Tensorial Multi-View Clustering via Low-Rank Constrained High-Order Graph LearningIEEE Transactions on Circuits and Systems for Video Technology, 2022
- A Multi-View Co-Training Clustering Algorithm Based on Global and Local Structure PreservingIEEE Access, 2021
- GMC: Graph-Based Multi-View ClusteringIEEE Transactions on Knowledge and Data Engineering, 2019
- Global Convergence of ADMM in Nonconvex Nonsmooth OptimizationJournal of Scientific Computing, 2018
- Fast projection onto the simplex and the $\pmb {l}_\mathbf {1}$ l 1 ballMathematical Programming, 2015