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
Proceedings ArticleDOI
SoCo: a social network aided context-aware recommender system
Xin Liu,Karl Aberer +1 more
TL;DR: This paper proposes SoCo, a novel context-aware recommender system incorporating elaborately processed social network information and introduces an additional social regularization term to the matrix factorization objective function to infer a user's preference for an item by learning opinions from his/her friends who are expected to share similar tastes.
Journal ArticleDOI
A Survey of Collaborative Filtering-Based Recommender Systems: From Traditional Methods to Hybrid Methods Based on Social Networks
TL;DR: The recent hybrid CF-based recommendation techniques fusing social networks to solve data sparsity and high dimensionality are introduced and provide a novel point of view to improve the performance of RS, thereby presenting a useful resource in the state-of-the-art research result for future researchers.
Proceedings ArticleDOI
HOP-rec: high-order proximity for implicit recommendation
TL;DR: This paper presents HOP-Rec, a unified and efficient method that incorporates factorization and graph-based models and significantly outperforms the state of the art on a range of large-scale real-world datasets.
Proceedings ArticleDOI
A cost-effective recommender system for taxi drivers
TL;DR: This paper develops a novel recursion strategy based on the special form of the net profit function for searching optimal candidate routes efficiently and develops a graph representation of road networks by mining the historical taxi GPS traces and provides a Brute-Force strategy to generate optimal driving route for recommendation.
Journal ArticleDOI
Content-Based Video Recommendation System Based on Stylistic Visual Features
Yashar Deldjoo,Mehdi Elahi,Paolo Cremonesi,Franca Garzotto,Pietro Piazzolla,Massimo Quadrana +5 more
TL;DR: A new content-based recommender system that encompasses a technique to automatically analyze video contents and to extract a set of representative stylistic features grounded on existing approaches of Applied Media Theory, to improve the accuracy of recommendations.
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.