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 Article
Recover Missing Sensor Data with Iterative Imputing Network.
Jingguang Zhou,Zili Huang +1 more
TL;DR: Li et al. as discussed by the authors proposed a novel Iterative Imputing Network (IIMN) to capture the latent complex temporal dynamics by summarizing each observation's context with a novel IIMN, thus significantly outperforming previous work on the benchmark Beijing air quality and meteorological dataset.
Journal ArticleDOI
Towards Ontological Approach on Trust-Aware Ambient Services
TL;DR: This paper proposes trust ontology-based framework for deriving personalized ontologies for individual users according to their preference, perspective, and purpose and proves that the proposed method is reliable with a case study on a social media for a particular domain (restaurant).
Journal ArticleDOI
Using the Big Data generated by the Smart Home to improve energy efficiency management
María Rodríguez Fernández,Adolfo Cortés García,Ignacio González Alonso,Eduardo Zalama Casanova +3 more
TL;DR: A system which, using different Machine Learning approaches to learn about the users’ consumption habits, is able to generate collaborative recommendations and consumption predictions that help the user to consume better, which will in turn improve the demand curve.
Proceedings ArticleDOI
A hybrid approach for recommendation system with added feedback component
V Kavinkumar,Rachamalla Rahul Reddy,Rohit Balasubramanian,M Sridhar,K. Sridharan,D Venkataraman +5 more
TL;DR: This work has built a dataset with multiple parameters based on a survey of the communities needs using potential blogs and created a recommendation system using user based and item based collaborative filtering, which has improvised the current system by providing better suggestions to customers.
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.