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
Learning concept graphs from online educational data
TL;DR: This paper addresses an open challenge in educational data mining, i.e., the problem of automatically mapping online courses from different providers onto a universal space of concepts, and predicting latent prerequisite dependencies among both concepts and courses, with a novel approach for inference within and across course-level and concept-level directed graphs.
Journal ArticleDOI
Identifying new business opportunities from competitor intelligence: An integrated use of patent and trademark databases
Mingook Lee,Sungjoo Lee +1 more
TL;DR: This study aims to analyze the position of technology-centered companies in complex market dynamics and discover new business opportunities from competitor intelligence by utilizing patent data as a representative proxy for a firm's technology, and trademark data as an information source for the firm's target goods and services.
Journal ArticleDOI
Estimating user behavior toward detecting anomalous ratings in rating systems
TL;DR: An unsupervised method to detect "shilling" attacks in CFRSs is proposed, which consists of three stages: an undirected user-user graph is constructed from original user profiles, and a graph mining method is employed to estimate the similarity between vertices for creating a reduced graph.
Proceedings Article
A boosting algorithm for item recommendation with implicit feedback
TL;DR: A boosting algorithm named AdaBPR (Adaptive Boosting Personalized Ranking) is proposed for top-N item recommendation using users' implicit feedback and demonstrates its effectiveness on three datasets compared with strong baseline algorithms.
Journal ArticleDOI
Neighbor Selection and Weighting in User-Based Collaborative Filtering: A Performance Prediction Approach
TL;DR: By measuring the predictive power of neighbor performance predictors, this article is able to anticipate which predictors are going to perform better in neighbor-scoring-powered versions of a user-based collaborative filtering algorithm.
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.