Graph neural network recommendation algorithm based on improved dual tower model

被引:0
|
作者
He, Qiang [1 ]
Li, Xinkai [2 ]
Cai, Biao [2 ,3 ]
机构
[1] Chengdu Univ Technol, Sch Mech & Elect Engn, Chengdu 610059, Peoples R China
[2] Chengdu Univ Technol, Sch Comp Sci & Cyber Secur, Chengdu 610059, Peoples R China
[3] Chengdu Univ Technol, Coll Ind Technol, Yibin 644000, Peoples R China
基金
中国国家自然科学基金;
关键词
Recommendation; Dual tower model; Graph neural network; Collaborative filtering; MATRIX FACTORIZATION;
D O I
10.1038/s41598-024-54376-3
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
In this era of information explosion, recommendation systems play a key role in helping users to uncover content of interest among massive amounts of information. Pursuing a breadth of recall while maintaining accuracy is a core challenge for current recommendation systems. In this paper, we propose a new recommendation algorithm model, the interactive higher-order dual tower (IHDT), which improves current models by adding interactivity and higher-order feature learning between the dual tower neural networks. A heterogeneous graph is constructed containing different types of nodes, such as users, items, and attributes, extracting richer feature representations through meta-paths. To achieve feature interaction, an interactive learning mechanism is introduced to inject relevant features between the user and project towers. Additionally, this method utilizes graph convolutional networks for higher-order feature learning, pooling the node embeddings of the twin towers to obtain enhanced end-user and item representations. IHDT was evaluated on the MovieLens dataset and outperformed multiple baseline methods. Ablation experiments verified the contribution of interactive learning and high-order GCN components.
引用
收藏
页数:13
相关论文
共 50 条
  • [31] Point-of-Interest Recommendation Model Based on Graph Convolutional Neural Network
    Wu, Ziyang
    Xu, Ning
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2022, 2022
  • [32] Attentive sequential model based on graph neural network for next poi recommendation
    Wang, Dongjing
    Wang, Xingliang
    Xiang, Zhengzhe
    Yu, Dongjin
    Deng, Shuiguang
    Xu, Guandong
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2021, 24 (06): : 2161 - 2184
  • [33] Attentive sequential model based on graph neural network for next poi recommendation
    Dongjing Wang
    Xingliang Wang
    Zhengzhe Xiang
    Dongjin Yu
    Shuiguang Deng
    Guandong Xu
    World Wide Web, 2021, 24 : 2161 - 2184
  • [34] Recommendation Based on Graph Neural Network with Structural Identity
    Bai, Wentao
    Guo, Congying
    PROCEEDINGS OF 2022 THE 6TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND SOFT COMPUTING, ICMLSC 20222, 2022, : 127 - 131
  • [35] Improved Network-Based Recommendation Algorithm
    Shan, Xiao-fei
    Mi, Chuan-min
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFTWARE ENGINEERING (AISE 2014), 2014, : 297 - 301
  • [36] Recommendation on Social Network Based on Graph Model
    Li, Jun
    Ma, Shuchao
    Hong, Shuang
    PROCEEDINGS OF THE 31ST CHINESE CONTROL CONFERENCE, 2012, : 7548 - 7551
  • [37] A novel Knowledge Graph recommendation algorithm based on Graph Convolutional Network
    Guo, Hui
    Yang, Chengyong
    Zhou, Liqing
    Wei, Shiwei
    CONNECTION SCIENCE, 2024, 36 (01)
  • [38] Robust social recommendation based on contrastive learning and dual-stage graph neural network
    Ma, Gang-Feng
    Yang, Xu-Hua
    Long, Haixia
    Zhou, Yanbo
    Xu, Xin-Li
    NEUROCOMPUTING, 2024, 584
  • [39] RG-GCN: Improved Graph Convolution Neural Network Algorithm Based on Rough Graph
    Ding, Weiping
    Pan, Bairu
    Ju, Hengrong
    Huang, Jiashuang
    Cheng, Chun
    Shen, Xinjie
    Geng, Yu
    Hou, Tao
    IEEE ACCESS, 2022, 10 : 85582 - 85594
  • [40] CapsRec: A Capsule Graph Neural Network Model for Social Recommendation
    Liu, Peizhen
    Yu, Wen
    2021 IEEE 33RD INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2021), 2021, : 359 - 363