Exploiting Transfer Learning With Attention for In-Domain Top-N Recommendation

被引:0
|
作者
Chen, Ke-Jia [1 ,2 ]
Zhang, Hui [2 ]
机构
[1] Sichuan Univ, State Key Lab Hydraul & Mt River Engn, Chengdu 610065, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Sch Comp Sci, Nanjing 210023, Peoples R China
来源
IEEE ACCESS | 2019年 / 7卷
基金
中国国家自然科学基金;
关键词
Multi-behavior recommendation; transfer learning; attention; multiplex network embedding;
D O I
10.1109/ACCESS.2019.2957473
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cross-domain recommendation has recently been extensively studied, aiming to alleviate the data sparsity problem. However, user-item interaction data in the source domain is often not available, while user-item interaction data of various types in the same domain is relatively easy to obtain. This paper proposes a recommendation method based on in-domain transfer learning (RiDoTA), which represents multi-type interactions of user-item as a multi-behavior network in the same domain, and can recommend target behavior by transferring knowledge from source behavior data. The method consists of three main steps: First, the node embedding is performed on each specific behavior network and a base network by using a multiplex network embedding strategy; Then, the attention mechanism is used to learn the weight distribution of embeddings from the above networks when transferring; Finally, a multi-layer perceptron is used to learn the nonlinear interaction model of the target behavior. Experiments on two real-world datasets show that our model outperforms the baseline methods and three state-of-art related methods in the HR and NDCG indicators. The implementation of RiDoTA is available at https://github.com/sandman13/RiDoTA.
引用
收藏
页码:175041 / 175050
页数:10
相关论文
共 50 条
  • [1] Transfer to Rank for Top-N Recommendation
    Dai, Wei
    Zhang, Qing
    Pan, Weike
    Ming, Zhong
    IEEE TRANSACTIONS ON BIG DATA, 2020, 6 (04) : 770 - 779
  • [2] Holistic Transfer to Rank for Top-N Recommendation
    Ma, Wanqi
    Liao, Xiaoxiao
    Dai, Wei
    Pan, Weike
    Ming, Zhong
    ACM TRANSACTIONS ON INTERACTIVE INTELLIGENT SYSTEMS, 2021, 11 (01)
  • [3] Reinforcement Learning to Diversify Top-N Recommendation
    Zou, Lixin
    Xia, Long
    Ding, Zhuoye
    Yin, Dawei
    Song, Jiaxing
    Liu, Weidong
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2019), PT II, 2019, 11447 : 104 - 120
  • [4] Pairwise deep learning to rank for top-N recommendation
    Zhou, Wang
    Yang, Yujun
    Du, Yajun
    Haq, Amin Ul
    Journal of Intelligent and Fuzzy Systems, 2021, 40 (06): : 10969 - 10980
  • [5] Pairwise deep learning to rank for top-N recommendation
    Zhou, Wang
    Yang, Yujun
    Du, Yajun
    Ul Haq, Amin
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 40 (06) : 10969 - 10980
  • [6] Top-N Recommendation on Graphs
    Kang, Zhao
    Peng, Chong
    Yang, Ming
    Cheng, Qiang
    CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2016, : 2101 - 2106
  • [7] SoRecGAT: Leveraging Graph Attention Mechanism for Top-N Social Recommendation
    Vijaikumar, M.
    Shevade, Shirish
    Murty, M. N.
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2019, PT I, 2020, 11906 : 430 - 446
  • [8] Leveraging pointwise prediction with learning to rank for top-N recommendation
    Nengjun Zhu
    Jian Cao
    Xinjiang Lu
    Qi Gu
    World Wide Web, 2021, 24 : 375 - 396
  • [9] Deep Learning Modeling for Top-N Recommendation With Interests Exploring
    Zhou, Wang
    Li, Jianping
    Zhang, Malu
    Wang, Yazhou
    Shah, Fadia
    IEEE ACCESS, 2018, 6 : 51440 - 51455
  • [10] Leveraging pointwise prediction with learning to rank for top-N recommendation
    Zhu, Nengjun
    Cao, Jian
    Lu, Xinjiang
    Gu, Qi
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2021, 24 (01): : 375 - 396