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 Article
A scalable collaborative recommender algorithm based on user density-based clustering
TL;DR: A hybrid recommender system is proposed, which is composed of a density-based user clustering method based on users' demographic information and user-based collaborative filtering and shows that the proposed method improves accuracy as well as scalability.
Journal ArticleDOI
Discovery of Web user communities and their role in personalization
TL;DR: The concept of active user community is proposed and shown how this relates to recent efforts on mining social networks and social media and introduces new opportunities for community-based personalization.
Proceedings ArticleDOI
Recommending Web Service Based on User Relationships and Preferences
TL;DR: A service recommendation algorithm named as URPC-Rec (User Relationships & Preferences Clustering and Recommendation), which first clusters users based on their history behaviors such as the services they ever invoked, and then makes personalized recommendations for users considering both the clustering results and user basic information and relationships.
Journal ArticleDOI
Learning Informative Priors from Heterogeneous Domains to Improve Recommendation in Cold-Start User Domains
TL;DR: A Weighted Irregular Tensor Factorization (WITF) model is proposed to leverage multi-domain feedback data across all users to learn the cross-domain priors w.r.t. both users and items and shows the superiority of the model over comparison models.
Journal ArticleDOI
Collaborative Filtering Based on Gaussian Mixture Model and Improved Jaccard Similarity
Hangyu Yan,Yan Tang +1 more
TL;DR: A new collaborative filtering algorithm which based on Gaussian mixture model and improved Jaccard similarity is proposed, which effectively solves the impact of rating data sparsity on collaborative filtering algorithms and improves the accuracy of the rating prediction.
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.