arrow
Return

Adaptive sparse graph for multi-view clustering

delete2026-01-21
delete0
PRE
AI
H
Haoyan Yang
Q
Qianyin Wei
T
Tianchuan Yang
J
Jipeng Guo
DOI:10.1016/j.dsp.2026.105944delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Graph-based multi-view clustering (MVGC) has aroused interest as it can exploit consistent and complementary information from multiple perspectives. The quality of the constructed similarity graph largely determines the clustering performance of MVGC. Many existing methods directly apply the acquired similarity graph for spectral clustering, ignoring the massive inter-cluster similarities in the graph, influencing cluster partition. Constructing the k-nearest neighbors (KNN) sparse graph to remove inter-cluster similarities is a common improvement. However, kNN graph requires extensive tuning of the parameter k. To solve this, we propose a graph-based multi-view clustering method based on the adaptive sparse graph (MNV-MC). Specifically, an initial similarity graph is obtained by a low-rank tensor learning framework. Then, the heuristic method, Mutual Nearest Neighbor Value (MNV), is proposed to adaptively select the optimal k based on density changes to construct the high-quality sparse similarity graph. After processing by the fusion mechanism, the graph is input into spectral clustering to obtain clustering results. Experiments indicate that MNV-MC achieves outstanding performance, and the effectiveness of MNV for adaptively k-value selection of KNN graph is verified. Specifically, MNV-MC achieves average improvements of 7.79% in ACC and 5.16% in NMI over the second-best method across eight datasets, and gains of 7.29% and 5.79% on four additional large-scale datasets. Notably, as a parameter-free post-processing step, MNV can be easily integrated to other MVGCs. Experiments show that MVGC methods significantly improve their performance after applying MNV. The code is publicly available at https://github.com/ytccyw/MNVMC .

Journal

D
Digital Signal Processing
IF:
3
Papers:
779
Citations:
0

Organization

C
College of Information Science and Technology
Scholars:
187
Papers: 84
Citations: 0
C
College of Animal Science and Technology
Scholars:
2.2K
Papers: 436
Citations: 0
S
School of Electrical Engineering
Scholars:
537
Papers: 243
Citations: 0
researcher View more organizations
Cited Papers

Cited Papers

Learning a Joint Affinity Graph for Multiview Subspace Clustering
err2019-07-01
err235
PREAI
errTang, Chang; Zhu, Xinzhong; Liu, Xinwang; Li, Miaomiao; Wang, Pichao; Zhang, Changqing; Wang, Lizhe
errShare
errSave
Triplets-based large-scale multi-view spectral clustering
err2025-06-02
err0
PREAI
errYang, Tianchuan; Wang, Chang-Dong; Guo, Jipeng; Li, Xiangcheng; Chen, Man-Sheng; Dang, Shuping; Chen, Haiqiang
errShare
errSave
Straightforward tensorized anchor graph learning for multi-view clustering
err2025-07-04
err0
PREAI
errYulin Zhou; Changpeng Wang; Lizhen Ji; Jiangshe Zhang
errShare
errSave
Smoothness-Induced Efficient Incomplete Multi-View Clustering
err
err0
PREAI
errTianchuan Yang; Haiqiang Chen; Haoyan Yang; Man-Sheng Chen; Xiangcheng Li; Youming Sun; Chang-Dong Wang
errShare
errSave
Weight consistency and cluster diversity based concept factorization for multi-view clustering
err2025-02-01
err0
PREAI
errTao,Youyang; Che,Hangjun; Li,Chenglu; Pan,Baicheng; Leung,Man-Fai
errShare
errSave
A novel density-based adaptive k nearest neighbor method for dealing with overlapping problem in imbalanced datasets
err2020-08-09
err0
PREAI
errBo-Wen Yuan; Xing-Gang Luo; Zhong-Liang Zhang; Yang Yu; Hong-Wei Huo; Tretter Johannes; Xiao-Dong Zou
errShare
errSave
researcher View more