Robust collaborative filtering

@inproceedings{Mehta2007RobustCF,
  title={Robust collaborative filtering},
  author={B. Mehta and Thomas Hofmann and W. Nejdl},
  booktitle={RecSys '07},
  year={2007}
}
The widespread deployment of recommender systems has lead to user feedback of varying quality. While some users faithfully express their true opinion, many provide noisy ratings which can be detrimental to the quality of the generated recommendations. The presence of noise can violate modeling assumptions and may thus lead to instabilities in estimation and prediction. Even worse, malicious users can deliberately insert attack profiles in an attempt to bias the recommender system to their… Expand
Attack resistant collaborative filtering
TLDR
A new collaborative algorithm based on SVD which is accurate as well as highly stable to shilling, and combines it with SVD based-CF is described, which offers significant improvement over previous Robust Collaborative Filtering frameworks. Expand
A Survey of Attack-Resistant Collaborative Filtering Algorithms
TLDR
Previous approaches to robust collaborative filtering are reviewed and promising recent approaches that exploit a Singular Value Decomposition (SVD) and are both accurate as well as highly stable to shilling are described. Expand
Robust Model-Based Reliability Approach to Tackle Shilling Attacks in Collaborative Filtering Recommender Systems
TLDR
This paper proposes an innovative robust method, based on matrix factorization, to neutralize the shilling attacks, and openly provides more than 13 000 individual experiments involving a wide range of attack strategies, both push, and nuke, in order to test the proposed approach. Expand
Collaborative Filtering with Noisy Ratings
TLDR
In NORMA, an adaptive weighting strategy is proposed to decrease the gradient updates of noisy ratings, so that the learned MA models will be less prone to the noisy ratings. Expand
Robust Collaborative Recommendation by Least Trimmed Squares Matrix Factorization
  • Zunping Cheng, N. Hurley
  • Computer Science
  • 2010 22nd IEEE International Conference on Tools with Artificial Intelligence
  • 2010
TLDR
A least trimmed squares basedMF (LTSMF) is proposed to help improve the robustness of the least squares based MF (LSMF) models, which are shown to be more robust than least squares and another popular robust method - M-estimator. Expand
Unsupervised strategies for shilling detection and robust collaborative filtering
  • B. Mehta, W. Nejdl
  • Computer Science
  • User Modeling and User-Adapted Interaction
  • 2008
TLDR
An in-depth analysis of shilling profiles is provided and new approaches to detect malicious collaborative filtering profiles are described, which exploit the similarity structure in shilling user profiles to separate them from normal user profiles using unsupervised dimensionality reduction. Expand
Robust recommendation algorithm using an iterative group-based reputation
TLDR
A robust collaborative recommendation algorithm that is based on users' reputations, which is determined based on their grouping behaviours, which has high recommendation accuracy and stronger robustness and does not destroy the user distribution of the original dataset. Expand
Robust collaborative filtering based on non-negative matrix factorization and R1-norm
TLDR
This paper introduces R1-norm and proposes an iterative optimization method of feature matrices based on the iterative updating algorithm of non-negative matrix factorization, which guarantees that the predicted ratings are accurate and non- negative. Expand
Recommending under Threat of Manipulation 7 April
  • 2013
Collaborative filtering accomplishes automated personalized content recommendation but by relying on anonymous user feedback is vulnerable to manipulation. Taking measures to improve robustness toExpand
A Unified Framework for Reputation Estimation in Online Rating Systems
TLDR
A unified framework for computing the reputation score of a user, given only users' ratings on items is proposed and it is shown that previously proposed reputation estimation methods can be captured as special cases of this framework. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
Unsupervised Shilling Detection for Collaborative Filtering
TLDR
The aim of this work is to explore simpler unsupervised alternatives which exploit the nature of shilling profiles, and can be easily plugged into collaborative filtering framework to add robustness. Expand
Model-Based Collaborative Filtering as a Defense against Profile Injection Attacks
TLDR
This paper considers two recommendation algorithms, one based on k-means clustering and the other based on Probabilistic Latent Semantic Analysis (PLSA), and shows that, particularly, the PLSA-based approach can achieve comparable recommendation accuracy. Expand
Detecting noise in recommender system databases
TLDR
A framework that enables the detection of noise in recommender system databases and devise techniques that enable system administrators to identify and remove from the recommendation process any such noise that is present in the data. Expand
Collaborative recommendation: A robustness analysis
TLDR
This work analyzes the robustness of collaborative recommendation: the ability to make recommendations despite (possibly intentional) noisy product ratings, and formalizes recommendation accuracy in machine learning terms and develops theoretically justified models of accuracy. Expand
Using singular value decomposition approximation for collaborative filtering
TLDR
A novel algorithm is presented that incorporates SVD approximation into the EM procedure to reduce the overall computational cost while maintaining accurate predictions, and a new framework for collaborating filtering in distributed recommendation systems that allows users to maintain their own rating profiles for privacy is proposed. Expand
Preventing shilling attacks in online recommender systems
TLDR
Several metrics for analyzing rating patterns of malicious users are proposed and an algorithm for protecting recommender systems against shilling attacks is evaluated that can be employed for monitoring user ratings and removing shilling attacker profiles from the process of computing recommendations, thus maintaining the high quality of the recommendations. Expand
Lies and propaganda: detecting spam users in collaborative filtering
TLDR
This work provides a simple unsupervised algorithm, which exploits statistical properties of effective spam profiles to provide a highly accurate and fast algorithm for detecting spam. Expand
Shilling recommender systems for fun and profit
TLDR
Four open questions are explored that may affect the effectiveness of shilling attacks on recommender systems: which recommender algorithm is being used, whether the application is producing recommendations or predictions, how detectable the attacks are by the operator of the system, and what the properties are of the items being attacked. Expand
Application of Dimensionality Reduction in Recommender System - A Case Study
TLDR
This paper presents two different experiments where one technology called Singular Value Decomposition (SVD) is explored to reduce the dimensionality of recommender system databases and suggests that SVD has the potential to meet many of the challenges ofRecommender systems, under certain conditions. Expand
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms
TLDR
An analysis framework is applied that divides the neighborhood-based prediction approach into three components and then examines variants of the key parameters in each component, and identifies the three components identified are similarity computation, neighbor selection, and rating combination. Expand
...
1
2
3
...