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
Joint representation learning with ratings and reviews for recommendation
TL;DR: A hybrid deep collaborative filtering model that jointly learns rating embedding and textural feature from ratings and reviews respectively is proposed that demonstrates the superior performance of the proposed method over several state-of-the-art methods.
Proceedings ArticleDOI
Recommendation System Based on Prediction of User Preference Changes
TL;DR: This paper proposes an approach that predicts user preferences with consideration of preference changes by learning the order of purchase history in a recommender system and shows that this approach outperforms competitive methods such as the first order Markov model.
Journal ArticleDOI
Collaborative pseudo-relevance feedback
TL;DR: A novel approach to PRF inspired by collaborative filtering (CF) is introduced and an adaptive tuning method which automatically sets algorithmic parameters is described which consistently outperforms conventional PRF, regardless of the underlying retrieval model.
Journal ArticleDOI
Accurate and Efficient Indoor Location by Dynamic Warping in Sequence-Type Radio-map
TL;DR: WarpMap is proposed, an efficient sequence-type radio-map model and an accurate indoor location method by dynamic warping that overcomes the path combinational explosion and RSS miss-of-detection problems and an efficient sub-sequence dynamic time warping (SDTW) algorithm for accurate and efficient on-line locating.
Proceedings ArticleDOI
Reliability Prediction for Service Oriented System via Matrix Factorization in a Collaborative Way
TL;DR: This paper combines two independent models extended from Matrix Factorization to build an ensemble model, and explicate the way of calculating the final failure probability of the whole system.
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.