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
Matrix completion by deep matrix factorization.
Jicong Fan,Jieyu Cheng +1 more
TL;DR: DMF is compared with state-of-the-art methods of linear and nonlinear matrix completion in the tasks of toy matrix completion, image inpainting and collaborative filtering and DMF is applicable to large matrices.
Journal ArticleDOI
Variational Bayesian Matrix Factorization for Bounded Support Data
TL;DR: With the variational inference framework and the relative convexity property of the log-inverse-beta function, a new lower-bound is proposed to approximate the objective function and an analytically tractable solution is derived to approximately calculate the posterior distributions.
Proceedings ArticleDOI
Content-boosted matrix factorization for recommender systems: experiments with recipe recommendation
Peter G. M. Forbes,Mu Zhu +1 more
TL;DR: This work describes a simple algorithm for incorporating content information directly into matrix factorization approach for collaborative filtering and presents experimental evidence using recipe data to show that this not only improves recommendation accuracy but also provides useful insights about the contents themselves that are otherwise unavailable.
Book ChapterDOI
Recommender Systems: Issues, Challenges, and Research Opportunities
TL;DR: The current trends, issues, challenges, and research opportunities in developing high-quality recommender systems are investigated and the goal towards fine-tuned and high- quality recommender system can be achieved is achieved.
Proceedings ArticleDOI
Exploring personal impact for group recommendation
TL;DR: This paper analyzes the decision making process in a group to propose a personal impact topic (PIT) model for group recommendations, which effectively identifies the group preference profile for a given group by considering the personal preferences and personal impacts of group members.
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.