IntentGraphRec: Dual-Level Fusion of Co-Intent Graphs and Shift-Aware Sequence Encoding Under Full-Catalog Evaluationopen access
- Authors
- Park, Doo-Yong; Choi, Sang-Min
- Issue Date
- Nov-2025
- Publisher
- MDPI AG
- Keywords
- sequential recommendation; graph neural network; user intent modeling; preference shift
- Citation
- Mathematics, v.13, no.22
- Indexed
- SCIE
SCOPUS
- Journal Title
- Mathematics
- Volume
- 13
- Number
- 22
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/81335
- DOI
- 10.3390/math13223632
- ISSN
- 2227-7390
2227-7390
- Abstract
- Sequential recommendations seek to predict the next item a user will interact with by modeling historical behavior, yet most approaches emphasize either temporal dynamics or item relationships and thus miss how structural co-intents interact with dynamic preference shifts under realistic evaluation. IntentGraphRec introduces a dual-level framework that builds an intent graph from session co-occurrences to learn intent-aware item representations with a lightweight GNN, paired with a shift-aware Transformer that adapts attention to evolving preferences via a learnable fusion gate. To avoid optimistic bias, evaluation is performed with a leakage-free, full-catalog ranking protocol that forms prefixes strictly before the last target occurrence and scores against the entire item universe while masking PAD and prefix items. On MovieLens-1M and Gowalla, IntentGraphRec is competitive but does not surpass strong Transformer baselines (SASRec/BERT4Rec); controlled analyses indicate that late fusion is often dominated by sequence representations and that local co-intent graphs provide limited gains unless structural signals are injected earlier or regularized. These findings provide a reproducible view of when structural signals help, and when they do not, in sequential recommendations and offer guidance for future graph-sequence hybrids.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.