Graph Intention Network for Click-through Rate Prediction in Sponsored Search

• URL: http://arxiv.org/abs/2103.16164v1
• Date: Tue, 30 Mar 2021 08:44:16 GMT
• Title: Graph Intention Network for Click-through Rate Prediction in Sponsored Search
• Authors: Feng Li, Zhenrui Chen, Pengjie Wang, Yi Ren, Di Zhang, Xiaoyu Zhu
• Abstract summary: Estimating click-through rate (CTR) accurately has an essential impact on improving user experience and revenue in sponsored search. Most of the current work is to mine their intentions based on user real-time behaviors. We propose a new approach Graph Intention Network (GIN) based on co-occurrence commodity graph to mine user intention.
• Score: 7.8836754883280555
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Estimating click-through rate (CTR) accurately has an essential impact on improving user experience and revenue in sponsored search. For CTR prediction model, it is necessary to make out user real-time search intention. Most of the current work is to mine their intentions based on user real-time behaviors. However, it is difficult to capture the intention when user behaviors are sparse, causing the behavior sparsity problem. Moreover, it is difficult for user to jump out of their specific historical behaviors for possible interest exploration, namely weak generalization problem. We propose a new approach Graph Intention Network (GIN) based on co-occurrence commodity graph to mine user intention. By adopting multi-layered graph diffusion, GIN enriches user behaviors to solve the behavior sparsity problem. By introducing co-occurrence relationship of commodities to explore the potential preferences, the weak generalization problem is also alleviated. To the best of our knowledge, the GIN method is the first to introduce graph learning for user intention mining in CTR prediction and propose end-to-end joint training of graph learning and CTR prediction tasks in sponsored search. At present, GIN has achieved excellent offline results on the real-world data of the e-commerce platform outperforming existing deep learning models, and has been running stable tests online and achieved significant CTR improvements.

Related papers

• GenCI: Generative Modeling of User Interest Shift via Cohort-based Intent Learning for CTR Prediction [84.0125708499372]
  We propose a generative user intent framework to model user preferences for click-through rate (CTR) prediction.<n>The framework first employs a generative model, trained with a next-item prediction objective, to proactively produce candidate interest cohorts.<n>A hierarchical candidate-aware network then injects this rich contextual signal into the ranking stage, refining them with cross-attention to align with both user history and the target item.
  arXiv  Detail & Related papers  (2026-01-26T08:15:04Z)
• Disentangled Interest Network for Out-of-Distribution CTR Prediction [30.99385290299526]
  Click-through rate (CTR) prediction is a critical task for online information services.<n>We propose Disentangled Click-Through Rate prediction (DiseCTR), which introduces a causal perspective of recommendation.<n>We show that DiseCTR achieves the best accuracy and robustness in datasets against state-of-the-art approaches.
  arXiv  Detail & Related papers  (2025-11-14T18:20:44Z)
• A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptation [59.14165404728197]
  We provide an up-to-date and forward-looking review of deep graph learning under distribution shifts. Specifically, we cover three primary scenarios: graph OOD generalization, training-time graph OOD adaptation, and test-time graph OOD adaptation. To provide a better understanding of the literature, we systematically categorize the existing models based on our proposed taxonomy.
  arXiv  Detail & Related papers  (2024-10-25T02:39:56Z)
• Incorporating Group Prior into Variational Inference for Tail-User Behavior Modeling in CTR Prediction [8.213386595519928]
  We propose a novel variational inference approach, namely Group Prior Sampler Variational Inference (GPSVI) GPSVI introduces group preferences as priors to refine latent user interests for tail users. Rigorous analysis and extensive experiments demonstrate that GPSVI consistently improves the performance of tail users.
  arXiv  Detail & Related papers  (2024-10-19T13:15:36Z)
• Light-weight End-to-End Graph Interest Network for CTR Prediction in E-commerce Search [0.0]
  We propose a new approach named Light-weight End-to-End Graph Interest Network (EGIN) to effectively mine users' search interests. The proposed EGIN is composed of three parts: query-item heterogeneous graph, light-weight graph sampling, and multi-interest network. We conduct extensive experiments on both public and industrial datasets to demonstrate the effectiveness of the proposed EGIN.
  arXiv  Detail & Related papers  (2024-06-25T17:31:04Z)
• Bayes-enhanced Multi-view Attention Networks for Robust POI Recommendation [81.4999547454189]
  Existing works assume the available POI check-ins reported by users are the ground-truth depiction of user behaviors. In real application scenarios, the check-in data can be rather unreliable due to both subjective and objective causes. We propose a Bayes-enhanced Multi-view Attention Network to address the uncertainty factors of the user check-ins.
  arXiv  Detail & Related papers  (2023-11-01T12:47:38Z)
• Graph Based Long-Term And Short-Term Interest Model for Click-Through Rate Prediction [8.679270588565398]
  We propose a Graph based Long-term and Short-term interest Model, termed GLSM. It consists of a multi-interest graph structure for capturing long-term user behavior, a multi-scenario heterogeneous sequence model for modeling short-term information, then an adaptive fusion mechanism to fused information from long-term and short-term behaviors.
  arXiv  Detail & Related papers  (2023-06-05T07:04:34Z)
• A Deep Behavior Path Matching Network for Click-Through Rate Prediction [9.800832176496002]
  We propose to match the user's current behavior path with historical behavior paths to predict user behaviors on the app. We design a deep neural network for behavior path matching and solve three difficulties in modeling behavior paths: sparsity, noise interference, and accurate matching of behavior paths. Our model shows excellent performance on two real-world datasets, outperforming the state-of-the-art CTR model.
  arXiv  Detail & Related papers  (2023-02-01T08:08:21Z)
• Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction [97.99938802797377]
  Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems. Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
  arXiv  Detail & Related papers  (2022-06-28T03:28:15Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Sampling Is All You Need on Modeling Long-Term User Behaviors for CTR Prediction [15.97120392599086]
  We propose textbfM (textbfSampling-based textbfDeep textbfModeling), a simple yet effective sampling-based end-to-end approach for modeling long-term user behaviors. We show theoretically and experimentally that the proposed method performs on par with standard attention-based models on modeling long-term user behaviors.
  arXiv  Detail & Related papers  (2022-05-20T15:20:52Z)
• Learning to Learn a Cold-start Sequential Recommender [70.5692886883067]
  The cold-start recommendation is an urgent problem in contemporary online applications. We propose a meta-learning based cold-start sequential recommendation framework called metaCSR. metaCSR holds the ability to learn the common patterns from regular users' behaviors.
  arXiv  Detail & Related papers  (2021-10-18T08:11:24Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning [82.46332224556257]
  We propose a novel adversarial learning approach by leveraging user interaction data for the Knowledge Graph Completion task. Our generator is isolated from user interaction data, and serves to improve the performance of the discriminator. To discover implicit entity preference of users, we design an elaborate collaborative learning algorithms based on graph neural networks.
  arXiv  Detail & Related papers  (2020-03-28T05:47:33Z)

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.