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
Integrating Triangle and Jaccard similarities for recommendation.
TL;DR: A new measure for recommendation through integrating Triangle and Jaccard similarities is proposed, which outperforms all the counterparts in terms of the mean absolute error and the root mean square error.
Journal ArticleDOI
Scalable and Accurate Prediction of Availability of Atomic Web Services
TL;DR: LUCS is presented, a formal model for predicting the availability of atomic web services that enhances the current state-of-the-art models used in service recommendation systems and significantly improves availability prediction when all of the LUCS input parameters are available.
Journal ArticleDOI
Estimating confidence of individual rating predictions in collaborative filtering recommender systems
TL;DR: The comparative experimental evaluation demonstrates that two of the algorithms proposed in this study: one using resampling of available ratings and one using noise injection to the available ratings provide the best performance in terms of separation between predictions of high and low confidence.
Proceedings Article
A Survey on Challenges and Methods in News Recommendation
TL;DR: This paper presents the different approaches to news recommender systems and the challenges of news recommendation and suggests some new methods to make proper news recommendations.
Journal ArticleDOI
VSRank: A Novel Framework for Ranking-Based Collaborative Filtering
TL;DR: VSRank is proposed, a novel framework that seeks accuracy improvement of ranking-based CF through adaptation of the vector space model and considers each user as a document and his or her pairwise relative preferences as terms, and uses a novel degree-specialty weighting scheme resembling TF-IDF to weight the terms.
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.