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
Improving group recommendations via detecting comprehensive correlative information
Shanshan Feng,Jian Cao +1 more
TL;DR: The goal of the work in this paper is describing groups’ preferences better by comprehensively detecting the correlative information among users, groups, and items, in order to alleviate the data sparsity problem and improve the performance of group recommender systems.
Journal ArticleDOI
Lowering penalties related to stock-outs by shifting demand in product recommendation systems
Camélia Dadouchi,Bruno Agard +1 more
TL;DR: A method designed to consider actual stock levels in the recommendation process in order to shift demand toward specific products for a specific user is proposed.
Posted Content
Coupled Matrix Factorization within Non-IID Context
TL;DR: This paper proposes a novel generic coupled matrix factorization (CMF) model by incorporating non-IID coupling relations between users and items and demonstrates that the user/item couplings can be effectively applied in RS and CMF outperforms the benchmark methods.
Journal ArticleDOI
Using Opinion Mining in Context-Aware Recommender Systems: A Systematic Review
Camila Vaccari Sundermann,Marcos Aurélio Domingues,Roberta Akemi Sinoara,Ricardo Marcondes Marcacini,Solange Oliveira Rezende +4 more
TL;DR: A systematic review on the recommender systems that explore both contextual information and opinion mining, based on 17 papers selected among 195 papers identified in four digital libraries.
Patent
User class based media content recommendation methods and systems
TL;DR: In this paper, a media content recommendation system assigns a user of a Media Content Service to a user class included in a plurality of predefined user classes each associated with the media content service.
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.