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
Network-based recommendation algorithms: A review
TL;DR: A broad range of network-based recommendation algorithms are reviewed and for the first time their performance on three distinct real datasets is compared.
Journal ArticleDOI
Predicting User-Topic Opinions in Twitter with Social and Topical Context
TL;DR: The experimental results on a real-world Twitter data set show that this framework outperforms the state-of-the-art collaborative filtering methods, and demonstrate that both social context and topical context are effective in improving the user-topic opinion prediction performance.
Journal ArticleDOI
Joint Neural Collaborative Filtering for Recommender Systems
TL;DR: The J-NCF model has a competitive recommendation performance with inactive users and different degrees of data sparsity when compared to state-of-the-art baselines and a new loss function for optimization that takes both implicit and explicit feedback, point-wise and pair-wise loss into account.
Journal ArticleDOI
Patient Similarity in Prediction Models Based on Health Data: A Scoping Review.
TL;DR: This work summarizes and reviews published studies describing computer-based approaches for predicting patients’ future health status based on health data and patient similarity, identify gaps, and provide a starting point for related future research.
Proceedings ArticleDOI
Choice-based preference elicitation for collaborative filtering recommender systems
TL;DR: This work presents an approach to interactive recommending that combines the advantages of algorithmic techniques with the benefits of user-controlled, interactive exploration in a novel manner and shows significant advantages over the three competing alternatives in 15 out of 24 possible parameter comparisons.
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.