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
A Novel Interpolation-SVT Approach for Recovering Missing Low-Rank Air Quality Data
TL;DR: The proposed SVT and ISVT methods can effectively recover the missing air pollution data and outperform existing interpolation methods and data imputation techniques and improve air pollution estimation and prediction whenever the low-rank data types contain a lot of missing values and require data recovery.
Proceedings ArticleDOI
QoS-Aware Web Service Recommendation Using Collaborative Filtering with PGraph
TL;DR: This paper proposes a novel web service recommender model using collaborative filtering to improve the prediction of Quality-of-Services and extends the idea of optimized predicting order and design the Graph to describe the neighborhood.
Patent
Recommendation system using a transformed similarity matrix
Sheau Ng,Oliver Jojic,Amit Bagga,Hassan Sayyadi-Harikandehei,Sujoy Roy,Wei Yun Yau,Kongwah Wan +6 more
TL;DR: In this article, a similarity matrix used to generate content item recommendation lists is described, and the system may determine a weight (used to transform the similarity matrix) sufficient to place one or more content items on the recommendation list or at a particular position on recommendation list.
Book ChapterDOI
Context-Awareness in Location Based Services in the Big Data Era
TL;DR: This chapter provides a systematic review of current context-aware location-based service systems using big data by analysing the methodological and practical choices that their developers made during the main phases of the context awareness process.
Proceedings ArticleDOI
Browser-oriented universal cross-site recommendation and explanation based on user browsing logs
TL;DR: The problem of universal recommendation is proposed and formalized, the ability to provide heterogeneous cross-site recommendations may shed light on brand new and promising business models, and the online users in discovering items of interest from a wider scope are proposed.
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.