User-Event Graph Embedding Learning for Context-Aware Recommendation
Dugang Liu, Mingkai He, Jinwei Luo, Jiangxu Lin, Meng Wang, Xiaolian Zhang, Weike Pan, Zhong Ming
Abstract
Most methods for context-aware recommendation focus on improving the feature interaction layer, but overlook the embedding layer. However, an embedding layer with random initialization often suffers in practice from the sparsity of the contextual features, as well as the interactions between the users (or items) and context. In this paper, we propose a novel user-event graph embedding learning (UEG-EL) framework to address these two sparsity challenges. Specifically, our UEG-EL contains three modules: 1) a graph construction module is used to obtain a user-event graph containing nodes for users, intents and items, where the intent nodes are generated by applying intent node attention (INA) on nodes of the contextual features; 2) a user-event collaborative graph convolution module is designed to obtain the refined embeddings of all features by executing a new convolution strategy on the user-event graph, where each intent node acts as a hub to efficiently propagate the information among different features; 3) a recommendation module is equipped to integrate some existing context-aware recommendation model, where the feature embeddings are directly initialized with the obtained refined embeddings. Moreover, we identify a unique challenge of the basic framework, that is, the contextual features associated with too many instances may suffer from noise when aggregating the information. We thus further propose a simple but effective variant, i.e., UEG-EL-V, in order to prune the information propagation of the contextual features. Finally, we conduct extensive experiments on three public datasets to verify the effectiveness and compatibility of our UEG-EL and its variant.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 78c33917-00e1-4dcf-a5b1-aaede6a6108eCited by top-tier papers1
Ask how each one uses itBuilds on4
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
- Global Context Enhanced Graph Neural Networks for Session-based RecommendationZiyang Wang, Wei Wei, Gao Cong, Xiao-Li Li et al.SIGIR 2020 · 558 citations
- Efficient Non-Sampling Factorization Machines for Optimal Context-Aware RecommendationChong Chen, Min Zhang, Weizhi Ma, Yiqun Liu et al.WWW 2020 · 7 citations
Related papers
- Layer-refined Graph Convolutional Networks for RecommendationXin Zhou, Donghui Lin, Yong Liu, Chunyan MiaoICDE 2023 · 81 citations
- Intent Distribution based Bipartite Graph Representation LearningHaojie Li, Wei Wei, Guanfeng Liu, Jinhuan Liu et al.SIGIR 2024 · 4 citations
- IACLR: Intention Alignment via Contrastive Learning for Bipartite Graph RecommendationHuiying Hu, Tuo Wang, Yixiao Zhou, Xiaoqing LyuWWW 2026
- Candidate-aware Graph Contrastive Learning for RecommendationWei He, Guohao Sun, Jinhu Lu, Xiu Susie FangSIGIR 2023 · 64 citations
- Neighbor Interaction Aware Graph Convolution Networks for RecommendationJianing Sun, Yingxue Zhang, Wei Guo, Huifeng Guo et al.SIGIR 2020 · 172 citations
