Dual attentive graph convolutional networks for cross-domain recommendation

Author:

Zhang Yu1,Liu Fan2,Hu Yupeng3,Li Xiaoli1,Dong Xiangjun4,Cheng Zhiyong1

Affiliation:

1. Shandong Artificial Intelligence Institute, Qilu University of Technology (Shandong Academy of Sciences), Jinan, China

2. School of Computing, National University of Singapore, Singapore, Singapore

3. School of Software, Shandong University, Jinan, China

4. Department of Computer Science and Technology, Qilu University of Technology (Shandong Academy of Sciences), Jinan, China

Abstract

Cross-domain recommendation aims to alleviate the target domain’s data sparsity problem by leveraging source domain knowledge. Existing GCN-based approaches perform graph convolution operations in each domain separately. However, the direct effect of item feature and topological structure information in the source domain are neglected for user preference modeling in the target domain. In this paper, we propose a novel Dual Attentive Graph Convolutional Network for Cross-Domain Recommendation (DAG4CDR). Specifically, we integrate the source and target domain’s interaction data to construct a unified user-item bipartite graph and then perform GCN propagation on the graph to learn user and item embeddings. Over the unified graph, the interaction data from both domains can be leveraged to learn user and item embeddings via information propagation. In the embedding aggregation phase, the messages passed from different items of two domains to users are weighted by a designed dual attention mechanism, which considers the contributions of different items from both node- and domain-level. We conducted extensive experiments to validate the effectiveness of our method on several publicly available datasets, and the results demonstrate the superiority of our model on preference modeling for both common and non-common users.

Publisher

IOS Press

Subject

Artificial Intelligence,General Engineering,Statistics and Probability

Reference5 articles.

1. Nais: Neural attentive item similarity model for recommendation;Xiangnan He;TKDE,2018

2. Andriy Mnih and Russ Salakhutdinov, R. , Probabilistic matrix factorization, NIPS 20 (2007).

3. Feature-level attentive icf for recommendation;Zhiyong Cheng;ACM Transactions on Information Systems (TOIS),2022

4. Babak Loni , Yue Shi , Martha Larson and Alan Hanjalic , Cross-domain collaborative filtering with factorization machines, In ECIR, pages 656–661. Springer, 2014.

5. Matrix factorization techniques for recommender systems;Yehuda Koren;Computer,2009

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3