Dynamic Bayesian Probabilistic Matrix Factorization

Authors

  • Sotirios Chatzis Cyprus University of Technology

DOI:

https://doi.org/10.1609/aaai.v28i1.8951

Keywords:

Probabilistic Matrix Factorization, Dynamic Hierarchical Dirichlet Process, Bayesian Nonparametrics, Collaborative Filtering

Abstract

Collaborative filtering algorithms generally rely on the assumption that user preference patterns remain stationary. However, real-world relational data are seldom stationary. User preference patterns may change over time, giving rise to the requirement of designing collaborative filtering systems capable of detecting and adapting to preference pattern shifts. Motivated by this observation, in this paper we propose a dynamic Bayesian probabilistic matrix factorization model, designed for modeling time-varying distributions. Formulation of our model is based on imposition of a dynamic hierarchical Dirichlet process (dHDP) prior over the space of probabilistic matrix factorization models to capture the time-evolving statistical properties of modeled sequential relational datasets. We develop a simple Markov Chain Monte Carlo sampler to perform inference. We present experimental results to demonstrate the superiority of our temporal model.

Downloads

Published

2014-06-21

How to Cite

Chatzis, S. (2014). Dynamic Bayesian Probabilistic Matrix Factorization. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1). https://doi.org/10.1609/aaai.v28i1.8951

Issue

Section

Main Track: Novel Machine Learning Algorithms