Robustness of privacy-preserving collaborative recommenders against popularity bias problem
| dc.authorid | 0000-0003-3818-6712 | tr |
| dc.contributor.author | Gulsoy, Mert | |
| dc.contributor.author | Yalcin, Emre | |
| dc.contributor.author | Bilge, Alper | |
| dc.date.accessioned | 2024-02-29T08:55:30Z | |
| dc.date.available | 2024-02-29T08:55:30Z | |
| dc.date.issued | Temmuz, 2023 | tr |
| dc.department | Mühendislik Fakültesi | tr |
| dc.description.abstract | Recommender systems have become increasingly important in today’s digital age, but they are not without their challenges. One of the most significant challenges is that users are not always willing to share their preferences due to privacy concerns, yet they still require decent recommendations. Privacy-preserving collaborative recommenders remedy such concerns by letting users set their privacy preferences before submitting to the recommendation provider. Another recently discussed challenge is the problem of popularity bias, where the system tends to recommend popular items more often than less popular ones, limiting the diversity of recommendations and preventing users from discovering new and interesting items. In this article, we comprehensively analyze the randomized perturbation-based data disguising procedure of privacy-preserving collaborative recommender algorithms against the popularity bias problem. For this purpose, we construct user personas of varying privacy protection levels and scrutinize the performance of ten recommendation algorithms on these user personas regarding the accuracy and beyond-accuracy perspectives. We also investigate how well-known popularity-debiasing strategies combat the issue in privacy-preserving environments. In experiments, we employ three well-known real-world datasets. The key findings of our analysis reveal that privacy-sensitive users receive unbiased and fairer recommendations that are qualified in diversity, novelty, and catalogue coverage perspectives in exchange for tolerable sacrifice from accuracy. Also, prominent popularity-debiasing strategies fall considerably short as provided privacy level improves. | tr |
| dc.identifier.citation | Gulsoy, M., Yalcin, E., & Bilge, A. (2023). Robustness of privacy-preserving collaborative recommenders against popularity bias problem. PeerJ Computer Science, 9, e1438. | tr |
| dc.identifier.doi | 10.7717/peerj-cs.1438 | en_US |
| dc.identifier.endpage | e1438 | tr |
| dc.identifier.pmid | 37547423 | en_US |
| dc.identifier.scopus | 2-s2.0-85167867492 | en_US |
| dc.identifier.scopusquality | N/A | |
| dc.identifier.startpage | e1438 | tr |
| dc.identifier.uri | https://peerj.com/articles/cs-1438/ | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12418/14460 | |
| dc.identifier.volume | 9 | tr |
| dc.identifier.wos | WOS:001023857800001 | en_US |
| dc.identifier.wosquality | Q1 | |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.indekslendigikaynak | PubMed | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | PeerJ | tr |
| dc.relation.ispartof | PeerJ Computer Science | en_US |
| dc.relation.publicationcategory | Uluslararası Hakemli Dergide Makale - Kurum Öğretim Elemanı | tr |
| dc.relation.tubitak | 122E040 | |
| dc.rights | info:eu-repo/semantics/openAccess | tr |
| dc.subject | Recommender systems | tr |
| dc.subject | Popularity bias | tr |
| dc.subject | Privacy-preserving | tr |
| dc.subject | Collaborative filtering | tr |
| dc.subject | Unfairness | tr |
| dc.title | Robustness of privacy-preserving collaborative recommenders against popularity bias problem | en_US |
| dc.type | Article | en_US |
