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
A survey on sentiment analysis methods and approach
A. M. Abirami,V. Gayathri +1 more
TL;DR: The survey is presented on various sentiment Analysis methodologies and approaches in detailed and the comparison is made between various paper's approach and issues addressed along with the metrics used.
Journal ArticleDOI
Game-theoretic rough sets for recommender systems
Nouman Azam,JingTao Yao +1 more
TL;DR: The game-theoretic rough set (GTRS) model is applied to obtain suitable values of these thresholds by implementing a game for determining a trade-off and balanced solution between accuracy and generality.
Journal ArticleDOI
A semantic similarity measure for linked data
TL;DR: This paper proposes a generalized information content-based approach that improves on previous methods which are typically restricted to specific knowledge representation models and less relevant in the context of Linked Data and can outperform comparable recommender systems that use conventional similarity measures.
Journal ArticleDOI
Alors: An algorithm recommender system
Mustafa Misir,Michèle Sebag +1 more
TL;DR: A main contribution of the proposed algorithm recommender Alors system is to handle the cold start problem – emitting recommendations for a new problem instance – through the non-linear modeling of the latent factors based on the initial instance representation, extending the linear approach proposed by Stern et al.
Journal ArticleDOI
A utility-based news recommendation system
TL;DR: It is argued that the proposed utility-based news recommendation system also addresses the news cold start problem which is one of the most challenging obstacles for news agencies.
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.