Modeling Dynamic User Preference via Dictionary Learning for Sequential
Recommendation
- URL: http://arxiv.org/abs/2204.00752v1
- Date: Sat, 2 Apr 2022 03:23:46 GMT
- Title: Modeling Dynamic User Preference via Dictionary Learning for Sequential
Recommendation
- Authors: Chao Chen, Dongsheng Li, Junchi Yan, Xiaokang Yang
- Abstract summary: 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.
- Score: 133.8758914874593
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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, i.e., user static and dynamic preferences
are not modeled under the same latent space, which makes it difficult to fuse
them for recommendation. This paper considers the problem of embedding a user's
sequential behavior into the latent space of user preferences, namely
translating sequence to preference. To this end, we formulate the sequential
recommendation task as a dictionary learning problem, which learns: 1) a shared
dictionary matrix, each row of which represents a partial signal of user
dynamic preferences shared across users; and 2) a posterior distribution
estimator using a deep autoregressive model integrated with Gated Recurrent
Unit (GRU), which can select related rows of the dictionary to represent a
user's dynamic preferences conditioned on his/her past behaviors. Qualitative
studies on the Netflix dataset demonstrate that the proposed method can capture
the user preference drifts over time and quantitative studies on multiple
real-world datasets demonstrate that the proposed method can achieve higher
accuracy compared with state-of-the-art factorization and neural sequential
recommendation methods. The code is available at
https://github.com/cchao0116/S2PNM-TKDE2021.
Related papers
- Federated Privacy-preserving Collaborative Filtering for On-Device Next
App Prediction [52.16923290335873]
We propose a novel SeqMF model to solve the problem of predicting the next app launch during mobile device usage.
We modify the structure of the classical matrix factorization model and update the training procedure to sequential learning.
One more ingredient of the proposed approach is a new privacy mechanism that guarantees the protection of the sent data from the users to the remote server.
arXiv Detail & Related papers (2023-02-05T10:29:57Z) - Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform.
Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online.
Intent modeling is thus critical for understanding users and optimizing long-term user experience.
arXiv Detail & Related papers (2022-11-17T19:00:24Z) - 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) - 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) - 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) - Sequence Adaptation via Reinforcement Learning in Recommender Systems [8.909115457491522]
We propose the SAR model, which learns the sequential patterns and adjusts the sequence length of user-item interactions in a personalized manner.
In addition, we optimize a joint loss function to align the accuracy of the sequential recommendations with the expected cumulative rewards of the critic network.
Our experimental evaluation on four real-world datasets demonstrates the superiority of our proposed model over several baseline approaches.
arXiv Detail & Related papers (2021-07-31T13:56:46Z) - Sparse-Interest Network for Sequential Recommendation [78.83064567614656]
We propose a novel textbfSparse textbfInterest textbfNEtwork (SINE) for sequential recommendation.
Our sparse-interest module can adaptively infer a sparse set of concepts for each user from the large concept pool.
SINE can achieve substantial improvement over state-of-the-art methods.
arXiv Detail & Related papers (2021-02-18T11:03:48Z) - Learning User Preferences in Non-Stationary Environments [42.785926822853746]
We introduce a novel model for online non-stationary recommendation systems.
We show that our algorithm outperforms other static algorithms even when preferences do not change over time.
arXiv Detail & Related papers (2021-01-29T10:26:16Z) - Sequential recommendation with metric models based on frequent sequences [0.688204255655161]
We propose to use frequent sequences to identify the most relevant part of the user history for the recommendation.
The most salient items are then used in a unified metric model that embeds items based on user preferences and sequential dynamics.
arXiv Detail & Related papers (2020-08-12T22:08:04Z)
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.