Personalized Bundle Recommendation in Online Games

• URL: http://arxiv.org/abs/2104.05307v1
• Date: Mon, 12 Apr 2021 09:28:16 GMT
• Title: Personalized Bundle Recommendation in Online Games
• Authors: Qilin Deng, Kai Wang, Minghao Zhao, Zhene Zou, Runze Wu, Jianrong Tao, Changjie Fan, Liang Chen
• Abstract summary: This paper aims at a practical but less explored recommendation problem named bundle recommendation. We formalize it as a link prediction problem on a user-item-bundle tripartite graph constructed from the historical interactions. Experiments on three public datasets and one industrial game dataset demonstrate the effectiveness of the proposed method.
• Score: 24.16330519588066
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In business domains, \textit{bundling} is one of the most important marketing strategies to conduct product promotions, which is commonly used in online e-commerce and offline retailers. Existing recommender systems mostly focus on recommending individual items that users may be interested in. In this paper, we target at a practical but less explored recommendation problem named bundle recommendation, which aims to offer a combination of items to users. To tackle this specific recommendation problem in the context of the \emph{virtual mall} in online games, we formalize it as a link prediction problem on a user-item-bundle tripartite graph constructed from the historical interactions, and solve it with a neural network model that can learn directly on the graph-structure data. Extensive experiments on three public datasets and one industrial game dataset demonstrate the effectiveness of the proposed method. Further, the bundle recommendation model has been deployed in production for more than one year in a popular online game developed by Netease Games, and the launch of the model yields more than 60\% improvement on conversion rate of bundles, and a relative improvement of more than 15\% on gross merchandise volume (GMV).

Related papers

• Learning Recommender Systems with Soft Target: A Decoupled Perspective [49.83787742587449]
  We propose a novel decoupled soft label optimization framework to consider the objectives as two aspects by leveraging soft labels. We present a sensible soft-label generation algorithm that models a label propagation algorithm to explore users' latent interests in unobserved feedback via neighbors.
  arXiv  Detail & Related papers  (2024-10-09T04:20:15Z)
• On a Scale-Invariant Approach to Bundle Recommendations in Candy Crush Saga [0.0]
  This paper illustrates the use of attentive models for producing item recommendations in a mobile game scenario. The methodology is subsequently applied to a bundle recommendation in Candy Crush Saga. We have demonstrated that the recommendation enhances user engagement by 30% concerning click rate and by more than 40% concerning take rate.
  arXiv  Detail & Related papers  (2024-08-13T10:42:32Z)
• Preference and Concurrence Aware Bayesian Graph Neural Networks for Recommender Systems [5.465420718331109]
  Graph-based collaborative filtering methods have prevailing performance for recommender systems. We propose an efficient generative model that jointly considers the preferences of users, the concurrence of items and some important graph structure information.
  arXiv  Detail & Related papers  (2023-11-30T11:49:33Z)
• Graph Neural Bandits [49.85090929163639]
  We propose a framework named Graph Neural Bandits (GNB) to leverage the collaborative nature among users empowered by graph neural networks (GNNs) To refine the recommendation strategy, we utilize separate GNN-based models on estimated user graphs for exploitation and adaptive exploration.
  arXiv  Detail & Related papers  (2023-08-21T15:57:57Z)
• Opinion mining using Double Channel CNN for Recommender System [0.0]
  We present an approach for sentiment analysis with a deep learning model and use it to recommend products. A two-channel convolutional neural network model has been used for opinion mining, which has five layers and extracts essential features from the data. Our proposed method has reached 91.6% accuracy, significantly improved compared to previous aspect-based approaches.
  arXiv  Detail & Related papers  (2023-07-15T13:11:18Z)
• ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest [60.841761065439414]
  At Pinterest, we build a single set of product embeddings called ItemSage to provide relevant recommendations in all shopping use cases. This approach has led to significant improvements in engagement and conversion metrics, while reducing both infrastructure and maintenance cost.
  arXiv  Detail & Related papers  (2022-05-24T02:28:58Z)
• Augmenting the User-Item Graph with Textual Similarity Models [9.703969546479954]
  A paraphrase similarity model is applied to widely available textual data, such as reviews and product descriptions. This increases the density of the graph without needing further labeled data. Results show that the data augmentation technique provides significant improvements to all types of models.
  arXiv  Detail & Related papers  (2021-09-20T08:23:05Z)
• PreSizE: Predicting Size in E-Commerce using Transformers [76.33790223551074]
  PreSizE is a novel deep learning framework which utilizes Transformers for accurate size prediction. We demonstrate that PreSizE is capable of achieving superior prediction performance compared to previous state-of-the-art baselines. As a proof of concept, we demonstrate that size predictions made by PreSizE can be effectively integrated into an existing production recommender system.
  arXiv  Detail & Related papers  (2021-05-04T15:23:59Z)
• Personalized Embedding-based e-Commerce Recommendations at eBay [3.1236273633321416]
  We present an approach for generating personalized item recommendations in an e-commerce marketplace by learning to embed items and users in the same vector space. Data ablation is incorporated into the offline model training process to improve the robustness of the production system.
  arXiv  Detail & Related papers  (2021-02-11T17:58:51Z)
• Bundle Recommendation with Graph Convolutional Networks [71.95344006365914]
  Existing solutions integrate user-item interaction modeling into bundle recommendation by sharing model parameters or learning in a multi-task manner. We propose a graph neural network model named BGCN (short for textittextBFBundle textBFGraph textBFConvolutional textBFNetwork) for bundle recommendation.
  arXiv  Detail & Related papers  (2020-05-07T13:48:26Z)
• Learning Diverse Fashion Collocation by Neural Graph Filtering [78.9188246136867]
  We propose a novel fashion collocation framework, Neural Graph Filtering, that models a flexible set of fashion items via a graph neural network. By applying symmetric operations on the edge vectors, this framework allows varying numbers of inputs/outputs and is invariant to their ordering. We evaluate the proposed approach on three popular benchmarks, the Polyvore dataset, the Polyvore-D dataset, and our reorganized Amazon Fashion dataset.
  arXiv  Detail & Related papers  (2020-03-11T16:17:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.