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
Book ChapterDOI
Applications of Big Data
TL;DR: This chapter sees typical examples of how different businesses analyze their data and enhance their business objectives in the fields of financial services, retail, manufacturing, telecommunications, social media, and health care.
Proceedings ArticleDOI
Understanding and promoting micro-finance activities in Kiva.org
TL;DR: This work details its personalized loan recommendation system which is formulated as a supervised learning problem where it tries to predict how likely a given lender will fund a new loan, and points out several interesting phenomena on lenders' social behaviors in micro-finance activities.
Proceedings ArticleDOI
Recommender system based on Hierarchical Clustering algorithm Chameleon
Utkarsh Gupta,Nagamma Patil +1 more
TL;DR: In this work, an efficient technique for recommender system based on Hierarchical Clustering is proposed and it is compared with existing technique based on K-means clustering algorithm, demonstrating that Chameleon based Recommender system produces less error as compared to K-Means basedRecommender System.
Proceedings ArticleDOI
Learning to rank for hybrid recommendation
TL;DR: LRHR is proposed, the first attempt that adapts learning to rank to hybrid recommender systems and identifies a set of novel meta-level features for learning purposes, to generate recommendation lists of items for users.
Journal ArticleDOI
Mobile App Recommendation: An Involvement-Enhanced Approach
TL;DR: This work introduces a novel model that appropriately combines download and browsing behaviors to learn users’ overall interests in and involvement with apps, develops a new algorithm to infer the model’s parameters, and proposes an innovative mobile app recommendation strategy that combines users' overall interests and their current interests to recommend apps.
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.