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
Posted Content
Privacy Preserving Point-of-interest Recommendation Using Decentralized Matrix Factorization
TL;DR: Experimental results on two real-world datasets demonstrate that the Decentralized MF (DMF) framework for POI recommendation significantly improvements the recommendation performance in terms of precision and recall.
Journal ArticleDOI
An algorithm for event detection based on social media data
TL;DR: The whole process for extracting data from Weibo is designed and an algorithm for the foodborne disease event detection is developed to assist the restaurant recommendation.
Proceedings ArticleDOI
Recommending scientific articles using bi-relational graph-based iterative RWR
Geng Tian,Liping Jing +1 more
TL;DR: An iterative random walk with restarts learning method is proposed on the Bi-Relational graph to recommend a researcher rating for each article by making use of the known information.
Journal ArticleDOI
Building a model-based personalised recommendation approach for tourist attractions from geotagged social media data
TL;DR: This work retrieved a geotagged photo collection from the public API for Flickr and fetched a large amount of other contextual information to rebuild a user's travel history and created a model-based recommendation method with a two-stage architecture that consists of candidate generation (the matching process) and candidate ranking.
Journal ArticleDOI
Personalized Long- and Short-term Preference Learning for Next POI Recommendation
TL;DR: Wang et al. as discussed by the authors proposed a novel method named Personalized Long and Short-term Preference Learning (PLSPL), which combines the long and short-term preference via user-based linear combination unit to learn the personalized weights on different parts for different 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.