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
An open framework for multi-source, cross-domain personalisation with semantic interest graphs
TL;DR: This novel framework includes an architecture for privacy-enabled profile exchange, a distributed and domain-agnostic user model and a cross-domain recommendation algorithm that enables users to receive recommendations for a target domain based on any kind of previous interests.
Journal ArticleDOI
DataGenCARS: A generator of synthetic data for the evaluation of context-aware recommendation systems
TL;DR: DataGenCARS is presented, a complete Java-based synthetic dataset generator that can be used to obtain the required datasets for any type of scenario desired, allowing a high flexibility in the obtention of appropriate data that can been used to evaluate CARS.
Journal ArticleDOI
A Kernel Framework for Content-Based Artist Recommendation System in Music
TL;DR: Under the proposed framework of kernelized OPP (KOPP), the nonlinear relationship and, more importantly, efficiently fuse acoustic and symbolic features obtained from the artist recommended meta-data are derived.
Book ChapterDOI
A privacy-protecting architecture for collaborative filtering via forgery and suppression of ratings
TL;DR: This work proposes an architecture that protects user privacy in collaborative-filtering systems, in which users are profiled on the basis of their ratings, which capitalizes on the combination of two perturbative techniques, namely the forgery and the suppression of ratings.
Journal ArticleDOI
Semi-External Memory Sparse Matrix Multiplication for Billion-Node Graphs
TL;DR: This work applies sparse matrix dense matrix multiplication (SpMM) in a semi-external memory (SEM) fashion to three important data analysis tasks—PageRank, eigensolving, and non-negative matrix factorization—and shows that the SEM implementations significantly advance the state of the art.
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.