A Recommendation Strategy Integrating Higher-Order Feature Interactions With Knowledge Graphs

被引:3
|
作者
Lin, Yanru [1 ]
Du, Shiyu [2 ]
Zhang, Yiming [2 ]
Duan, Kai [1 ]
Huang, Qing [2 ]
An, Peng [3 ]
机构
[1] Ningbo Univ, Fac Elect Engn & Comp Sci, Ningbo 315211, Peoples R China
[2] Chinese Acad Sci, Ningbo Inst Mat Technol & Engn, Engn Lab Adv Energy Mat, Ningbo 315201, Peoples R China
[3] Ningbo Univ Technol, Coll Elect & Informat Engn, Ningbo 315211, Zhejiang, Peoples R China
关键词
Recommendation systems; knowledge graphs; convolutional neural networks; SYSTEMS;
D O I
10.1109/ACCESS.2022.3220322
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Knowledge Graphs (KG) are efficient auxiliary information in recommender systems. However, in knowledge graph feature learning, a major objective is improvement for recommendation performance. One of the problems in the existing methods is that they cannot uncover the deep interaction information of users in a simple way, and this motivates effective learning of the potential embedded information through the knowledge graph. The Graph Convolutional Network (GCN) can be useful for learning information about graph structured data. This paper proposes a method that fuses higher order feature interactions and knowledge graphs and uses them for recommendation. For users, they uses Gated Recurrent Units (GRU) to focus on their preferences so that the ability of convolutional neural networks in processing user preference features is enhanced; for items, the cross-learning module is adopted to learn higher order features between items and entities; for users and entities, KG and user-item interaction information are combined followed by feature extraction of graph structured data by Light GCN, allowing the model to learn potential user-entity associations from the graph structured data. Current experiments on two real datasets show that the proposed model performs better than some recently developed models.
引用
收藏
页码:119290 / 119300
页数:11
相关论文
共 50 条
  • [21] Strategy evolution on higher-order networks
    Sheng, Anzhi
    Su, Qi
    Wang, Long
    Plotkin, Joshua B.
    NATURE COMPUTATIONAL SCIENCE, 2024, 4 (4): : 274 - 284
  • [22] Higher-Order Spectral Clustering of Directed Graphs
    Laenen, Steinar
    Sun, He
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [23] Higher-Order Spectral Clustering for Geometric Graphs
    Avrachenkov, Konstantin
    Bobu, Andrei
    Dreveton, Maximilien
    JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2021, 27 (02)
  • [24] Percolation in random graphs with higher-order clustering
    Mann, Peter
    Smith, V. Anne
    Mitchell, John B. O.
    Dobson, Simon
    PHYSICAL REVIEW E, 2021, 103 (01)
  • [25] The knowledge argument and higher-order properties
    Horowitz, A
    Jacobson-Horowitz, H
    RATIO, 2005, 18 (01) : 48 - 64
  • [26] HIGHER-ORDER INFERENCES IN KNOWLEDGE DOMAINS
    KLIX, F
    INTERNATIONAL JOURNAL OF PSYCHOLOGY, 1992, 27 (3-4) : 653 - 653
  • [27] Higher-Order Spectral Clustering for Geometric Graphs
    Konstantin Avrachenkov
    Andrei Bobu
    Maximilien Dreveton
    Journal of Fourier Analysis and Applications, 2021, 27
  • [28] Direct estimation of sizes of higher-order graphs
    Collins, JC
    Freund, A
    NUCLEAR PHYSICS B, 1997, 504 (1-2) : 461 - 481
  • [29] TEACHERS' KNOWLEDGE ABOUT HIGHER-ORDER THINKING SKILLS AND ITS LEARNING STRATEGY
    Retnawati, Heri
    Djidu, Hasan
    Kartianom
    Apino, Ezi
    Anazifa, Risqa D.
    PROBLEMS OF EDUCATION IN THE 21ST CENTURY, 2018, 76 (02) : 215 - 230
  • [30] MODEL FOR HIGHER-ORDER WEAK INTERACTIONS
    LI, LF
    SEGRE, G
    PHYSICAL REVIEW, 1969, 186 (05): : 1477 - &