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 reliability-based recommendation method to improve trust-aware recommender systems
Parham Moradi,Sajad Ahmadian +1 more
TL;DR: The proposed Reliability-based Trust-aware Collaborative Filtering method provides a dynamic mechanism to construct trust network of the users based on the proposed reliability measure to improve the reliability and also the accuracy of the predictions.
Journal ArticleDOI
Social network-based service recommendation with trust enhancement
TL;DR: A social network-based service recommendation method with trust enhancement known as RelevantTrustWalker, utilizing a matrix factorization method to assess the degree of trust between users in social network and an extended random walk algorithm to obtain recommendation results.
Journal ArticleDOI
An efficient recommendation generation using relevant Jaccard similarity
TL;DR: Two new simple but effective similarity models have been developed by considering all rating vectors of users to classify relevant neighborhoods and generate recommendations in a lower computation time by considering relevant Jaccard similarity.
Journal ArticleDOI
Recommendation system development for fashion retail e-commerce
Hyunwoo Hwangbo,Hyunwoo Hwangbo,Hyunwoo Hwangbo,Yang Sok Kim,Yang Sok Kim,Yang Sok Kim,Kyung Jin Cha,Kyung Jin Cha,Kyung Jin Cha +8 more
TL;DR: The experimental results show that the proposed K-RecSys system is superior in terms of product clicks and sales in the online shopping mall and its substitute recommendations are adopted more frequently than complementary recommendations.
Patent
Information processing device, information processing method, and program
Hirotaka Suzuki,Masato Ito +1 more
TL;DR: In this article, an information processing device including a display section configured to display a first object in a virtual three-dimensional space having a depth direction of a display screen, an operation part configured to acquire an operation for moving the first object on the display screen in accordance with the acquired operation, to execute, when a region of the first objects overlaps a first overlap determination region, a first process to one or both of thefirst and second objects, and to execute when the region of an object overlaps the second overlap determination regions, a second process to either the first or the second
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.