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
Predicting player moves in an educational game: A hybrid approach
Yun En Liu,Travis Mandel,Eric Butler,Erik Andersen,Eleanor O'Rourke,Emma Brunskill,Zoran Popović +6 more
TL;DR: A new algorithm is addressed that combines Markov models, state aggregation, and player heuristic search, dynamically selecting between these methods based on the amount of available data, and achieved greater predictive accuracy than any of the methods alone, and performed significantly better than a random baseline.
Proceedings ArticleDOI
Multi-task Learning for Bayesian Matrix Factorization
TL;DR: This work extends the previous work of Bayesian matrix factorization with Dirichlet process mixture into a multi-task learning approach by sharing latent parameters among different tasks, which does not require object identities and thus is more widely applicable.
Journal ArticleDOI
Stream-based semi-supervised learning for recommender systems
Pawel Matuszyk,Myra Spiliopoulou +1 more
TL;DR: A state-of-the-art matrix factorization algorithm is extended by the ability to add new dimensions to the matrix at runtime and two approaches to semi-supervised learning are implemented: co-training and self-learning.
Proceedings ArticleDOI
Analysis of recommendation algorithms for Internet of Things
TL;DR: A hyper-graph model for IoT systems in which each hyper-edge connects users, objects, and services is proposed and shows that the graph-based recommendation algorithm can be used to develop an effective recommender system for IoT.
Proceedings ArticleDOI
An improved model of trust-aware recommender systems using reliability measurements
TL;DR: This paper proposes a model to improve the accuracy of trust-aware recommender systems using reliability measurements and uses these measurements to assess the reliability of a prediction and reconstruction the neighborhood of users.
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.