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
Personalized Market Basket Prediction with Temporal Annotated Recurring Sequences
TL;DR: A deep experimentation shows that TARS are able to explain the customer purchase behavior, and that TBP outperforms the state-of-the-art competitors.
Proceedings ArticleDOI
Socially-Aware Venue Recommendation for Conference Participants
TL;DR: The proposed algorithm, Social Aware Recommendation of Venues and Environments (SARVE), computes the Pearson Correlation and social characteristic information of conference participants and is able to recommend presentation sessions of active participant presenters that may be of high interest to a particular participant.
Proceedings ArticleDOI
Online book recommendation system
TL;DR: A quick and intuitive book recommendation system that helps readers to find appropriate book to read next is proposed that is used in Internet shops to increase the profit.
Proceedings ArticleDOI
GASGD: stochastic gradient descent for distributed asynchronous matrix completion via graph partitioning.
Fabio Petroni,Leonardo Querzoni +1 more
TL;DR: GASGD is discussed, a distributed asynchronous variant of SGD for large-scale matrix completion that leverages data partitioning schemes based on graph partitioning techniques, exploits specific characteristics of the input data and introduces an explicit parameter to tune synchronization frequency among the computing nodes.
Proceedings ArticleDOI
BARS: Towards Open Benchmarking for Recommender Systems
Jieming Zhu,Kelong Mao,Quanyu Dai,LiangCai Su,Ronglin Ma,Jinyang Liu,Guohao Cai,Zhicheng Dou,Xi Xiao,Rui Zhang +9 more
TL;DR: This initiative project presents an initiative project aimed for open benchmarking for recommender systems, which sets up a standardized benchmarking pipeline for reproducible research, which integrates all the details about datasets, source code, hyper-parameter settings, running logs, and evaluation results.
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.