Oct 2026· IEEE Transactions on Knowledge and Data Engineering· Vol 38, pp. 6835-6849· 0 citations· 55 references
Abstract
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 inevitably incomplete, which may mislead the feature aggregation process. Therefore, improving the graph structure is of importance for multiplex network unsupervised representation. Unfortunately, heterogeneous graph structure optimization in multiplex networks is still less explored and encounters the challenges of how to jointly consider multiple relation types to supplement the missing edges in each relation. To address this issues, we formulate each relation type as one view and propose the Multiplex network Unsupervised Representation model with Adaptive multi-view graph structure learning (MURA). To improve the graph structure, we develop a multi-view low-rank self-representation tensor learning module to optimize the heterogeneous graph structure which well explores the global community property. Besides, a local neighborhood manifold structure learning module is employed to capture the essential local connection. With the refined multiplex graph, we further propose a similarity regularization term to enhance the multiplex node representations. Comprehensive experiments on three downstream tasks confirm the superiority of our MURA among five datasets when compared to the state-of-the-art rivals.
Results indicate that adaptive multi-order graph fusion can provide effective structural guidance for structure-preserving unsupervised representation learning.
Can-Yu Zhang, Yun-Jing Zhang, Jia-Wen Sun et al.· Applied Sciences· 0 citations
Graph-based multi-view clustering, with its ability to mine potential associations between samples, has attracted extensive attention. To capture high-order correlations, tensor-based frameworks have been introduced to model multiple graphs jointly. Although these methods have achieved promising performance, existing m...
Ling-Yu Ma, Qi-Yu Zhong, Song Shi et al.· Proceedings of the Thirty-Fi...· 1 citation
Graph clustering is a fundamental task in data analysis, aiming at grouping nodes with similar characteristics in the graph into clusters. This problem has been widely explored using graph neural networks (GNNs) due to their ability to leverage node attributes and graph topology for effective cluster assignments. Howev...
Wei Ju, Si-Yu Yi, Kang-Jie Zheng et al.· 1 citation
A Correntropy-guided Matrix Factorization and Tensor Graph Learning (CMTGL) framework for robust semi-supervised multi-view clustering that incorporates partial label information into a shared low-dimensional representation through constrained low-rank matrix factorization and employs the maximum correntropy criterion...
Lin Hu, Song Jiang, Xiu Liu et al.· Symmetry· 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