Sep 2026· Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence· 0 citations· 30 references
TL;DR
The Dual-tOpology learning with adapTive Anchors (DOTA) is proposed, which not only learns the sample-anchor relationship but also preserves the topology structure among anchors, significantly enhancing the discriminability of learned representation while preserving the underlying data manifold.
Abstract
As a prominent paradigm for large-scale unsupervised learning, anchor-based multi-view clustering aims to reveal the latent structures across heterogeneous data representations with high efficiency. Despite achieving some progress, existing methods typically suffer from the following two limitations. Firstly, they rely on pre-constructed anchors or rigid constraints (e.g., orthogonality), whereas the intrinsic topological correlations among anchors are completely discarded. Secondly, most existing methods either perform clustering directly on the bipartite graph or treat different views equally, thereby failing to capture the global structural information. To this end, the Dual-tOpology learning with adapTive Anchors (DOTA) is proposed, which not only learns the sample-anchor relationship (i.e., bipartite graph) but also preserves the topology structure among anchors, significantly enhancing the discriminability of learned representation while preserving the underlying data manifold. By integrating an adaptive view-weighting strategy to balance view contributions, DOTA derives discriminative global sample embeddings by propagating spectral information through the bipartite graph. Extensive experiments on benchmark datasets demonstrate the superiority of DOTA.
This work proposes a novel deep constrained multi-view clustering framework, namely SeSCE, which encodes view embeddings into a spherical space, leveraging pairwise constraints to maximize intra-class compactness and inter-class separability and introduces a confidence-aware pseudo-constraint mining mechanism.
Jun Wang, Zhenglai Li, Chuan Tang 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
This work proposes a novel framework termed Multi-View Graph Regularized Deep Metric Subspace Clustering (MVGR-DMSC), which consistently yields better results than several state-of-the-art approaches, including the direct baseline MSESC, in both accuracy and robustness.
Peng-Peng Luo, Ming Yang, Chong Peng et al.· PLoS ONE· 0 citations
This paper proposes a feature-graph-guided adaptive Log-L2,1 sparse NMF with anchor dual graphs under a logarithmic framework that jointly integrate sample structure preservation, feature structure preservation, and feature-aware sparse learning within a unified graph-NMF model.
Quanrun Li, Tao Ma, Fangchen Xu et al.· Mathematics· 0 citations
A novel mixed anchor strategy is introduced, which effectively bypasses the necessity of manual baseline selection while simultaneously capturing both view-specific and cross-view information and can stabilize clustering performance at a consistently high level.
Zi-Jian Chen, Miao Jia, Xing-Chen Hu et al.· Proceedings of the Thirty-Fi...· 0 citations
The proposed EMOBGL model effectively integrates multiorder and multiview relationships within a unified framework, achieving robust and discriminative clustering performance and extensive comparative experiments demonstrate that the proposed EMOBGL consistently outperforms 13 state-of-the-art methods in both clusterin...
Yangjun Deng, Wenhao Deng, Longfei Ren et al.· IEEE Transactions on Neural...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.