Transformers Meet ACT-R: Repeat-Aware and Sequential Listening Session Recommendation

• URL: http://arxiv.org/abs/2408.16578v1
• Date: Thu, 29 Aug 2024 14:44:12 GMT
• Title: Transformers Meet ACT-R: Repeat-Aware and Sequential Listening Session Recommendation
• Authors: Viet-Anh Tran, Guillaume Salha-Galvan, Bruno Sguerra, Romain Hennequin,
• Abstract summary: We introduce PISA, a session-level sequential recommender system for music streaming services. PISA employs a Transformer architecture learning embedding representations of listening sessions and users. We demonstrate the empirical relevance of PISA using both publicly available listening data from Last.fm and proprietary data from Deezer.
• Score: 12.295794664393368
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Music streaming services often leverage sequential recommender systems to predict the best music to showcase to users based on past sequences of listening sessions. Nonetheless, most sequential recommendation methods ignore or insufficiently account for repetitive behaviors. This is a crucial limitation for music recommendation, as repeatedly listening to the same song over time is a common phenomenon that can even change the way users perceive this song. In this paper, we introduce PISA (Psychology-Informed Session embedding using ACT-R), a session-level sequential recommender system that overcomes this limitation. PISA employs a Transformer architecture learning embedding representations of listening sessions and users using attention mechanisms inspired by Anderson's ACT-R (Adaptive Control of Thought-Rational), a cognitive architecture modeling human information access and memory dynamics. This approach enables us to capture dynamic and repetitive patterns from user behaviors, allowing us to effectively predict the songs they will listen to in subsequent sessions, whether they are repeated or new ones. We demonstrate the empirical relevance of PISA using both publicly available listening data from Last.fm and proprietary data from Deezer, a global music streaming service, confirming the critical importance of repetition modeling for sequential listening session recommendation. Along with this paper, we publicly release our proprietary dataset to foster future research in this field, as well as the source code of PISA to facilitate its future use.

Related papers

• Towards Leveraging Contrastively Pretrained Neural Audio Embeddings for Recommender Tasks [18.95453617434051]
  Music recommender systems frequently utilize network-based models to capture relationships between music pieces, artists, and users. New music pieces or artists often face the cold-start problem due to insufficient initial information. To address this, one can extract content-based information directly from the music to enhance collaborative-filtering-based methods.
  arXiv  Detail & Related papers  (2024-09-13T17:53:06Z)
• When Search Meets Recommendation: Learning Disentangled Search Representation for Recommendation [56.98380787425388]
  We propose a search-Enhanced framework for the Sequential Recommendation (SESRec) SESRec disentangling similar and dissimilar representations within S&R behaviors. Experiments on both industrial and public datasets demonstrate that SESRec consistently outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2023-05-18T09:04:50Z)
• Oh, Jeez! or Uh-huh? A Listener-aware Backchannel Predictor on ASR Transcriptions [30.779582465296897]
  We develop a system which acts as a proactive listener by inserting backchannels, such as continuers and assessment, to influence speakers. Our model takes into account not only lexical and acoustic cues, but also introduces the simple and novel idea of using listener embeddings to mimic different backchanneling behaviours.
  arXiv  Detail & Related papers  (2023-04-10T09:33:29Z)
• STAR: A Session-Based Time-Aware Recommender System [8.122270502556372]
  Session-Based Recommenders (SBRs) aim to predict users' next preferences regard to their previous interactions in sessions while there is no historical information about them. In this paper, we examine the potential of session temporal information in enhancing the performance of SBRs. We propose the STAR framework, which utilizes the time intervals between events within sessions to construct more informative representations for items and sessions.
  arXiv  Detail & Related papers  (2022-11-11T18:25:48Z)
• 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)
• Multi-Behavior Sequential Recommendation with Temporal Graph Transformer [66.10169268762014]
  We tackle the dynamic user-item relation learning with the awareness of multi-behavior interactive patterns. We propose a new Temporal Graph Transformer (TGT) recommendation framework to jointly capture dynamic short-term and long-range user-item interactive patterns.
  arXiv  Detail & Related papers  (2022-06-06T15:42:54Z)
• Exploiting Session Information in BERT-based Session-aware Sequential Recommendation [13.15762859612114]
  In recommendation systems, utilizing the user interaction history as sequential information has resulted in great performance improvement. In many online services, user interactions are commonly grouped by sessions that presumably share preferences, which requires a different approach from ordinary sequence representation techniques. We propose three methods to improve recommendation performance by exploiting session information while minimizing additional parameters in a BERT-based sequential recommendation model.
  arXiv  Detail & Related papers  (2022-04-22T17:58:10Z)
• Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation [133.8758914874593]
  Capturing the dynamics in user preference is crucial to better predict user future behaviors because user preferences often drift over time. Many existing recommendation algorithms -- including both shallow and deep ones -- often model such dynamics independently. This paper considers the problem of embedding a user's sequential behavior into the latent space of user preferences.
  arXiv  Detail & Related papers  (2022-04-02T03:23:46Z)
• SR-HetGNN:Session-based Recommendation with Heterogeneous Graph Neural Network [20.82060191403763]
  Session-Based Recommendation System aims to predict the user's next click based on their previous session sequence. We propose SR-HetGNN, a novel session recommendation method that uses a heterogeneous graph neural network (HetGNN) to learn session embeddings. SR-HetGNN is shown to be superior to the existing state-of-the-art session-based recommendation methods through extensive experiments over two real large datasets Diginetica and Tmall.
  arXiv  Detail & Related papers  (2021-08-12T10:12:48Z)
• Controllable Multi-Interest Framework for Recommendation [64.30030600415654]
  We formalize the recommender system as a sequential recommendation problem. We propose a novel controllable multi-interest framework for the sequential recommendation, called ComiRec. Our framework has been successfully deployed on the offline Alibaba distributed cloud platform.
  arXiv  Detail & Related papers  (2020-05-19T10:18:43Z)
• 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.