cs.IRDec 18, 2023

Hypergraph-Enhanced Dual Convolutional Network for Bundle Recommendation

Authors: Yang Li, Kangbo Liu, Yaoxin Wu, Zhaoxuan Wang, Erik Cambria

Organizations: Northwestern Polytechnical University, China · Nanyang Technological University, Singapore

Abstract

Bundle recommendation ranks sets of related items rather than isolated items. Its central challenge is to connect user preferences, item interactions, and bundle composition without losing the signals needed to rank bundles. We propose Hypergraph-Enhanced Dual Convolutional Neural Network (HED), which constructs a complete hypergraph containing user--bundle, user--item, and bundle--item interactions together with intra-user and intra-bundle relations. HED couples complete-hypergraph propagation with a user--bundle branch, allowing item-aware higher-order context to inform ranking while preserving recommendation-specific signals. On NetEase, HED-128 improves over the strongest baseline by 5.04--6.97% across the six reported metrics; on Youshu, HED-64 improves by 1.87--4.56%. Ablation results support the contributions of both the user--bundle branch and intra-type relations, and sensitivity analyses identify stable operating ranges for the main hyperparameters. We further quantify the computational trade-off of the complete hypergraph, including its memory cost. The evidence supports HED on the two evaluated bundle-recommendation datasets while making its resource limitations explicit. Code and datasets will be made available upon publication.

Explore similar work

CardsList
  1. RankGraph-2: Lifecycle Co-Design for Billion-Node Graph Learning in Recommendation

    Jun 16, 2026Renzhi Wu, Zikun Cui, Junjie Yang +10Graph-Based RetrievalReal-World Content Recommendation Problem