Multi-Hop Multi-View Memory Transformer for Session-Based Recommendation

Author:

Zhuo Xingrui1ORCID,Qian Shengsheng2ORCID,Hu Jun3ORCID,Dai Fuxin4ORCID,Lin Kangyi4ORCID,Wu Gongqing1ORCID

Affiliation:

1. Hefei University of Technology, Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China), School of Computer Science and Information Engineering, and Intelligent Interconnected Systems Laboratory of Anhui Province, Hefei, China

2. Institute of Automation, Chinese Academy of Sciences, Beijing, China

3. School of Computing, National University of Singapore, Singapore, Singapore

4. WeChat, Tencent, Guangzhou, China

Abstract

A Session-Based Recommendation (SBR) seeks to predict users’ future item preferences by analyzing their interactions with previously clicked items. In recent approaches, Graph Neural Networks (GNNs) have been commonly applied to capture item relations within a session to infer user intentions. However, these GNN-based methods typically struggle with feature ambiguity between the sequential session information and the item conversion within an item graph, which may impede the model’s ability to accurately infer user intentions. In this article, we propose a novel Multi-hop Multi-view Memory Transformer (M 3 T) to effectively integrate the sequence-view information and relation conversion (graph-view information) of items in a session. First, we propose a Multi-view Memory Transformer (M 2 T) module to concurrently obtain multi-view information of items. Then, a set of trainable memory matrices are employed to store sharable item features, which mitigates cross-view item feature ambiguity. To comprehensively capture latent user intentions, an M 3 T framework is designed to integrate user intentions across different hops of an item graph. Specifically, a k-order power method is proposed to manage the item graph to alleviate the over-smoothing problem when obtaining high-order relations of items. Extensive experiments conducted on three real-world datasets demonstrate the superiority of our method.

Funder

Beijing Natural Science Foundation

University of the Ministry of Education

National Natural Science Foundation of China

Publisher

Association for Computing Machinery (ACM)

Reference67 articles.

1. Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions;Adomavicius Gediminas;IEEE TKDE,2005

2. Comparison of collaborative filtering algorithms

3. Chenwei Cai, Ruining He, and Julian J. McAuley. 2017. SPMC: Socially-Aware Personalized Markov Chains for Sparse Sequential Recommendation. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI ’17). ijcai.org, 1476–1482.

4. User Cold-Start Recommendation via Inductive Heterogeneous Graph Neural Network

5. Handling Information Loss of Graph Neural Networks for Session-based Recommendation

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3