Unifying collaborative and content-based filtering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Predictive discrete latent factor models for large scale dyadic data
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Contextual advertising by combining relevance with click feedback
Proceedings of the 17th international conference on World Wide Web
Kalman Filtering: with Real-Time Applications
Kalman Filtering: with Real-Time Applications
Spatio-temporal models for estimating click-through rate
Proceedings of the 18th international conference on World wide web
Matchbox: large scale online bayesian recommendations
Proceedings of the 18th international conference on World wide web
Regression-based latent factor models
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization
The Journal of Machine Learning Research
Relation regularized matrix factorization
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Fast online learning through offline initialization for time-sensitive recommendation
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Evaluating the dynamic properties of recommendation algorithms
Proceedings of the fourth ACM conference on Recommender systems
A spatio-temporal framework for related topic search in micro-blogging
AMT'10 Proceedings of the 6th international conference on Active media technology
Cost-aware travel tour recommendation
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
When recommendation meets mobile: contextual and personalized recommendation on the go
Proceedings of the 13th international conference on Ubiquitous computing
Tensor factorization using auxiliary information
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Learning multiple models for exploiting predictive heterogeneity in recommender systems
Proceedings of the 2nd International Workshop on Information Heterogeneity and Fusion in Recommender Systems
Collaborative filtering via temporal euclidean embedding
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Predicting response in mobile advertising with hierarchical importance-aware factorization machine
Proceedings of the 7th ACM international conference on Web search and data mining
Cost-Aware Collaborative Filtering for Travel Tour Recommendations
ACM Transactions on Information Systems (TOIS)
Time-aware recommender systems: a comprehensive survey and analysis of existing evaluation protocols
User Modeling and User-Adapted Interaction
| Hi-index | 0.00 |
In this paper, we propose a novel spatio-temporal model for collaborative filtering applications. Our model is based on low-rank matrix factorization that uses a spatio-temporal filtering approach to estimate user and item factors. The spatial component regularizes the factors by exploiting correlation across users and/or items, modeled as a function of some implicit feedback (e.g., who rated what) and/or some side information (e.g., user demographics, browsing history). In particular, we incorporate correlation in factors through a Markov random field prior in a probabilistic framework, whereby the neighborhood weights are functions of user and item covariates. The temporal component ensures that the user/item factors adapt to process changes that occur through time and is implemented in a state space framework with fast estimation through Kalman filtering. Our spatio-temporal filtering (ST-KF hereafter) approach provides a single joint model to simultaneously incorporate both spatial and temporal structure in ratings and therefore provides an accurate method to predict future ratings. To ensure scalability of ST-KF, we employ a mean-field approximation for inference. Incorporating user/item covariates in estimating neighborhood weights also helps in dealing with both cold-start and warm-start problems seamlessly in a single unified modeling framework; covariates predict factors for new users and items through the neighborhood. We illustrate our method on simulated data, benchmark data and data obtained from a relatively new recommender system application arising in the context of Yahoo! Front Page.