.png){kind=icon}
返回
One-step multi-view graph clustering via bottom-up structural learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2026.113175.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In recent years, tensor-based methods have seen considerable success in multi-view clustering. However, the current approach has several limitations: 1) Insufficient exploration of underlying similarity information (i.e. latent representation); 2) Insufficient exploration of higher-order structure information of both inter-view and intra-view; 3) Treating clustering learning independently from tensor learning and the overall learning framework. To address these issues, we propose a unified framework called Bottom-up Structural Exploration for One-step Multi-view Graph Clustering (BSE_OMGC). Specifically, we first employ an anchor strategy to build similarity graphs, reducing the complexity of graph learning. To deeply represent the underlying similar information of the data and mitigate the influence of noise on similar structures in the original space, BSE_OMGC adaptively separates the noise matrix from the similarity graphs to learn high-quality enhanced graphs. Subsequently, from the bottom up, the enhanced graphs serve as the foundation for constructing high-order tensors. We rotate the constructed tensors and apply the t-TNN to preserve the low-rank properties and to better capture higher-order structure information of both inter-view and intra-view. Finally, we introduce a symmetric non-negative matrix factorization-based graph partitioning technique, which learns non-negative embeddings during dynamic optimization to reveal clustering results. This approach unifies clustering learning within the entire learning framework. Extensive experiments on multiple real-world multi-view datasets, along with comparisons to state-of-the-art methods, demonstrate the effectiveness and robustness of the proposed approach.
Keyword:
Multi-view clustering
Tensor-based methods
Similarity graph
Low-rank structure
Graph partitioning
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Graph Regularized and Feature Aware Matrix Factorization for Robust Incomplete Multi-View Clustering
PREAI
分享收藏Multi-view clustering via multi-manifold regularized non-negative matrix factorization.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAI分享收藏Partial Multiview Incomplete Multilabel Learning via Uncertainty-Driven Reliable Dynamic Fusion基于不确定性驱动的可靠动态融合的局部多视角不完整多标签学习
PREAI
分享收藏Joint learning of latent subspace and structured graph for multi-view clustering用于多视图聚类的潜在子空间和结构化图联合学习PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容