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
Practical Privacy Preserving POI Recommendation
TL;DR: This article proposes a novel Privacy preserving POI Recommendation (PriRec) framework that keeps users’ private raw data and models in users' own hands, and protects user privacy to a large extent, and applies PriRec in real-world datasets, and comprehensive experiments demonstrate that it achieves comparable or even better recommendation accuracy.
Journal ArticleDOI
An Influence-Driven Feedback System for Preference Similarity Network Clustering Based Consensus Group Decision Making Model
TL;DR: A new influence-driven feedback mechanism procedure is introduced for a preference similarity network clustering based consensus reaching process and aims at identifying the network influencer for the generation of advices.
Journal ArticleDOI
Local Representative-Based Matrix Factorization for Cold-Start Recommendation
TL;DR: This work proposes a novel interview-based model to dynamically create meaningful user groups using decision trees and then select local representative items for different groups, and develops a joint optimization model, named local representative-based matrix factorization, for new user recommendations.
Journal ArticleDOI
A hybrid collaborative filtering model for social influence prediction in event-based social networks
TL;DR: A novel hybrid collaborative filtering prediction model which incorporates neighborhood methods into matrix factorization for social influence prediction in EBSNs is presented and an additional information based neighborhood discovery (AID) method to find reliable similar neighbors is proposed.
Journal ArticleDOI
Hybrid collaborative filtering for high-involvement products
TL;DR: A Review-based Hybrid CF (RHCF) is designed to overcome the rating sparsity problem of high-involvement products and develops techniques to predict missing ratings based on online reviews and product similarities.
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.