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
Towards Implicit User Modeling Based on Artificial Intelligence, Cognitive Styles and Web Interaction Data
TL;DR: A Web-based tool is proposed, utilizing Artificial Intelligence techniques, to implicitly capture and find any possible relations between the cognitive styles of users and their characteristics in navigation behavior and content representation preference by using their Web interaction data.
Proceedings ArticleDOI
Demographic information prediction based on smartphone application usage
TL;DR: This paper proposes a novel approach to make efficient demographic prediction based on smartphone application usage by considering the category-unbalance problem, and proposes an optimization method to further smooth the obtained results with category neighbors and user neighbors.
Journal ArticleDOI
Improved low-rank matrix recovery method for predicting miRNA-disease association
TL;DR: Improved low-rank matrix recovery (ILRMR) for miRNA-disease association prediction is developed, a global method that can simultaneously prioritize potential association for all diseases and does not require negative samples.
Journal ArticleDOI
N-dimensional Markov random field prior for cold-start recommendation
TL;DR: This work proposes using an n-dimensional Markov random field as the prior of matrix factorization (called mrf-MF) and shows that it can effectively solve each of the three cold-start problems and outperforms several matrix factorsization based methods.
Book ChapterDOI
Recommender systems meeting security: From product recommendation to cyber-attack prediction
TL;DR: This paper presents a method that builds attack graphs using data supplied from the maritime supply chain infrastructure that identifies attack paths and shows how a recommendation method can be used to classify future cyber-attacks.
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.