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
Trust-aware recommendation for improving aggregate diversity
TL;DR: This paper proposes a novel trust-aware recommendation method by incorporating time factor into similarity computation and demonstrates that the proposed method outperforms the baseline method in terms of aggregate diversity while maintaining almost the same recall.
Enhancing Recommender Systems Using Linked Open Data-Based Semantic Analysis of Items
TL;DR: This paper demonstrates how LOD can be a reliable and rich source of content information that supports recommender systems to overcome problems such as the item cold-start problem and limited content analysis that restrict many of the existing systems.
Journal ArticleDOI
DUSKG: A fine-grained knowledge graph for effective personalized service recommendation
TL;DR: This paper proposes an elegant, natural and compact data representation model incorporating such kinds of logical relations as knowledge graph, and proposes five personalized service recommendation methods presented in terms of such value preferences and various relations in DUSKG.
Proceedings ArticleDOI
Deep generative ranking for personalized recommendation
TL;DR: A deep generative ranking (DGR) model under the Wasserstein autoencoder framework is proposed and experimental results demonstrate that DGR consistently benefit the recommendation system in ranking estimation task, especially for the near-cold-start-users.
Journal ArticleDOI
Review and Analysis of Recommender Systems
TL;DR: This paper reviews recommender systems and presents their pros and cons.
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.