Manipulation Robustness of Collaborative Filtering
From MaRDI portal
Abstract: A collaborative filtering system recommends to users products that similar users like. Collaborative filtering systems influence purchase decisions, and hence have become targets of manipulation by unscrupulous vendors. We provide theoretical and empirical results demonstrating that while common nearest neighbor algorithms, which are widely used in commercial systems, can be highly susceptible to manipulation, two classes of collaborative filtering algorithms which we refer to as linear and asymptotically linear are relatively robust. These results provide guidance for the design of future collaborative filtering systems.
Recommendations
Cited in
(7)- An evaluation of neighbourhood formation on the performance of collaborative filtering
- scientific article; zbMATH DE number 2209409 (Why is no real title available?)
- Shilling attack detection -- a new approach for a trustworthy recommender system
- Traffic channeling under uncertain conversion rates on e‐commerce platforms
- scientific article; zbMATH DE number 1945863 (Why is no real title available?)
- scientific article; zbMATH DE number 1946969 (Why is no real title available?)
- scientific article; zbMATH DE number 1931838 (Why is no real title available?)
This page was built for publication: Manipulation Robustness of Collaborative Filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3117324)
