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
Real-time recommendations for user-item streams
TL;DR: This paper analyzes the user-item interaction stream for several online news portals and develops several different algorithms optimized for providing recommendations based on streams fulfilling the requirements according to quality, robustness, scalability, and tight time-constraints.
Journal ArticleDOI
An adaptive approach to dealing with unstable behaviour of users in collaborative filtering systems
Reza Rafeh,Arash Bahrehmand +1 more
TL;DR: This article proposes an adaptive collaborative filtering algorithm which takes time into account when predicting users’ behaviour, and shows that the proposed algorithm is more accurate than the classical collaborative filtering technique.
Proceedings ArticleDOI
A novel approach for collaborative filtering to alleviate the new item cold-start problem
TL;DR: This paper proposes a hybrid algorithm by using both the ratings and content information to tackle item-side cold-start problem and shows predictions of this approach can be combined with the traditional collaborative-filtering methods to yield superior performance with a coefficient.
BookDOI
Differential Privacy and Applications Preface
TL;DR: This chapter presents three methods that apply differential privacy to achieve location privacy for LBSs: the geo-indistinguishability method, the synthetic differentially private trajectory Publishing method, and the hierarchical location data publishing method, with an emphasis on the last one.
Proceedings ArticleDOI
Session-aware Information Embedding for E-commerce Product Recommendation
TL;DR: This paper proposes a list-wise deep neural network based architecture to model the limited user behaviors within each session of an anonymous user session, and designs a session embedding method to pre-train a session representation.
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.