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 Article
Web credibility assessment: affecting factors and assessment techniques
TL;DR: A hybrid approach is presented for the conduct of credibility assessment using the different approaches available to measure accuracy, authority, aesthetics, professionalism, popularity, currency, impartiality and quality.
Journal ArticleDOI
Providing effective recommendations in discussion groups using a new hybrid recommender system based on implicit ratings and semantic similarity
TL;DR: A new recommender system is represented, which includes three parts, namely content-based, collaborative, and hybrid filtering parts, which uses the tagging features to provide more appropriate recommendations on discussion groups.
Journal ArticleDOI
Cluster searching strategies for collaborative recommendation systems
TL;DR: This research provides an efficient implementation of an individualistic strategy which initially clusters the users and then exploits the members within clusters, but not just the cluster representatives, during the recommendation generation stage by adapting a specifically tailored cluster-skipping inverted index structure.
Proceedings Article
Stability of matrix factorization for collaborative filtering
Yu-Xiang Wang,Huan Xu +1 more
TL;DR: The stability vis a vis adversarial noise of matrix factorization algorithm for matrix completion is studied and the prediction error of individual users based on the subspace stability is analyzed to solve the problem of collaborative filtering under manipulator attack.
Journal ArticleDOI
Data-Filtering System to Avoid Total Data Distortion in IoT Networking
TL;DR: Because the proposed system filters the malfunctioning data, the server can obtain accurate analysis results and reduce computing load, and the efficiency of the proposed data-filtering system is shown.
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.