Yuanzhen Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yuanzhen Xie has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Chenyun Yu
Sun Yat-Sen University, Shenzhen, Guangdong, CHINA
3 shared publications - Chenglin Li
University of Alberta, Edmonton, AB, Canada
2 shared publications - Di Niu
University of Alberta
2 shared publications - Zang Li
Tencent, Shenzhen, Guangdong, China
2 shared publications - Beibei Kong
Tencent, Shenzhen, Guangdong, China
1 shared publication Bo Hu
1 shared publication
Latest Publications
- 13 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
CTRL: Continuous-time representation learning on temporal heterogeneous information network
- 13 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
CTRL: Continuous-time representation learning on temporal heterogeneous information network
- 7 June 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 299
Heterogeneous graph contrastive learning for cold start cross-domain recommendation
- 7 June 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 299
Heterogeneous graph contrastive learning for cold start cross-domain recommendation
- Open Access
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 366-374
One for All, All for One: Learning and Transferring User Embeddings for Cross-Domain Recommendation
Cross-domain recommendation is an important method to improve recommender system performance, especially when observations in target domains are sparse. However, most existing techniques focus on single-target or dual-target cross-domain recommendation (CDR) and are hard to be generalized to CDR with multiple target domains. In addition, the negative transfer problem is prevalent in CDR, where the recommendation performance in a target domain may not always be enhanced by knowledge learned from a source domain, especially when the source domain has sparse data. In this study, we propose CAT-ART, a multi-target CDR method that learns to improve recommendations in all participating domains through representation learning and embedding transfer. Our method consists of two parts: a self-supervised Contrastive AuToencoder (CAT) framework to generate global user embeddings based on information from all participating domains, and an Attention-based Representation Transfer (ART) framework which transfers domain-specific user embeddings from other domains to assist with target domain recommendation. CAT-ART boosts the recommendation performance in any target domain through the combined use of the learned global user representation and knowledge transferred from other domains, in addition to the original user embedding in the target domain. We conducted extensive experiments on a collected real-world CDR dataset spanning 5 domains and involving a million users. Experimental results demonstrate the superiority of the proposed method over a range of prior arts. We further conducted ablation studies to verify the effectiveness of the proposed components. Our collected dataset will be open-sourced to facilitate future research in the field of multi-domain recommender systems and user modelling.
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 366-374
Open AccessOne for All, All for One: Learning and Transferring User Embeddings for Cross-Domain Recommendation
Cross-domain recommendation is an important method to improve recommender system performance, especially when observations in target domains are sparse. However, most existing techniques focus on single-target or dual-target cross-domain recommendation (CDR) and are hard to be generalized to CDR with multiple target domains. In addition, the negative transfer problem is prevalent in CDR, where the recommendation performance in a target domain may not always be enhanced by knowledge learned from a source domain, especially when the source domain has sparse data. In this study, we propose CAT-ART, a multi-target CDR method that learns to improve recommendations in all participating domains through representation learning and embedding transfer. Our method consists of two parts: a self-supervised Contrastive AuToencoder (CAT) framework to generate global user embeddings based on information from all participating domains, and an Attention-based Representation Transfer (ART) framework which transfers domain-specific user embeddings from other domains to assist with target domain recommendation. CAT-ART boosts the recommendation performance in any target domain through the combined use of the learned global user representation and knowledge transferred from other domains, in addition to the original user embedding in the target domain. We conducted extensive experiments on a collected real-world CDR dataset spanning 5 domains and involving a million users. Experimental results demonstrate the superiority of the proposed method over a range of prior arts. We further conducted ablation studies to verify the effectiveness of the proposed components. Our collected dataset will be open-sourced to facilitate future research in the field of multi-domain recommender systems and user modelling.
- Open Access
- 2 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 43618-43629
Friend Recommendation Based on Multi-Social Graph Convolutional Network
Friend recommendations based on social relationships have attracted thousands of research under the rapid development of social networks. However, most of the existing friend recommendation methods use user attributes or a single social network, while rarely integrating multiple social relationships to enhance the representation. This paper focuses on integrating various social relationships to guide the representation learning, and further generating personalized friend recommendations. We design an end-to-end framework based on multiple social networks to learn the potential features of users and construct a friend recommendation model named Multi-Social Graph Convolutional Network (MSGCN). It learns the features of higher-order neighbors from multiple social networks to enrich the representation of the target user based on the improved graph convolution neural network. In particular, some graph fusion strategies by adjusting and fusing the Laplace matrix of the graph are designed to integrate social relationships. Finally, we use Bayesian theory to transform friend recommendation into a sorting problem for personalized recommendation. The experimental results show that the proposed model outperforms the state-of-the-art methods.
- 2 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 43618-43629
Open AccessFriend Recommendation Based on Multi-Social Graph Convolutional Network
Friend recommendations based on social relationships have attracted thousands of research under the rapid development of social networks. However, most of the existing friend recommendation methods use user attributes or a single social network, while rarely integrating multiple social relationships to enhance the representation. This paper focuses on integrating various social relationships to guide the representation learning, and further generating personalized friend recommendations. We design an end-to-end framework based on multiple social networks to learn the potential features of users and construct a friend recommendation model named Multi-Social Graph Convolutional Network (MSGCN). It learns the features of higher-order neighbors from multiple social networks to enrich the representation of the target user based on the improved graph convolution neural network. In particular, some graph fusion strategies by adjusting and fusing the Laplace matrix of the graph are designed to integrate social relationships. Finally, we use Bayesian theory to transform friend recommendation into a sorting problem for personalized recommendation. The experimental results show that the proposed model outperforms the state-of-the-art methods.