Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fuxin Dai

dblp:393/6200 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0004-7072-0262ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › graph-based recommendation
graph neural network recommendation
0.812024
Multi-Hop Multi-View Memory Transformer for Session-Based Recommendation · ACM Trans. Inf. Syst. 2024
Recommender systems
session-based recommendation
0.812024
Multi-Hop Multi-View Memory Transformer for Session-Based Recommendation · ACM Trans. Inf. Syst. 2024

Methods — techniques the papers use, named apart from their topics

transformer · 0.8memory network · 0.8graph neural network · 0.8
YearPublicationVenuePosition
2024 Multi-Hop Multi-View Memory Transformer for Session-Based Recommendation
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.
Xingrui Zhuo, Shengsheng Qian, Jun Hu 0016, Fuxin Dai, Kangyi Lin, Gong-Qing Wu
ACM Trans. Inf. Syst.4