Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization

@inproceedings{Xiong2010TemporalCF,
  title={Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization},
  author={Liang Xiong and X. Chen and Tzu-Kuo Huang and Jeff G. Schneider and Jaime G. Carbonell},
  booktitle={SDM},
  year={2010}
}
Real-world relational data are seldom stationary, yet traditional collaborative filtering algorithms generally rely on this assumption. [] Key Method Further, we provide a fully Bayesian treatment to avoid tuning parameters and achieve automatic model complexity control. To learn the model we develop an efficient sampling procedure that is capable of analyzing large-scale data sets. This new algorithm, called Bayesian Probabilistic Tensor Factorization (BPTF), is evaluated on several real-world problems…
View via Publisher
cs.cmu.edu
657 Citations
Highly Influential Citations
79
Background Citations
275
Methods Citations
245
Results Citations
14

Figures and Tables from this paper

657 Citations

Robust probabilistic tensor analysis for time-variant collaborative filtering

Dynamic Bayesian Probabilistic Matrix Factorization

This paper proposes a dynamic Bayesian probabilistic matrix factorization model, designed for modeling time-varying distributions, 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.

Dynamic Collaborative Filtering With Compound Poisson Factorization

This paper proposes a conjugate and numerically stable dynamic matrix factorization (DCPF) based on compound Poisson matrix factorsization that models the smoothly drifting latent factors using Gamma-Markov chains.

Probabilistic Time Context Framework for Big Data Collaborative Recommendation

A novel coordinate descent based probabilistic Tensor factorization method; Scalable Probabilistic Time Context Tensor Factorization (SPTTF) for collaborative recommendation is proposed.

CMPTF: Contextual Modeling Probabilistic Tensor Factorization for recommender systems

Robust Sparse Tensor Decomposition by Probabilistic Latent Semantic Analysis

A novel robust tensor probabilistic latent semantic analysis (RT-pLSA) algorithm that not only takes time variable into account, but also uses the periodic property of data in time attribute to robustly predict the latent variable in the presence of noise.

Bayesian Robust Tensor Factorization for Incomplete Multiway Data

A generative model for robust tensor factorization in the presence of both missing data and outliers that can discover the groundtruth of CP rank and automatically adapt the sparsity inducing priors to various types of outliers is proposed.

Neural Tensor Factorization

A Neural Tensor Factorization (NTF) model is proposed for predictive tasks on dynamic relational data that incorporates the multi-layer perceptron structure for learning the non-linearities between different latent factors.

Time-Sensitive Collaborative Filtering through Adaptive Matrix Completion

A new incremental matrix completion method is proposed, that automatically allows the factors related to both users and items to adapt “on-line” to such drifts in users’ preferences and shifts in items’ perception or use.

A Deep Bayesian Tensor-Based System for Video Recommendation

An empirical study for video recommendation demonstrates the superiority of the proposed deep Bayesian probabilistic tensor framework and indicates that it can better capture the latent patterns of interactions and generates interesting recommendations based on creative tag combinations.
...

References

SHOWING 1-10 OF 26 REFERENCES

Probabilistic Matrix Factorization

The Probabilistic Matrix Factorization (PMF) model is presented, which scales linearly with the number of observations and performs well on the large, sparse, and very imbalanced Netflix dataset and is extended to include an adaptive prior on the model parameters.

Multi-HDP: A Non Parametric Bayesian Model for Tensor Factorization

This work introduces a novel generative Bayesian probabilistic model for unsupervised matrix and tensor factorization and describes an efficient collapsed Gibbs sampler for inference.

Probabilistic polyadic factorization and its application to personalized recommendation

A probabilistic polyadic factorization approach to directly model all the dimensions simultaneously in a unified framework is proposed and a non-negative version of the Tucker tensor factorization is shown.

Factorization meets the neighborhood: a multifaceted collaborative filtering model

The factor and neighborhood models can now be smoothly merged, thereby building a more accurate combined model and a new evaluation metric is suggested, which highlights the differences among methods, based on their performance at a top-K recommendation task.

Fast maximum margin matrix factorization for collaborative prediction

This work investigates a direct gradient-based optimization method for MMMF and finds that MMMf substantially outperforms all nine methods he tested and demonstrates it on large collaborative prediction problems.

Latent Dirichlet Allocation

Collaborative filtering with temporal dynamics

Two leading collaborative filtering recommendation approaches are revamp and a more sensitive approach is required, which can make better distinctions between transient effects and long term patterns.

Dynamic Non-Parametric Mixture Models and The Recurrent Chinese Restaurant Process a

The temporal Dirichlet process mixture model (TDPM) is presented as a framework for modeling complex longitudinal data and is demonstrated by using it to build an infinite dynamic mixture of Gaussian factors, and a simple non-parametric dynamic topic model applied to the NIPS12 collection.

Dynamic Non-Parametric Mixture Models and the Recurrent Chinese Restaurant Process: with Applications to Evolutionary Clustering

The temporal Dirichlet process mixture model (TDPM) is introduced as a framework for evolutionary clustering and is given a detailed and intuitive construction using the recurrent Chinese restaurant process (RCRP) metaphor, as well as a Gibbs sampling algorithm to carry out posterior inference in order to determine the optimal cluster evolution.

Probabilistic Latent Semantic Analysis

This work proposes a widely applicable generalization of maximum likelihood model fitting by tempered EM, based on a mixture decomposition derived from a latent class model which results in a more principled approach which has a solid foundation in statistics.