Large-scale Comb-K Recommendation
Houye Ji, Junxiong Zhu, Chuan Shi, Xiao Wang, Bai Wang, Chaoyu Zhang, Zixuan Zhu, Feng Zhang, Yanghua Li
摘要
Promotion recommendation, as a new recommendation paradigm in recent years, plays an important role in stimulating the purchase desire of users and maximizing the total revenue. Different from previous recommendations (e.g., item/group recommendation), promotion recommendation aims to select a set of K items based on all user preferences in selection phase and maximize the total revenue in delivery phase. Although these two phases are closely related with each other, existing methods usually focus on item selection in selection phase, largely ignoring the delivery phase and leading to sub-optimal performance. To solve the promotion recommendation problem, we propose the comb-K recommendation model, a constrained combinatorial optimization model which seamlessly integrates the selection phase and delivery phase with delicately designed constraints. When selecting K items, the comb-K recommendation is able to simultaneously search the optimal combination of item selection and delivery with the full consideration of all user preferences. Specifically, we propose a novel heterogeneous graph convolutional network to estimate user preference and propose the user-level comb-K recommendation model through solving a binary combination optimization problem. In order to handle combination explosion for large-scale users, we furtherly cluster massive users into limited groups and present a group-level comb-K recommendation model in which a novel heterogeneous graph pooling network is proposed to perform user clustering and estimate group preference. In addition, considering the ”long tail” phenomenon in e-commerce, we design a restricted neighbor heuristic search to accelerate the solving process. Extensive experiments on four datasets demonstrate the superiority of comb-K model for large-scale promotion recommendation. On billion-scale data, when clustering 2.5 × 107 users into 103 groups, our model is able to preserve 98.7% personalized preferences in group-level and significantly improves the Total Click and Hit Ratio by 9.35% and 7.14%, respectively.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper5
- MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph EmbeddingXinyu Fu, Jiani Zhang, Ziqiao Meng, Irwin KingWWW 2020 · 被引用 1,149 次
- Multi-Component Graph Convolutional Collaborative FilteringXiao Wang, Ruijia Wang, Chuan Shi, Guojie Song 等AAAI 2020 · 被引用 125 次
- Who You Would Like to Share With? A Study of Share Recommendation in Social E-commerceHouye Ji, Junxiong Zhu, Xiao Wang, Chuan Shi 等AAAI 2021 · 被引用 43 次
- Beyond User Embedding Matrix: Learning to Hash for Modeling Large-Scale Users in RecommendationShaoyun Shi, Weizhi Ma, Min Zhang, Yongfeng Zhang 等SIGIR 2020 · 被引用 25 次
- Clustering and Constructing User Coresets to Accelerate Large-scale Top-K Recommender SystemsJyun-Yu Jiang, Patrick H. Chen, Cho-Jui Hsieh, Wei WangWWW 2020 · 被引用 22 次
相关 Paper
- Group-Buying Recommendation for Social E-CommerceJun Zhang, Chen Gao, Depeng Jin, Yong LiICDE 2021 · 被引用 44 次
- Build Your Own Bundle - A Neural Combinatorial Optimization MethodQilin Deng, Kai Wang, Minghao Zhao, Runze Wu 等ACM MM 2021 · 被引用 18 次
- Price DOES Matter!: Modeling Price and Interest Preferences in Session-based RecommendationXiaokun Zhang, Bo Xu, Liang Yang, Chenliang Li 等SIGIR 2022 · 被引用 76 次
- Graph Heterogeneous Multi-Relational RecommendationChong Chen, Weizhi Ma, Min Zhang, Zhaowei Wang 等AAAI 2021 · 被引用 199 次
- E-commerce Search via Content Collaborative Graph Neural NetworkGuipeng Xv, Chen Lin, Wanxian Guan, Jinping Gou 等KDD 2023 · 被引用 18 次
