Sep 2026· International Conference on Optics, Electronics, and Communication Engineering· Vol 14349, pp. 143491C - 143491C-7· 0 citations· 10 references
Engineering
TL;DR
A novel Multi-Hop Lightweight Graph Convolutional Network (MH-LGCN) conversational recommendation model based on a multi-hop attention mechanism that abandons redundant operations in traditional graph convolution and designs a lightweight information propagation mechanism that retains only neighbor feature aggregation.
Abstract
Conversational recommendation aims to predict a user's next potentially interesting item based on a series of historical clicks generated in an anonymous session. In recent years, Graph Convolutional Networks (GCNs) have achieved great success in this field due to their excellent ability to capture complex item transformation relationships. However, existing GCN-based recommendation models suffer from three main limitations: traditional GCN layers contain dense feature transformation matrices and nonlinear activation functions, which not only incur high computational costs in highly sparse and low-feature-dimensional scenarios like conversation graphs but also easily lead to overfitting. As the number of network layers increases, node representations inevitably tend to homogenize (i.e., oversmoothing). Finally, most graph recommendation models are mainly limited to local aggregation of single-hop neighbors, making it difficult to effectively capture the non-local, multi-hop jump dependencies prevalent in conversation sequences. To address these challenges, this paper proposes a novel Multi-Hop Lightweight Graph Convolutional Network (MH-LGCN) conversational recommendation model based on a multi-hop attention mechanism. Specifically, MH-LGCN first abandons redundant operations in traditional graph convolution and designs a lightweight information propagation mechanism that retains only neighbor feature aggregation. This not only greatly improves the training efficiency of the model but also fundamentally alleviates the oversmoothing phenomenon caused by deep propagation. Simultaneously, this paper designs a hierarchical multi-hop attention mechanism that adaptively captures the user's long-term click preferences and skipping intentions by calculating the attention weights between the current interactive item and multi-level context items. Extensive experiments were conducted on three publicly available real-world datasets: Diginetica, Tmall, and Yoochoose 1/64, covering comparisons with 10 state-of-the-art baseline models. Experimental results show that MH-LGCN achieves state-of-the-art performance on both Precision@20 and MRR@20, outperforming the existing strong baseline model GCE-GNN by up to 4.1% and 5.8%, respectively. Furthermore, detailed ablation experiments, parameter sensitivity analysis, and model complexity comparisons further validate the effectiveness and efficiency of the proposed modules.
Session-based Recommendation (SBR) systems aim to predict the next item which a user is likely to interact with, based on behavior sequence within the current session. Recent approaches leveraging the Transformer attention mechanism (e.g.,GC-SAN) have demonstrated superior performance over traditional methods; however,...
Hua-Lin Zhan, Nan Jiang, An-Kang Yuan et al.· Journal of Visualized Experi...· 0 citations
Graph neural networks (GNNs) have been widely adopted in collaborative filtering to model higher order relationships between users and items. However, existing methods mainly focus on interaction-based structures and neglect the explicit modeling of semantic relations among users and among items. Within these graph str...
Yi-Xin Liu, Yu Zhang, Lei Sang et al.· IEEE Transactions on Computa...· 0 citations
The proposed LLM-augmented Multi-Graph Contrastive Learning (LLM-MGCL) is a multi-graph neural network that uses semantic and spatial information about items to extend the LightGCN backbone with two auxiliary item-item graphs that outperforms classical collaborative filtering, matrix factorization, and interaction-only...
This work identifies two dimensions of diversity preferences—validated by psychological theory and readily inferable from interaction data and modeled using graph neighbor sampling: user preferences for diverse content across category levels, and preferences for fine-grained diversity within broad-level interests: user...
Nicholas Sukiennik, Chen Gao, Y. Zheng et al.· ACM Transactions on the Web· 0 citations
This work introduces RPGCN (Relation-Preserving Graph Convolutional Network), a novel hybrid framework that unifies early and intermediate fusion strategies with multi-branch Graph Attention Networks (GATs) for enhanced relation modeling.
Sang-Woong Lee, Saqib Ali, Amir Masoud Rahmani et al.· Neural computing & applicati...· 0 citations
The graph convolutional recurrent attention recommender (GCRA-Rec) model is proposed, which integrates the collaborative filtering strength of GCNs with sequential learning and introduces a novel sequence encoder that dynamically weights historical interactions according to their relevance to the current recommendation...
Dawed Omer Ahmed, Venkateswara Rao Kagita, Vikas Kumar· Knowledge and Information Sy...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.