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
A multi-level collaborative filtering method that improves recommendations
TL;DR: A multi-level recommendation method with its main purpose being to assist users in decision making by providing recommendations of better quality, which can be applied in different online domains that use collaborative recommender systems, thus improving the overall user experience.
Journal ArticleDOI
Recommending items to group of users using Matrix Factorization based Collaborative Filtering
TL;DR: It is demonstrated that the performance of group recommender systems varies depending on the size of the group, and MF based CF is the best option for groupRecommender systems.
Journal ArticleDOI
A scientometric review of emerging trends and new developments in recommendation systems
Meen Chul Kim,Chaomei Chen +1 more
TL;DR: It is found that a number of landmark studies in 1980s and 1990s and techniques such as LDA, pLSI, and matrix factorization have tremendously influenced the development of the recommendation systems research.
Proceedings Article
Bayesian Bias Mitigation for Crowdsourcing
TL;DR: This work presents Bayesian Bias Mitigation for Crowdsourcing (BBMC), a Bayesian model to unify all three steps of data curation and learning and proposes a general approximation strategy for Markov chains to efficiently quantify the effect of a perturbation on the stationary distribution.
Journal ArticleDOI
Regression-based three-way recommendation
Heng-Ru Zhang,Fan Min,Bing Shi +2 more
TL;DR: Experimental results on the well-known MovieLens data set show that threshold settings are critical to the performance of the recommender, and that two optimal threshold-determination approaches based on the three-way decision model can compute unique optimal thresholds.
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.