Deep Group Interest Modeling of Full Lifelong User Behaviors for CTR
Prediction
- URL: http://arxiv.org/abs/2311.10764v1
- Date: Wed, 15 Nov 2023 06:36:11 GMT
- Title: Deep Group Interest Modeling of Full Lifelong User Behaviors for CTR
Prediction
- Authors: Qi Liu, Xuyang Hou, Haoran Jin, jin Chen, Zhe Wang, Defu Lian, Tan Qu,
Jia Cheng, Jun Lei
- Abstract summary: Deep Group Interest Network (DGIN) is an end-to-end method to model the user's entire behavior history.
DGIN grouping reduces the behavior length significantly, from O(104) to O(102)
We identify a subset of behaviors that share the same item_id with the candidate item from the lifelong behavior sequence.
- Score: 31.391637634812714
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Extracting users' interests from their lifelong behavior sequence is crucial
for predicting Click-Through Rate (CTR). Most current methods employ a
two-stage process for efficiency: they first select historical behaviors
related to the candidate item and then deduce the user's interest from this
narrowed-down behavior sub-sequence. This two-stage paradigm, though effective,
leads to information loss. Solely using users' lifelong click behaviors doesn't
provide a complete picture of their interests, leading to suboptimal
performance. In our research, we introduce the Deep Group Interest Network
(DGIN), an end-to-end method to model the user's entire behavior history. This
includes all post-registration actions, such as clicks, cart additions,
purchases, and more, providing a nuanced user understanding. We start by
grouping the full range of behaviors using a relevant key (like item_id) to
enhance efficiency. This process reduces the behavior length significantly,
from O(10^4) to O(10^2). To mitigate the potential loss of information due to
grouping, we incorporate two categories of group attributes. Within each group,
we calculate statistical information on various heterogeneous behaviors (like
behavior counts) and employ self-attention mechanisms to highlight unique
behavior characteristics (like behavior type). Based on this reorganized
behavior data, the user's interests are derived using the Transformer
technique. Additionally, we identify a subset of behaviors that share the same
item_id with the candidate item from the lifelong behavior sequence. The
insights from this subset reveal the user's decision-making process related to
the candidate item, improving prediction accuracy. Our comprehensive
evaluation, both on industrial and public datasets, validates DGIN's efficacy
and efficiency.
Related papers
- Neighbor Based Enhancement for the Long-Tail Ranking Problem in Video
Rank Models [0.0]
We propose a novel neighbor enhancement structure to help train the representation of the target user or item.
Experiments on the well-known public dataset MovieLens 1M demonstrate the efficiency of the method.
arXiv Detail & Related papers (2023-02-16T07:38:51Z) - Coarse-to-Fine Knowledge-Enhanced Multi-Interest Learning Framework for
Multi-Behavior Recommendation [52.89816309759537]
Multi-types of behaviors (e.g., clicking, adding to cart, purchasing, etc.) widely exist in most real-world recommendation scenarios.
The state-of-the-art multi-behavior models learn behavior dependencies indistinguishably with all historical interactions as input.
We propose a novel Coarse-to-fine Knowledge-enhanced Multi-interest Learning framework to learn shared and behavior-specific interests for different behaviors.
arXiv Detail & Related papers (2022-08-03T05:28:14Z) - 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) - Recommender Transformers with Behavior Pathways [50.842316273120744]
We build the Recommender Transformer (RETR) with a novel Pathway Attention mechanism.
We empirically verify the effectiveness of RETR on seven real-world datasets.
arXiv Detail & Related papers (2022-06-13T08:58:37Z) - TEA: A Sequential Recommendation Framework via Temporally Evolving
Aggregations [12.626079984394766]
We propose a novel sequential recommendation framework based on dynamic user-item heterogeneous graphs.
We exploit the conditional random field to aggregate the heterogeneous graphs and user behaviors for probability estimation.
We provide scalable and flexible implementations of the proposed framework.
arXiv Detail & Related papers (2021-11-14T15:54:23Z) - End-to-End User Behavior Retrieval in Click-Through RatePrediction Model [15.52581453176164]
We propose a locality-sensitive hashing (LSH) method called ETA which can greatly reduce the training and inference cost.
We deploy ETA into a large-scale real world E-commerce system and achieve extra 3.1% improvements on GMV (Gross Merchandise Value) compared to a two-stage long user sequence CTR model.
arXiv Detail & Related papers (2021-08-10T06:28:29Z) - Dynamic Graph Collaborative Filtering [64.87765663208927]
Dynamic recommendation is essential for recommender systems to provide real-time predictions based on sequential data.
Here we propose Dynamic Graph Collaborative Filtering (DGCF), a novel framework leveraging dynamic graphs to capture collaborative and sequential relations.
Our approach achieves higher performance when the dataset contains less action repetition, indicating the effectiveness of integrating dynamic collaborative information.
arXiv Detail & Related papers (2021-01-08T04:16:24Z) - Multi-Interactive Attention Network for Fine-grained Feature Learning in
CTR Prediction [48.267995749975476]
In the Click-Through Rate (CTR) prediction scenario, user's sequential behaviors are well utilized to capture the user interest.
Existing methods mostly utilize attention on the behavior of users, which is not always suitable for CTR prediction.
We propose a Multi-Interactive Attention Network (MIAN) to comprehensively extract the latent relationship among all kinds of fine-grained features.
arXiv Detail & Related papers (2020-12-13T05:46:19Z) - Disentangled Graph Collaborative Filtering [100.26835145396782]
Disentangled Graph Collaborative Filtering (DGCF) is a new model for learning informative representations of users and items from interaction data.
By modeling a distribution over intents for each user-item interaction, we iteratively refine the intent-aware interaction graphs and representations.
DGCF achieves significant improvements over several state-of-the-art models like NGCF, DisenGCN, and MacridVAE.
arXiv Detail & Related papers (2020-07-03T15:37:25Z)
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.