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
Proceedings ArticleDOI
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
TL;DR: In this paper, a novel online index called BE-index was proposed to compress butterflies into k-blooms (i.e., (2,k)-bicliques).
A Framework of a Personalized Location-based Traveler Recommendation System in Mobile Application
Wahidah Husain,Lam Yih Dih +1 more
TL;DR: The goal of this research is to propose a suitable recommendation method for use in a Personalized Location-based Traveler Recommender System (PLTRS) to provide personalized tourism information to its users.
Journal ArticleDOI
Therapy Decision Support Based on Recommender System Methods
Felix Gräßer,Stefanie Beckert,Denise Küster,Jochen Schmitt,Susanne Abraham,Hagen Malberg,Sebastian Zaunseder +6 more
TL;DR: The Collaborative Recommender proves to generate both better outcome predictions and recommendation quality and the Demographic-based Recommender performs worse on average but covers more consultations, both methods profit from a combination into an overall recommender system.
Book ChapterDOI
A Survey on Collaborative Filtering Based Recommendation System
TL;DR: This article provides an outline of recommender systems and explains in detail about the collaborative filtering, and discusses the hybrid extensions by merging spatial properties of the user with users personalized preferences (user-based collaborative filtering).
Proceedings ArticleDOI
Interact and Decide: Medley of Sub-Attention Networks for Effective Group Recommendation
TL;DR: This paper proposes Medley of Sub-Attention Networks (MoSAN), a new novel neural architecture for the group recommendation task that not only achieves state-of-the-art performance but also improves standard baselines by a considerable margin.
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.