Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp018p58pg37v
DC FieldValueLanguage
dc.contributor.authorJerfel, Ghassen-
dc.date.accessioned2016-06-22T15:20:12Z-
dc.date.available2016-06-22T15:20:12Z-
dc.date.created2016-04-29-
dc.date.issued2016-06-22-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp018p58pg37v-
dc.description.abstractCollaborative 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.en_US
dc.format.extent22 pages*
dc.language.isoen_USen_US
dc.titleDynamic Compound-Poisson Factorizationen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2016en_US
pu.departmentComputer Scienceen_US
pu.pdf.coverpageSeniorThesisCoverPage-
Appears in Collections:Computer Science, 1988-2022

Files in This Item:
File SizeFormat