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
Mining affective text to improve social media item recommendation
TL;DR: A novel sentiment-aware social media recommendation framework, referred to as SA_OCCF, is developed and an ensemble learning-based method is proposed to classify sentiments from affective texts to improve recommendation performance.
Journal ArticleDOI
A personalized clustering-based and reliable trust-aware QoS prediction approach for cloud service recommendation in cloud manufacturing
Jian Liu,Youling Chen +1 more
TL;DR: A novel clustering-based and trust-aware approach is developed to make a more personalized QoS prediction and reliable cloud service recommendation for the active user in CMfg.
Journal ArticleDOI
Preference-based mining of top-K influential nodes in social networks
TL;DR: A two-stage mining algorithm to mine the most influential nodes in a network on a given topic, which shows that GAUP performs better than the state-of-the-art greedy algorithm, SVD-based collaborative filtering, and HITS.
Proceedings ArticleDOI
Probabilistic Group Recommendation Model for Crowdfunding Domains
TL;DR: A probabilistic recommendation model is proposed, called CrowdRec, that recommends Kickstarter projects to a group of investors by incorporating the on-going status of projects, the personal preference of individual members, and the collective preference of the group.
Proceedings ArticleDOI
Interacting Attention-gated Recurrent Networks for Recommendation
TL;DR: The Interacting Attention-gated Recurrent Network (IARN) is presented which adopts the attention model to measure the relevance of each time step of user and item interaction history and can selectively memorize different time steps of a user's history when predicting her preferences over different items.
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.