Chundong Liang

Chundong Liang

Auto-generated profile, based on publicly available information

Chundong Liang

College of Intelligence and Computing, Tianjin University, Tianjin, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 March 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Dongxiao HeDongxiao He
Dongxiao He
CLChundong Liang
Chundong Liang
CHCuiying Huo
Cuiying Huo
ZFZhiyong Feng
Zhiyong Feng
Jin DiJin Di
Jin Di
WZWeixiong Zhang
Weixiong Zhang
Heterogeneous information networks (HINs) are potent models of complex systems. In practice, many nodes in an HIN have their attributes unspecified, resulting in significant performance degradation for supervised and unsupervised representation learning. We developed an unsupervised heterogeneous graph contrastive learning approach for analyzing HINs with missing attributes (HGCA). HGCA adopts a contrastive learning strategy to unify attribute completion and representation learning in an unsupervised heterogeneous framework. To deal with a large number of missing attributes and the absence of labels in unsupervised scenarios, we proposed an augmented network to capture the semantic relations between nodes and attributes to achieve a fine-grained attribute completion. Extensive experiments on three large real-world HINs demonstrated the superiority of HGCA over several state-of-the-art methods. The results also showed that the complemented attributes by HGCA can improve the performance of existing HIN models.

26 May 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
CHCuiying Huo
Cuiying Huo
Dongxiao HeDongxiao He
Dongxiao He
CLChundong Liang
Chundong Liang
Jin DiJin Di
Jin Di
Tie QiuTie Qiu
Tie Qiu
LWLingfei Wu
Lingfei Wu
Trust evaluation is critical for many applications such as cyber security, social communication, and recommender systems. Users and trust relationships among them can be seen as a graph. Graph neural networks (GNNs) show their powerful ability for analyzing graph-structural data. Very recently, existing work attempted to introduce the attributes and asymmetry of edges into GNNs for trust evaluation, while failed to capture some essential properties (e.g., the propagative and composable nature) of trust graphs. In this work, we propose a new GNN-based trust evaluation method named TrustGNN, which integrates smartly the propagative and composable nature of trust graphs into a GNN framework for better trust evaluation. Specifically, TrustGNN designs specific propagative patterns for different propagative processes of trust, and distinguishes the contribution of different propagative processes to create new trust. Thus, TrustGNN can learn comprehensive node embeddings and predict trust relationships based on these embeddings. Experiments on some widely-used real-world datasets indicate that TrustGNN significantly outperforms the state-of-the-art methods. We further perform analytical experiments to demonstrate the effectiveness of the key designs in TrustGNN.