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
Credibility score based multi-criteria recommender system
Shweta Gupta,Vibhor Kant +1 more
TL;DR: The experiment results on Yahoo! Movies and modified MovieLens dataset demonstrate the effectiveness of proposed credibility score based MCRS in terms of coverage, recall, precision, and f-measure.
Proceedings ArticleDOI
Movie recommendations based in explicit and implicit features extracted from the Filmtipset dataset
TL;DR: The experiments conducted by the Information Retrieval Group at the Universidad Autónoma de Madrid (Spain) in order to better recommend movies for the 2010 CAMRa Challenge edition have been described.
Journal ArticleDOI
The impact of consumer preferences on the accuracy of collaborative filtering recommender systems
TL;DR: The study shows that recommendation accuracy is significantly affected by the similarity and number of consumer types and the distribution of consumers, and develops a model-specific metric to measure the recommendation accuracy.
Dissertation
Temporal models in recommender systems: an exploratory study on different evaluation dimensions
Campos Soto,G Pedro +1 more
TL;DR: Findings show 1) the importance of establishing a common and rigorous evaluation scheme when different algorithms are to be compared and 2) the most suitable recommendation algorithm will depend on the particular task at hand and evaluation dimension of interest.
Proceedings Article
Cross-domain collaborative filtering via bilinear multilevel analysis
TL;DR: A novel CDCF model, the Bilinear Multilevel Analysis (BLMA), is proposed, which seamlessly introduces multilevel analysis theory to the most successful collaborative filtering method, matrix factorization (MF).
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.