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
Diversified Third-Party Library Prediction for Mobile App Development
TL;DR: Zhang et al. as mentioned in this paper employed Matrix Factorization (MF) approaches to make the predictions based on a total of 31,432 Android apps from Google Play and employed an adaptive weighting mechanism to neutralize the bias caused by the popularity of third-party libraries.
Proceedings ArticleDOI
Studying and Modeling the Connection between People's Preferences and Content Sharing
Amit Sharma,Dan Cosley +1 more
TL;DR: In this paper, the authors present a user study involving 87 pairs of Facebook users to understand how people make their sharing decisions, and they find that even when sharing to a specific individual, people's own preference for an item (individuation) dominates over the recipient's preferences (altruism).
Journal ArticleDOI
Identify trademark legal case precedents - Using machine learning to enable semantic analysis of judgments
TL;DR: This research uses the neural network language modeling (NNLM) approach to analyze and identify judgment documents of US trademark (TM) litigation cases as precedents of a given target case.
Journal ArticleDOI
Movie recommendation system using machine learning
F. Furtado,A. Singh +1 more
TL;DR: The aim is to reduce the human effort by suggesting movies based on the user’s interests by introducing a model combining both content-based and collaborative approach.
Journal Article
QoS Prediction forWeb Services Based on Similarity-Aware Slope One Collaborative Filtering
Chengying Mao,Jifu Chen +1 more
TL;DR: The results show that SASO algorithm exhibits better prediction precision than both basic Slope One and the well-known WsRec algorithm in most cases and has the strong ability of reducing the impact of noise data.
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.