2026· IEEE Signal Processing Letters· Vol 33, pp. 3322-3326· 0 citations· 22 references
Computer Science
Abstract
Existing graph-based multi-view clustering methods commonly employ view weights as global multipliers over both local graph construction and cross-view consensus graph learning. Such a design may over-penalize weakly aligned views, thereby hindering adaptive feature selection and degrading view-specific manifold preserving. In this paper, we propose to learn Adaptive Feature-weighted Topological Manifold graph for multi-view data Clustering (AF-TMC), which structurally decouples local feature-aware graph learning from global topological fusion. Specifically, AF-TMC restricts view weights to the topological manifold alignment term, while independently learns adaptive feature-weight matrices and affinity graphs for individual views. A unified consensus manifold graph and spectral embedding are then jointly optimized to capture shared cluster structures across multi-view representations. On model optimization, we devise an efficient block coordinate descent algorithm, where each subproblem admits a closed-form update or a tractable simplex projection. Comprehensive experiments on eight datasets verify the effectiveness of AF-TMC, which achieves strong overall performance against representative multi-view clustering methods. Analyses on convergence behavior, parameter sensitivity, consensus manifold graph visualization, and adaptive feature ranking substantiate the robustness and interpretability of AF-TMC.
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 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
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.
Cheng-Long Zhang, Chao Zhang, Jun-Hao Zhang et al.· Proceedings of the Thirty-Fi...· 0 citations
ELSS learns an explicit and nonlinear low-rank subspace within a graph-structured embedding space, effectively un-covering latent cluster structures and introduces a homophily-aware adaptive graph filter, which dynamically calibrates smoothing intensity to preserve discriminative ego-information.
Yao-Ming Cai, Song Liu, Zijia Zhang et al.· Proceedings of the Thirty-Fi...· 0 citations
High-dimensional unlabeled data often contain complex latent structures that are easily obscured by redundant features, noise, and unreliable neighborhood relationships. Although graph-based learning provides an effective means of preserving sample relationships, most existing methods mainly rely on first-order neighbo...
Can-Yu Zhang, Yun-Jing Zhang, Jia-Wen Sun et al.· Applied Sciences· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.