Results indicate that adaptive multi-order graph fusion can provide effective structural guidance for structure-preserving unsupervised representation learning.
Abstract
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 neighborhoods and therefore fail to fully exploit multi-order dependencies revealed by multi-hop propagation. To address this limitation, we formulate unsupervised representation learning as a graph-guided structure-preserving projection problem and propose Unsupervised Representation Learning with Adaptive Multi-order Structural Graph Fusion (URL-AMGF). The proposed method constructs multi-order graphs to characterize structural relationships at different neighborhood orders and adaptively fuses them into a unified guidance graph. This graph is then integrated into projection matrix learning, enabling graph structure optimization and low-dimensional representation learning to be jointly performed within a unified framework. By integrating local neighborhood information with multi-order structural cues, URL-AMGF learns low-dimensional representations that better reflect the structural relationships among samples. Experiments on multiple benchmark datasets show that URL-AMGF achieves generally competitive clustering performance compared with representative unsupervised dimensionality reduction and graph-based learning methods. These results indicate that adaptive multi-order graph fusion can provide effective structural guidance for structure-preserving unsupervised representation learning.
The unsupervised representation learning of the multiplex network has attracted significant attention due to its powerful ability to model multiple relation types between nodes. Existing methods generally learn representations with the original graph structure but disregard the fact that the prior graph structure is in...
Yong-Qiang Tang, Rui-Wen Yuan, Yuan Xie et al.· IEEE Transactions on Knowled...· 0 citations
A Multi-scale Attention-based Dynamic Graph Network (MADGN) integrating structure-aware modeling and hierarchical attention is proposed, which outperforms state-of-the-art baselines on dynamic link prediction, dynamic new link prediction, and node classification tasks.
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
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
SERM integrates topology-aware graph propagation with masked self-supervised reconstruction, a masked self-supervised framework for network-level structural representation learning that captures useful structural information and remains applicable across several network-level evaluation settings.
Jing-Jing Chen, Hai-Peng Peng, Lu Li et al.· Mathematics· 0 citations
Graphs can be applied to graph-based semi-supervised learning and play an important role in data classification tasks. A good graph can reveal the underlying relationships between data and capture hidden structural information. This paper proposes a Low- Rank Representation with Local Manifold (LRRLM) method for graph...
Ting-Chang Yan, Shi-Hao Zhao, Jin Pan et al.· International journal of pat...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.