TY - JOUR
T1 - Complementary bidirectional fusion for multi-view graph clustering
AU - Tan, Yanjin
AU - Wu, Danyang
AU - Yang, Xiaojun
AU - Chen, Cen
AU - Man, Hong
AU - Xu, Jin
N1 - Publisher Copyright:
© 2025 Elsevier Ltd
PY - 2026/3
Y1 - 2026/3
N2 - Multi-view graph methods emphasize integrating the information from different views to obtain promising performance. To achieve this goal, we introduce a novel model that performs Complementary Bidirectional Fusion with Cross-view Graph Filter(CBF-CGF). Specifically, CBF-CGF employs graph filters to capture high-order neighborhood information and learns a consistent graph embedding through an adaptive bidirectional fusion mechanism between similarity matrices and their spectral embeddings. This consistency graph embedding preserves both the global connectivity patterns captured by the similarity matrix and the local geometric structure inherited from the spectral embedding. Notably, adaptive weights are introduced to the indicator matrix to mine characteristics of different clusters. To tackle the optimization challenges, we propose an efficient iterative algorithm and provide a detailed analysis of its convergence and complexity. Extensive experiments validate that our method can yield comparable performance to state-of-the-art methods on nine real-world datasets, particularly on the COIL20 dataset where all evaluation metrics surpass 96.43 %.
AB - Multi-view graph methods emphasize integrating the information from different views to obtain promising performance. To achieve this goal, we introduce a novel model that performs Complementary Bidirectional Fusion with Cross-view Graph Filter(CBF-CGF). Specifically, CBF-CGF employs graph filters to capture high-order neighborhood information and learns a consistent graph embedding through an adaptive bidirectional fusion mechanism between similarity matrices and their spectral embeddings. This consistency graph embedding preserves both the global connectivity patterns captured by the similarity matrix and the local geometric structure inherited from the spectral embedding. Notably, adaptive weights are introduced to the indicator matrix to mine characteristics of different clusters. To tackle the optimization challenges, we propose an efficient iterative algorithm and provide a detailed analysis of its convergence and complexity. Extensive experiments validate that our method can yield comparable performance to state-of-the-art methods on nine real-world datasets, particularly on the COIL20 dataset where all evaluation metrics surpass 96.43 %.
KW - Complementary bidirectional fusion
KW - Graph filter
KW - Multi-view graph clustering
KW - Similarity matrices
KW - Spectral embeddings
UR - https://www.scopus.com/pages/publications/105012581148
UR - https://www.scopus.com/pages/publications/105012581148#tab=citedBy
U2 - 10.1016/j.patcog.2025.112229
DO - 10.1016/j.patcog.2025.112229
M3 - Article
AN - SCOPUS:105012581148
SN - 0031-3203
VL - 171
JO - Pattern Recognition
JF - Pattern Recognition
M1 - 112229
ER -