Enhancing User Interest based on Stream Clustering and Memory Networks in Large-Scale Recommender Systems

• URL: http://arxiv.org/abs/2405.13238v2
• Date: Sun, 26 May 2024 23:18:53 GMT
• Title: Enhancing User Interest based on Stream Clustering and Memory Networks in Large-Scale Recommender Systems
• Authors: Peng Liu, Nian Wang, Cong Xu, Ming Zhao, Bin Wang, Yi Ren,
• Abstract summary: User Interest Enhancement (UIE) enhances user interest including user profile and user history behavior sequences. UIE not only remarkably improves model performance on the users with sparse interest but also significantly enhance model performance on other users.
• Score: 19.25041732650533
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommender Systems (RSs) provide personalized recommendation service based on user interest, which are widely used in various platforms. However, there are lots of users with sparse interest due to lacking consumption behaviors, which leads to poor recommendation results for them. This problem is widespread in large-scale RSs and is particularly difficult to address. To solve this problem, we propose a novel solution named User Interest Enhancement (UIE) which enhances user interest including user profile and user history behavior sequences using the enhancement vectors and personalized enhancement vector generated based on stream clustering and memory networks from different perspectives. UIE not only remarkably improves model performance on the users with sparse interest but also significantly enhance model performance on other users. UIE is an end-to-end solution which is easy to be implemented based on ranking model. Moreover, we expand our solution and apply similar methods to long-tail items, which also achieves excellent improvement. Furthermore, we conduct extensive offline and online experiments in a large-scale industrial RS. The results demonstrate that our model outperforms other models remarkably, especially for the users with sparse interest. Until now, UIE has been fully deployed in multiple large-scale RSs and achieved remarkable improvements.

Related papers

• RecGPT Technical Report [57.84251629878726]
  We propose RecGPT, a next-generation framework that places user intent at the center of the recommendation pipeline.<n> RecGPT integrates large language models into key stages of user interest mining, item retrieval, and explanation generation.<n>Online experiments demonstrate that RecGPT achieves consistent performance gains across stakeholders.
  arXiv  Detail & Related papers  (2025-07-30T17:55:06Z)
• Multi-agents based User Values Mining for Recommendation [52.26100802380767]
  We propose a zero-shot multi-LLM collaborative framework for effective and accurate user value extraction.<n>We apply text summarization techniques to condense item content while preserving essential meaning.<n>To mitigate hallucinations, we introduce two specialized agent roles: evaluators and supervisors.
  arXiv  Detail & Related papers  (2025-05-02T04:01:31Z)
• Large Memory Network for Recommendation [21.618829330517844]
  Large Memory Network (LMN) is a novel idea by compressing and storing user history behavior information in a large-scale memory block. LMN has been fully deployed in Douyin E-Commerce Search (ECS), serving millions of users each day.
  arXiv  Detail & Related papers  (2025-02-08T13:08:11Z)
• A Recommendation Model Utilizing Separation Embedding and Self-Attention for Feature Mining [7.523158123940574]
  Recommendation systems provide users with content that meets their needs. Traditional click-through rate prediction and TOP-K recommendation mechanisms are unable to meet the recommendations needs. This paper proposes a recommendations system model based on a separation embedding cross-network.
  arXiv  Detail & Related papers  (2024-10-19T07:49:21Z)
• Retrieval Augmentation via User Interest Clustering [57.63883506013693]
  Industrial recommender systems are sensitive to the patterns of user-item engagement. We propose a novel approach that efficiently constructs user interest and facilitates low computational cost inference. Our approach has been deployed in multiple products at Meta, facilitating short-form video related recommendation.
  arXiv  Detail & Related papers  (2024-08-07T16:35:10Z)
• LLM-ESR: Large Language Models Enhancement for Long-tailed Sequential Recommendation [58.04939553630209]
  In real-world systems, most users interact with only a handful of items, while the majority of items are seldom consumed. These two issues, known as the long-tail user and long-tail item challenges, often pose difficulties for existing Sequential Recommendation systems. We propose the Large Language Models Enhancement framework for Sequential Recommendation (LLM-ESR) to address these challenges.
  arXiv  Detail & Related papers  (2024-05-31T07:24:42Z)
• Linear-Time Graph Neural Networks for Scalable Recommendations [50.45612795600707]
  The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions. Recent years have witnessed a rising interest in leveraging Graph Neural Networks (GNNs) to boost the prediction performance of recommender systems. We propose a Linear-Time Graph Neural Network (LTGNN) to scale up GNN-based recommender systems to achieve comparable scalability as classic MF approaches.
  arXiv  Detail & Related papers  (2024-02-21T17:58:10Z)
• Handling Large-scale Cardinality in building recommendation systems [0.0]
  This paper presents two innovative techniques to address the challenge of high cardinality in recommendation systems. We propose a bag-of-words approach, combined with layer sharing, to substantially decrease the model size while improving performance.
  arXiv  Detail & Related papers  (2024-01-17T19:49:11Z)
• Hierarchical Multi-Interest Co-Network For Coarse-Grained Ranking [27.00455925014862]
  Large-scale online recommendation services usually consist of three stages: candidate generation, coarse-grained ranking, and fine-grained ranking. Previous research shows that users' interests are diverse, and one vector is not sufficient to capture users' different preferences. This paper proposes a Hierarchical Multi-Interest Co-Network (HCN) to capture users' diverse interests in the coarse-grained ranking stage.
  arXiv  Detail & Related papers  (2022-10-19T13:40:16Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• Personalizing Intervened Network for Long-tailed Sequential User Behavior Modeling [66.02953670238647]
  Tail users suffer from significantly lower-quality recommendation than the head users after joint training. A model trained on tail users separately still achieve inferior results due to limited data. We propose a novel approach that significantly improves the recommendation performance of the tail users.
  arXiv  Detail & Related papers  (2022-08-19T02:50:19Z)
• Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach [56.12815715932561]
  We propose a new broad recommender system called Broad Collaborative Filtering (BroadCF) Instead of Deep Neural Networks (DNNs), Broad Learning System (BLS) is used as a mapping function to learn the complex nonlinear relationships between users and items. Extensive experiments conducted on seven benchmark datasets have confirmed the effectiveness of the proposed BroadCF algorithm.
  arXiv  Detail & Related papers  (2022-04-20T01:25:08Z)
• Sequential Search with Off-Policy Reinforcement Learning [48.88165680363482]
  We propose a highly scalable hybrid learning model that consists of an RNN learning framework and an attention model. As a novel optimization step, we fit multiple short user sequences in a single RNN pass within a training batch, by solving a greedy knapsack problem on the fly. We also explore the use of off-policy reinforcement learning in multi-session personalized search ranking.
  arXiv  Detail & Related papers  (2022-02-01T06:52:40Z)
• Knowledge-aware Coupled Graph Neural Network for Social Recommendation [29.648300580880683]
  We propose a Knowledge-aware Coupled Graph Neural Network (KCGN) that injects the inter-dependent knowledge across items and users into the recommendation framework. KCGN enables the high-order user- and item-wise relation encoding by exploiting the mutual information for global graph structure awareness. We further augment KCGN with the capability of capturing dynamic multi-typed user-item interactive patterns.
  arXiv  Detail & Related papers  (2021-10-08T09:13:51Z)
• Denoising User-aware Memory Network for Recommendation [11.145186013006375]
  We propose a novel CTR model named denoising user-aware memory network (DUMN) DUMN uses the representation of explicit feedback to purify the representation of implicit feedback, and effectively denoise the implicit feedback. Experiments on two real e-commerce user behavior datasets show that DUMN has a significant improvement over the state-of-the-art baselines.
  arXiv  Detail & Related papers  (2021-07-12T14:39:36Z)
• Adversarial Feature Augmentation and Normalization for Visual Recognition [109.6834687220478]
  Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models. Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings. We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
  arXiv  Detail & Related papers  (2021-03-22T20:36:34Z)
• Learning User Representations with Hypercuboids for Recommender Systems [26.80987554753327]
  Our model explicitly models user interests as a hypercuboid instead of a point in the space. We present two variants of hypercuboids to enhance the capability in capturing the diversities of user interests. A neural architecture is also proposed to facilitate user hypercuboid learning by capturing the activity sequences (e.g., buy and rate) of users.
  arXiv  Detail & Related papers  (2020-11-11T12:50:00Z)

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.