scispace - formally typeset
Open AccessJournal ArticleDOI

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

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Clustering based online learning in recommender systems: A bandit approach

TL;DR: An algorithm that does exploration and exploitation in the context space and the item space separately, and develops an algorithm that combines clustering of the items with information aggregation in thecontext space, which significantly outperforms the existing algorithms in terms of regret.
Journal Article

Tourism Destination Recommender System for the Cold Start Problem

TL;DR: A tourism destination recommender system that employs opinion-mining technology to refine user preferences and item opinion reputations and is fused into a hybrid collaborative filtering method by combining user- and item-based collaborative filtering approaches.
Journal Article

Applying Web Usage Mining Techniques to Design Effective Web Recommendation Systems: A Case Study

TL;DR: An overview of the used concepts and techniques of WUM to design Web recommender systems is presented and it is shown that how WUM can be applied to Web server logs for discovering access patterns.
Book ChapterDOI

Proposed Approach for Book Recommendation Based on User k-NN

TL;DR: Training and testing models are designed to predict user ratings for new users and the predicted user ratings are used to propose three types of recommendations based on three different user attributes.
Proceedings ArticleDOI

Fine-Grained Deep Knowledge-Aware Network for News Recommendation with Self-Attention

TL;DR: This work introduces a novel self-attention based mechanism in news recommendation that outperforms better results than previous start-of-art recommendation models.
References
More filters
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.
Related Papers (5)