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
Predicting Drug–Target Interactions With Multi-Information Fusion
TL;DR: A semi-supervised based learning framework called NormMulInf is developed through collaborative filtering theory by using labeled and unlabeled interaction information to accurately classify and predict drug–target interactions.
Journal ArticleDOI
Addressing the cold-start problem in location recommendation using geo-social correlations
Huiji Gao,Jiliang Tang,Huan Liu +2 more
TL;DR: This work proposes to address the cold-start location recommendation problem by capturing the correlations between social networks and geographical distance on LBSNs with a geo- social correlation model, and demonstrates that this approach properly models the geo-social correlations of a user’s cold- Start check-ins and significantly improves the location recommendation performance.
Proceedings ArticleDOI
A sequential recommendation approach for interactive personalized story generation
Hong Yu,Mark O. Riedl +1 more
TL;DR: A Drama Manager that uses player modeling to personalize the user's story according to his or her storytelling preferences is presented and results show that the system is capable of capturing users' preference and generating personalized stories with high accuracy.
Proceedings ArticleDOI
Privacy-Preserving Personalized Recommendation: An Instance-Based Approach via Differential Privacy
Yilin Shen,Hongxia Jin +1 more
TL;DR: The first lightweight and provably private solution for personalized recommendation, under untrusted server settings, in this novel setting, users' private data is obfuscated before leaving their private devices, giving users greater control on their data and service providers less responsibility on privacy protections.
Journal ArticleDOI
Privacy-preserving distributed collaborative filtering
TL;DR: An extensive evaluation shows that the new mechanism to preserve privacy while leveraging user profiles in distributed recommender systems provides a good trade-off between privacy and accuracy, with little overhead and high resilience.
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.