Learning high-order user-item relation via hyperedge for recommender system

IF 6.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Neurocomputing Pub Date : 2026-05-01 Epub Date: 2026-02-07 DOI:10.1016/j.neucom.2026.133004
Jingwen Wang , Yuguang Yan , Ruichu Cai , Michael K. Ng , Zhifeng Hao
{"title":"Learning high-order user-item relation via hyperedge for recommender system","authors":"Jingwen Wang ,&nbsp;Yuguang Yan ,&nbsp;Ruichu Cai ,&nbsp;Michael K. Ng ,&nbsp;Zhifeng Hao","doi":"10.1016/j.neucom.2026.133004","DOIUrl":null,"url":null,"abstract":"<div><div>Recommender systems aim to find candidate items that are likely to be interesting to users based on their potential preferences. Existing methods mainly leverage user-item interaction data to learn a pairwise relation between a user and an item, or incorporate the social relations of users from a social network to model high-order relations among multiple users. However, complex relations exist not only among users but also among items, and high-order relations among users and items are vital for recommendation. For example, people buy products because of different latent reasons, which can be captured by relations involving multiple items. Such a high-order user-item relations have barely been studied in existing research. In this paper, we seek to extract high-order relations involving both users and items from interaction data and construct hyperedges to represent these relations. Specifically, we identify latent factors between users and items as the hyperedges, which is performed by matrix factorization on the interaction matrix. After that, we develop a hypergraph convolutional network based on hypergraph expansion to learn embeddings for users, items, as well as high-order relations in a joint representation space. By doing this, high-order relations involving multiple users and items are exploited to learn comprehensive representations of users and items for recommendation. The experimental results on several real-world datasets demonstrate the effectiveness of our proposed method.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"676 ","pages":"Article 133004"},"PeriodicalIF":6.7000,"publicationDate":"2026-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231226004017","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/7 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Recommender systems aim to find candidate items that are likely to be interesting to users based on their potential preferences. Existing methods mainly leverage user-item interaction data to learn a pairwise relation between a user and an item, or incorporate the social relations of users from a social network to model high-order relations among multiple users. However, complex relations exist not only among users but also among items, and high-order relations among users and items are vital for recommendation. For example, people buy products because of different latent reasons, which can be captured by relations involving multiple items. Such a high-order user-item relations have barely been studied in existing research. In this paper, we seek to extract high-order relations involving both users and items from interaction data and construct hyperedges to represent these relations. Specifically, we identify latent factors between users and items as the hyperedges, which is performed by matrix factorization on the interaction matrix. After that, we develop a hypergraph convolutional network based on hypergraph expansion to learn embeddings for users, items, as well as high-order relations in a joint representation space. By doing this, high-order relations involving multiple users and items are exploited to learn comprehensive representations of users and items for recommendation. The experimental results on several real-world datasets demonstrate the effectiveness of our proposed method.
基于hyperedge的推荐系统高阶用户-物品关系学习
推荐系统的目标是根据用户的潜在偏好找到他们可能感兴趣的候选项目。现有的方法主要是利用用户-物品交互数据来学习用户和物品之间的成对关系,或者将来自社交网络的用户的社会关系纳入到多个用户之间的高阶关系模型中。然而,复杂的关系不仅存在于用户之间,也存在于项目之间,用户和项目之间的高阶关系对推荐至关重要。例如,人们出于不同的潜在原因购买产品,这些潜在原因可以通过涉及多个项目的关系来捕获。这种高阶用户-物品关系在现有研究中很少被研究。在本文中,我们试图从交互数据中提取涉及用户和项目的高阶关系,并构建超边缘来表示这些关系。具体而言,我们将用户和项目之间的潜在因素识别为超边缘,并通过交互矩阵的矩阵分解来执行。之后,我们开发了一个基于超图展开的超图卷积网络,以学习用户、项目以及联合表示空间中的高阶关系的嵌入。通过这样做,涉及多个用户和项目的高阶关系被利用来学习用户和项目的综合表示以进行推荐。在多个实际数据集上的实验结果证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书