A survey of collaborative filtering techniques
Reads0
Chats0
TLDR
From basic techniques to the state-of-the-art, this paper attempts to present a comprehensive survey for CF techniques, which can be served as a roadmap for research and practice in this area.Abstract:
As one of the most successful approaches to building recommender systems, collaborative filtering (CF) uses the known preferences of a group of users to make recommendations or predictions of the unknown preferences for other users. In this paper, we first introduce CF tasks and their main challenges, such as data sparsity, scalability, synonymy, gray sheep, shilling attacks, privacy protection, etc., and their possible solutions. We then present three main categories of CF techniques: memory-based, modelbased, and hybrid CF algorithms (that combine CF with other recommendation techniques), with examples for representative algorithms of each category, and analysis of their predictive performance and their ability to address the challenges. From basic techniques to the state-of-the-art, we attempt to present a comprehensive survey for CF techniques, which can be served as a roadmap for research and practice in this area.read more
Citations
More filters
Journal ArticleDOI
Cloud based real-time collaborative filtering for item-item recommendations
TL;DR: A large scale implementation of a video recommendation system in use by the largest media group in Latin America is described, making use of a commercial cloud computing platform to provide scalability, reduce costs and, more importantly, response times.
Posted Content
A Comparative Study of Pairwise Learning Methods based on Kernel Ridge Regression
TL;DR: This work reviews and unify kernel-based algorithms that are commonly used in different pairwise learning settings, ranging from matrix filtering to zero-shot learning, and shows that independent task kernel ridge regression, two-step kernel ridge regressors, and a linear matrix filter arise naturally as a special case of Kronecker kernel Ridge regression, implying that all these methods implicitly minimize a squared loss.
Book ChapterDOI
Just Rate It! Gamification as Part of Recommendation
TL;DR: This work presents a theoretical framework that provides basis for defining how gamification can be used to encourage ratings and improve user engagement in tasks that benefit user reputation, item reliability and to overcome cold-start problem.
Journal ArticleDOI
An encoder–decoder switch network for purchase prediction
TL;DR: This work is the first to address the task of purchase prediction given non-duplicate click sessions and proposes an encoder–decoder neural architecture to simultaneously model users’ click and purchase behaviors.
Proceedings ArticleDOI
Pcard: Personalized Restaurants Recommendation from Card Payment Transaction Records
TL;DR: A personalized POI recommendation system (Pcard) that learns user preferences based on user transaction history and restaurants' locations and model pairwise restaurant preferences with respect to each user based on their locations and dining histories is presented.
References
More filters
Journal ArticleDOI
Maximum likelihood from incomplete data via the EM algorithm
Book
Reinforcement Learning: An Introduction
TL;DR: This book provides a clear and simple account of the key ideas and algorithms of reinforcement learning, which ranges from the history of the field's intellectual foundations to the most recent developments and applications.
Journal ArticleDOI
Latent dirichlet allocation
TL;DR: This work proposes a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams, and Hofmann's aspect model.
Proceedings Article
Latent Dirichlet Allocation
TL;DR: This paper proposed a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams, and Hof-mann's aspect model, also known as probabilistic latent semantic indexing (pLSI).
Some methods for classification and analysis of multivariate observations
TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.