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 条
  • [21] Towards a Dynamic Top-N Recommendation Framework
    Liu, Xin
    Aberer, Karl
    PROCEEDINGS OF THE 8TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'14), 2014, : 217 - 224
  • [22] An Improved Top-N Recommendation for Collaborative Filtering
    Yang, Jiongxin
    Wang, Zhenyu
    SOCIAL MEDIA PROCESSING, SMP 2016, 2016, 669 : 233 - 244
  • [23] Logic Tensor Networks for Top-N Recommendation
    Carraro, Tommaso
    Daniele, Alessandro
    Aiolli, Fabio
    Serafini, Luciano
    AIXIA 2022 - ADVANCES IN ARTIFICIAL INTELLIGENCE, 2023, 13796 : 110 - 123
  • [24] Logic Tensor Networks for Top-N Recommendation
    Carraro, Tommaso
    Daniele, Alessandro
    Aiolli, Fabio
    Serafini, Luciano
    NEURAL-SYMBOLIC LEARNING AND REASONING, NESY 2022, 2022, : 1 - 14
  • [25] A Poisson Regression Method for Top-N Recommendation
    Huang, Jiajin
    Wang, Jian
    Zhong, Ning
    SIGIR'17: PROCEEDINGS OF THE 40TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2017, : 885 - 888
  • [26] Serendipitous Personalized Ranking for Top-N Recommendation
    Lu, Qiuxia
    Chen, Tianqi
    Zhang, Weinan
    Yang, Diyi
    Yu, Yong
    2012 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT 2012), VOL 1, 2012, : 258 - 265
  • [27] Optimizing Neighborhoods for Fair Top-N Recommendation
    Eleftherakis, Stavroula
    Koutrika, Georgia
    Amer-Yahia, Sihem
    PROCEEDINGS OF THE 32ND ACM CONFERENCE ON USER MODELING, ADAPTATION AND PERSONALIZATION, UMAP 2024, 2024, : 57 - 66
  • [28] Shallow Neural Models for Top-N Recommendation
    Landin, Alfonso
    Valcarce, Daniel
    Parapar, Javier
    Barreiro, Alvaro
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 2911 - 2912
  • [29] CKGAT: Collaborative Knowledge-Aware Graph Attention Network for Top-N Recommendation
    Xu, Zhuoming
    Liu, Hanlin
    Li, Jian
    Zhang, Qianqian
    Tang, Yan
    APPLIED SCIENCES-BASEL, 2022, 12 (03):
  • [30] Exploiting sparsity to build efficient kernel based collaborative filtering for top-N item recommendation
    Polato, Mirko
    Aiolli, Fabio
    NEUROCOMPUTING, 2017, 268 : 17 - 26