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
Journal ArticleDOI

An Edge Intelligence Empowered Recommender System Enabling Cultural Heritage Applications

TL;DR: A Big Data architecture supporting typical cultural heritage applications and a novel user-centered recommendation strategy for cultural items suggestion, exploiting jointly recommendation techniques and edge artificial intelligence facilities are presented.
Journal ArticleDOI

Exploration and prediction of interactions between methanotrophs and heterotrophs.

TL;DR: Modelling-based tools were shown to hold great promise in reducing the amount of data that needs to be generated when conducting large co-cultivation studies, suggesting strain-dependent methanotroph-heterotroph complementarity.
Journal ArticleDOI

Multi-Criteria Review-Based Recommender System–The State of the Art

TL;DR: This review focused on the multi-criteria review-based recommender system and explained the user reviews elements in detail and how these can be integrated into the RS to help develop their criteria to enhance the RSs performance.
Journal ArticleDOI

Explainable recommendation with fusion of aspect information

TL;DR: An Aspect-based Matrix Factorization model (AMF) is proposed, which is able to improve the accuracy of rating prediction by collaboratively decomposing the rating matrix with the auxiliary information extracted from aspects.
Book

Thinking Ahead - Essays on Big Data, Digital Revolution, and Participatory Market Society

Dirk Helbing
TL;DR: Thinking Ahead is a most stimulating and provocative set of essays on the ways in which big data and complexity science are changing their understanding of ourselves and their society, and potentially allowing us to manage their societies much better than the authors are currently able to do.
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)