Sep 2026· ACM Transactions on Intelligent Systems and Technology· 0 citations· 55 references
TL;DR
An innovative MVC method utilizing orthogonal non-negative anchor tensor factorization, termed ATFMC, which employs a shared-nearest-neighbor density peaks clustering algorithm, which integrates cross-view features to select high-quality anchors and achieves superior clustering performance.
Abstract
With the data explosion, the efficiency of complex multi-view data processing and clustering remains a critical challenge. Non-negative matrix factorization (NMF) has garnered widespread attention in multi-view clustering (MVC) due to its interpretability and efficiency. However, traditional NMF-based MVC approaches process each view separately, which fails to capture cross-view relationships. Considering these issues, this paper presents an innovative MVC method utilizing orthogonal non-negative anchor tensor factorization, termed ATFMC. This model employs a shared-nearest-neighbor density peaks clustering algorithm, which integrates cross-view features to select high-quality anchors. After constructing the anchor tensor by stacking anchor graphs, we apply one-side orthogonal non-negative tensor factorization to it. This approach improves interpretability and eliminates post-processing steps for cluster label extraction. To accurately approximate the tensor rank, the tensor Schatten \(p\) -norm is employed on the rotated clustering indicator tensor. In addition, anchor-driven manifold regularization is leveraged to preserve the local geometric relationships among anchors, ensuring consistent topological connectivity across views. An efficient optimization algorithm is proposed, with proven convergence of its iterative sequence to a Karush-Kuhn-Tucker (KKT) critical point. Numerous experiments on multiple benchmark datasets demonstrate that ATFMC achieves superior clustering performance.
A novel multi-view clustering model based on non-negative tensor factorization (NTF), which employs multi-level fusion (both data-level and decision-level) to achieve view-consistent labels for multi-view data is proposed.
Quan-Xue Gao, Rui Wang, Jing Li et al.· IEEE Transactions on Pattern...· 0 citations
Multi-view Clustering via Manifold Decomposition is proposed, which directly infers cluster labels from multi-view data without explicit similarity graph construction or anchor selection, and reformulates multi-view clustering as a unified multi-view regression problem, where cluster labels are optimized as model varia...
Xiao-Wei Zhao, Xin-Yue Kou, Yan Chen et al.· Proceedings of the Thirty-Fi...· 0 citations
Multi-view clustering has emerged as a significant research direction in the information age, as multiple feature representations become increasingly available. However, traditional multi-view clustering methods are often unsupervised and fail to exploit available label information. In practice, fully labeled data are...
Lin Hu, Song Jiang, Xiu Liu et al.· Symmetry· 0 citations
A pairwise co-regularization mechanism is introduced to capture cross-view structural correlations by measuring the similarity between view-specific coefficient matrices and a stochastic acceleration strategy is incorporated to expedite convergence.
This paper proposes a novel framework termed Few-shot Anchor-guided Multi-view Clustering with Pearson Correlation (FAMC-PC), which establishes a tuning-free design, substantially reducing the computational burden and labor costs associated with manual hyper-parameter tuning.
Song-Tao Li, Yi-Peng Wang, Yi-Tong Fan et al.· IEEE Transactions on Image P...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.