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

A Recommendation System Based on Hierarchical Clustering of an Article-Level Citation Network

TL;DR: This paper introduces EigenfactorRecommends - a citation-based method for improving scholarly navigation that uses the hierarchical structure of scientific knowledge, making possible multiple scales of relevance for different users.
Journal ArticleDOI

A semantic enhanced hybrid recommendation approach

TL;DR: The effectiveness of utilizing semantic knowledge of items to enhance the recommendation quality is presented and a new Inferential Ontology-based Semantic Similarity (IOBSS) measure is proposed to evaluate semantic similarity between items in a specific domain of interest.
Book ChapterDOI

An Introduction to Recommender Systems

TL;DR: The increasing importance of the Web as a medium for electronic and business transactions has served as a driving force for the development of recommender systems technology and the ease with which the Web enables users to provide feedback about their likes or dislikes.
Journal ArticleDOI

Chemically intuited, large-scale screening of MOFs by machine learning techniques

TL;DR: Froudakis et al. as mentioned in this paper used a machine learning approach to predict the H2/CO2 adsorption properties of metal-organic frameworks (MOFs), highly porous materials promising for catalysis and gas storage.
Journal ArticleDOI

An effective trust-based recommendation method using a novel graph clustering algorithm

TL;DR: A model-based collaborative filtering method by applying a novel graph clustering algorithm and also considering trust statements is presented, demonstrating that the proposed method outperforms several state-of-the-art recommender system methods.
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)