The Interaction Graph Auto-encoder Network Based on Topology-aware for Transferable Recommendation

被引:3
作者
Yu, Ruiyun [1 ]
Yang, Kang [1 ]
Guo, Bingyang [1 ]
机构
[1] Northeastern Univ, Software Coll, Shenyang, Liaoning, Peoples R China
来源
PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022 | 2022年
基金
中国国家自然科学基金;
关键词
recommendation system; graph neural network; transfer learning; attention mechanism;
D O I
10.1145/3511808.3557471
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Deep learning-based recommendation systems have made significant strides in recent years. However, the problem of recommendation systems' generalizability has not been solved. After the training phase, most current models can only solve problems on a particular dataset and are not as generalizable as NLP and CV models. Therefore, a large amount of computing power is required to make conventional recommendation models available to different trades. In real-world scenarios, offline retailers often opt out of recommendation algorithms due to a lack of computer capacity, which puts them at a competitive disadvantage. As a result, we propose an Interaction Graph Auto-encoder Network (IGA) based on topology-aware to address the transferable recommendation problem. IGA is composed primarily of the following components: Interaction Feature Subgraph Extraction, Subgraph Node Labeling, Subgraph Interaction Auto-encoder, and Interaction Preference Attention Network. IGA can transfer knowledge from the training dataset to the new dataset without fine-tuning and give users reliable, personalized recommendation results. Experiments on the MovieLens, Douban, LastFM, and Book-Crossing datasets demonstrate that IGA outperforms state-of-the-art approaches in transferable scenarios. Additionally, IGA requires fewer computing power and is highly adaptable across datasets.
引用
收藏
页码:2403 / 2412
页数:10
相关论文
共 32 条
  • [1] Anchor-based Collaborative Filtering
    Barkan, Oren
    Hirsch, Roy
    Katz, Ori
    Caciularu, Avi
    Koenigstein, Noam
    [J]. PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 2877 - 2881
  • [2] Connecting user and item perspectives in popularity debiasing for collaborative recommendation
    Boratto, Ludovico
    Fenu, Gianni
    Marras, Mirko
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2021, 58 (01)
  • [3] Exact Matrix Completion via Convex Optimization
    Candes, Emmanuel
    Recht, Benjamin
    [J]. COMMUNICATIONS OF THE ACM, 2012, 55 (06) : 111 - 119
  • [4] Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171
  • [5] Metapath-guided Heterogeneous Graph Neural Network for Intent Recommendation
    Fan, Shaohua
    Zhu, Junxiong
    Han, Xiaotian
    Shi, Chuan
    Hu, Linmei
    Ma, Biyu
    Li, Yongliang
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 2478 - 2486
  • [6] Graph Neural Networks for Social Recommendation
    Fan, Wenqi
    Ma, Yao
    Li, Qing
    He, Yuan
    Zhao, Eric
    Tang, Jiliang
    Yin, Dawei
    [J]. WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 417 - 426
  • [7] Hamilton WL., 2017, P 31 INT C NEUR INF, P1025, DOI DOI 10.48550/ARXIV.1706.02216
  • [8] Hartford Jason S., 2018, INT C MACHINE LEARNI
  • [9] He K., 2016, 2016 IEEE C COMP VIS, DOI [DOI 10.1109/CVPR.2016.90, 10.1109/CVPR.2016.90]
  • [10] LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
    He, Xiangnan
    Deng, Kuan
    Wang, Xiang
    Li, Yan
    Zhang, Yongdong
    Wang, Meng
    [J]. PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, : 639 - 648