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
Hybrid immunizing solution for job recommender system
Shaha Al-Otaibi,Mourad Ykhlef +1 more
TL;DR: The proposed approach aims to recommend the best chances of opening jobs to the applicant who searches for job by combining the artificial immune system (AIS), which has a powerful exploration capability in polynomial time, with the collaborative filtering, which can exploit the neighbors’ interests.
Journal ArticleDOI
News personalization for peace: how algorithmic recommendations can impact conflict coverage
TL;DR: In this paper, a conceptual framework for assessing what are the possibilities and pitfalls of using algorithmic systems of news personalization for constructive conflict coverage in the context of war reporting is presented.
Journal ArticleDOI
CAMO: A Collaborative Ranking Method for Content Based Recommendation.
TL;DR: This work proposes a recommender named CAMO 1, which employs a multi-layer content encoder for simultaneously capturing the semantic information of multitopic and word order and makes use of adversarial training to prevent the complex encoder from overfitting.
Proceedings ArticleDOI
A Context-Aware and User Behavior-Based Recommender System with Regarding Social Network Analysis
TL;DR: This paper presents a new context aware and behavior-based recommender system which utilizes social network analysis to enhance recommending results and considers multiple relations among users and use a multi-layer social network to make groups of preferences richer.
Journal ArticleDOI
FreeRec: an anonymous and distributed personalization architecture
TL;DR: FreeRec’s decentralized approach makes it independent of any entity wishing to collect personal data about users, and its onion-routing-like gossip-based overlay protocols effectively hide the association between users and their interest profiles without affecting the quality of personalization.
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.