Context-aware short-term interest first model for session-based recommendation

• URL: http://arxiv.org/abs/2103.15514v1
• Date: Mon, 29 Mar 2021 11:36:00 GMT
• Title: Context-aware short-term interest first model for session-based recommendation
• Authors: Haomei Duan and Jinghua Zhu
• Abstract summary: We propose a context-aware short-term interest first model (CASIF) The aim of this paper is improve the accuracy of recommendations by combining context and short-term interest. In the end, the short-term and long-term interest are combined as the final interest and multiplied by the candidate vector to obtain the recommendation probability.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the case that user profiles are not available, the recommendation based on anonymous session is particularly important, which aims to predict the items that the user may click at the next moment based on the user's access sequence over a while. In recent years, with the development of recurrent neural network, attention mechanism, and graph neural network, the performance of session-based recommendation has been greatly improved. However, the previous methods did not comprehensively consider the context dependencies and short-term interest first of the session. Therefore, we propose a context-aware short-term interest first model (CASIF).The aim of this paper is improve the accuracy of recommendations by combining context and short-term interest. In CASIF, we dynamically construct a graph structure for session sequences and capture rich context dependencies via graph neural network (GNN), latent feature vectors are captured as inputs of the next step. Then we build the short-term interest first module, which can to capture the user's general interest from the session in the context of long-term memory, at the same time get the user's current interest from the item of the last click. In the end, the short-term and long-term interest are combined as the final interest and multiplied by the candidate vector to obtain the recommendation probability. Finally, a large number of experiments on two real-world datasets demonstrate the effectiveness of our proposed method.

Related papers

• IDNP: Interest Dynamics Modeling using Generative Neural Processes for Sequential Recommendation [40.4445022666304]
  We present an textbfInterest textbfDynamics modeling framework using generative textbfNeural textbfProcesses, coined IDNP, to model user interests from a functional perspective. Our model outperforms state-of-the-arts on various evaluation metrics.
  arXiv  Detail & Related papers  (2022-08-09T08:33:32Z)
• 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)
• 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)
• Learning Dual Dynamic Representations on Time-Sliced User-Item Interaction Graphs for Sequential Recommendation [62.30552176649873]
  We devise a novel Dynamic Representation Learning model for Sequential Recommendation (DRL-SRe) To better model the user-item interactions for characterizing the dynamics from both sides, the proposed model builds a global user-item interaction graph for each time slice. To enable the model to capture fine-grained temporal information, we propose an auxiliary temporal prediction task over consecutive time slices.
  arXiv  Detail & Related papers  (2021-09-24T07:44:27Z)
• From Implicit to Explicit feedback: A deep neural network for modeling sequential behaviours and long-short term preferences of online users [3.464871689508835]
  Implicit and explicit feedback have different roles for a useful recommendation. We go from the hypothesis that a user's preference at a time is a combination of long-term and short-term interests.
  arXiv  Detail & Related papers  (2021-07-26T16:59:20Z)
• Dynamic Memory based Attention Network for Sequential Recommendation [79.5901228623551]
  We propose a novel long sequential recommendation model called Dynamic Memory-based Attention Network (DMAN) It segments the overall long behavior sequence into a series of sub-sequences, then trains the model and maintains a set of memory blocks to preserve long-term interests of users. Based on the dynamic memory, the user's short-term and long-term interests can be explicitly extracted and combined for efficient joint recommendation.
  arXiv  Detail & Related papers  (2021-02-18T11:08:54Z)
• Dynamic Embeddings for Interaction Prediction [2.5758502140236024]
  In recommender systems (RSs), predicting the next item that a user interacts with is critical for user retention. Recent studies have shown the effectiveness of modeling the mutual interactions between users and items using separate user and item embeddings. We propose a novel method called DeePRed that addresses some of their limitations.
  arXiv  Detail & Related papers  (2020-11-10T16:04:46Z)
• UBER-GNN: A User-Based Embeddings Recommendation based on Graph Neural Networks [27.485553372163732]
  We propose User-Based Embeddings Recommendation with Graph Neural Network, UBER-GNN for brevity. UBER-GNN takes advantage of structured data to generate longterm user preferences, and transfers session sequences into graphs to generate graph-based dynamic interests. Experiments conducted on real Ping An scenario show that UBER-GNN outperforms the state-of-the-art session-based recommendation methods.
  arXiv  Detail & Related papers  (2020-08-06T09:54:03Z)
• Modeling Long-Term and Short-Term Interests with Parallel Attentions for Session-based Recommendation [17.092823992007794]
  Session-based recommenders typically explore the users' evolving interests. Recent advances in attention mechanisms have led to state-of-the-art methods for solving this task. We propose a novel Parallel Attention Network model (PAN) for Session-based Recommendation.
  arXiv  Detail & Related papers  (2020-06-27T11:47:51Z)
• Sequential Recommender via Time-aware Attentive Memory Network [67.26862011527986]
  We propose a temporal gating methodology to improve attention mechanism and recurrent units. We also propose a Multi-hop Time-aware Attentive Memory network to integrate long-term and short-term preferences. Our approach is scalable for candidate retrieval tasks and can be viewed as a non-linear generalization of latent factorization for dot-product based Top-K recommendation.
  arXiv  Detail & Related papers  (2020-05-18T11:29:38Z)
• TAGNN: Target Attentive Graph Neural Networks for Session-based Recommendation [66.04457457299218]
  We propose a novel target attentive graph neural network (TAGNN) model for session-based recommendation. In TAGNN, target-aware attention adaptively activates different user interests with respect to varied target items. The learned interest representation vector varies with different target items, greatly improving the expressiveness of the model.
  arXiv  Detail & Related papers  (2020-05-06T14:17:05Z)

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.