2018 · 34 citations · 19 references
ComputingComputer ScienceData ScienceData MiningMachine LearningRecommender SystemsImplicit Feedback ModelingMatrix FactorizationOnline RecommendationRecommendation SystemsUser ModelingBenchmark DatasetsItem EmbeddingsLatent Factor ModelsLearned Feature EmbeddingsUser InteractionUser Interaction Modeling
Matrix factorization has been widely adopted for recommendation by learning latent embeddings of users and items from observed user-item interaction data. However, previous methods usually assume the learned embeddings are static or homogeneously evolving with the same diffusion rate. This is not valid in most scenarios, where users’ preferences and item attributes heterogeneously drift over time. To remedy this issue, we have proposed a novel dynamic matrix factorization model, named Dynamic Bayesian Logistic Matrix Factorization (DBLMF), which aims to learn heterogeneous user and item embeddings that are drifting with inconsistent diffusion rates. More specifically, DBLMF extends logistic matrix factorization to model the probability a user would like to interact with an item at a given timestamp, and a diffusion process to connect latent embeddings over time. In addition, an efficient Bayesian inference algorithm has also been proposed to make DBLMF scalable on large datasets. The effectiveness of the proposed method has been demonstrated by extensive experiments on real datasets, compared with the state-of-the-art methods.
19
BPR: Bayesian Personalized Ranking from Implicit Feedback
Steffen Rendle, Christoph Freudenthaler, Zeno Gantner et al. · arXiv (Cornell University) · 2012 · 4.4K citations · Full text
Collaborative filtering with temporal dynamics
Yehuda Koren · 2009 · 1.2K citations
Fast Matrix Factorization for Online Recommendation with Implicit Feedback
Xiangnan He, Hanwang Zhang, Min‐Yen Kan et al. · 2016 · 1K citations
Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization
Liang Xiong, Xi Chen, Tzu-Kuo Huang et al. · 2010 · 590 citations · Full text