Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp018p58pg37v
Title: Dynamic Compound-Poisson Factorization
Authors: Jerfel, Ghassen
Advisors: Engelhardt, Barbara
Department: Computer Science
Class Year: 2016
Abstract: Collaborative Filtering (CF) analyzes previous user-item interactions in order to infer the latent factors that represent user preferences and item characteristics. However, most current collaborative filtering algorithms assume that these latent factors are static while user preferences and item perceptions drift over time. In this paper, we propose a novel Bayesian Dynamic Matrix Factorization model based on Compound Poisson Factorization that models the smoothly drifting latent factors as Gamma chains. We provide a novel approach to Gamma chains to guarantee their conjugacy and numerical stability. We then provide a scalable inference algorithm to learn the parameters. We finally apply our model to timestamped ratings datasets such as Netflix, Yelp, LastFm where we achieve higher predictive accuracy than state-of-the-art static factorization models.
Extent: 22 pages
URI: http://arks.princeton.edu/ark:/88435/dsp018p58pg37v
Type of Material: Princeton University Senior Theses
Language: en_US
Appears in Collections:Computer Science, 1987-2024

Files in This Item:
File SizeFormat 
Jerfel_Ghassen_thesis.pdf282.64 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.