Unified Graph and Hypergraph Neural Network for Next-item Recommendation

The task of next-item recommendation is a crucial component in recommendation systems. The challenge of this task lies in extracting complex interaction information from users’ historical interactions with items. While prior research has transformed users’ interaction histories into graphs and hypergraphs to mine high-order interactions, the integration of both remains uncharted. Existing methods treat graphs and hypergraphs separately in representation learning, missing out on their shared attributes. Addressing this gap, we introduce a novel unified framework that integrates graphs and hypergraphs into one unified message passing paradigm. Our method employs graph neural networks and hypergraph neural networks to continuously conduct representation learning, achieving end-to-end next item recommendation. Specifically, our framework consists of the following components: 1) a unique method for graph and hypergraph construction from interaction histories, with items as nodes and users as hyperedges; 2) a novel message passing framework compatible with both graph and hypergraph neural networks; and 3) an innovative hypergraph neural network aggregation module enhanced with time and position encoders. The test results on multiple public benchmarks verify that our method outperforms current best practices in performance.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10888372
Primary Topic
Educational Technology and Assessment
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Unified Graph and Hypergraph Neural Network for Next-item Recommendation

Qize Jiang, Weiwei Sun, Hanyuan Zhang, Xinyu Zhang
Educational Technology and Assessment
article

Unified Graph and Hypergraph Neural Network for Next-item Recommendation

Qize Jiang, Weiwei Sun, Hanyuan Zhang, Xinyu Zhang
article en

Abstract

The task of next-item recommendation is a crucial component in recommendation systems. The challenge of this task lies in extracting complex interaction information from users’ historical interactions with items. While prior research has transformed users’ interaction histories into graphs and hypergraphs to mine high-order interactions, the integration of both remains uncharted. Existing methods treat graphs and hypergraphs separately in representation learning, missing out on their shared attributes. Addressing this gap, we introduce a novel unified framework that integrates graphs and hypergraphs into one unified message passing paradigm. Our method employs graph neural networks and hypergraph neural networks to continuously conduct representation learning, achieving end-to-end next item recommendation. Specifically, our framework consists of the following components: 1) a unique method for graph and hypergraph construction from interaction histories, with items as nodes and users as hyperedges; 2) a novel message passing framework compatible with both graph and hypergraph neural networks; and 3) an innovative hypergraph neural network aggregation module enhanced with time and position encoders. The test results on multiple public benchmarks verify that our method outperforms current best practices in performance.

Fudan University (CN), Shanghai Technical Institute of Electronics & Information (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 95%
Educational Technology and Assessment
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.