A COMPARATIVE STUDY FOR PRIVACY-AWARE RECOMMENDATION SYSTEMS

Yavuz Canbay, Anıl Utku
{"title":"A COMPARATIVE STUDY FOR PRIVACY-AWARE RECOMMENDATION SYSTEMS","authors":"Yavuz Canbay, Anıl Utku","doi":"10.54287/gujsa.1393692","DOIUrl":null,"url":null,"abstract":"Recommendation systems are sophisticated processes for information filtering designed to offer users tailored recommendations based on their preferences and interests. Users need help to choose between options as the amount of information on the web grows. As a result, it is critical to deliver personalized recommendations to consumers to promote user loyalty and satisfaction. Because recommender systems use sensitive user information such as ratings, comments, likes, and dislikes, this information can be leaked if no privacy measures are taken. As a result, we presented a comparison of privacy-aware recommendation systems in this paper. Two experiments are carried out. In the first experiment, we examined collaborative filtering algorithms on perturbed ratings and then compared hybrid, collaborative, and content-based algorithms on perturbed ratings in the second experiment. According to the results, the Singular Value Decomposition++ (SVDpp) algorithm presented the lowest Root Mean Square Error (RMSE) and Mean Absolute Error (MAE) values for epsilon 100, with 0.8889 and 0.6822, respectively. Furthermore, for epsilon 100, the hybrid filtering technique had the lowest RMSE and MAE rates of 0.90664 and 0.69813, respectively.","PeriodicalId":510341,"journal":{"name":"Gazi University Journal of Science Part A: Engineering and Innovation","volume":"358 5","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Gazi University Journal of Science Part A: Engineering and Innovation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54287/gujsa.1393692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recommendation systems are sophisticated processes for information filtering designed to offer users tailored recommendations based on their preferences and interests. Users need help to choose between options as the amount of information on the web grows. As a result, it is critical to deliver personalized recommendations to consumers to promote user loyalty and satisfaction. Because recommender systems use sensitive user information such as ratings, comments, likes, and dislikes, this information can be leaked if no privacy measures are taken. As a result, we presented a comparison of privacy-aware recommendation systems in this paper. Two experiments are carried out. In the first experiment, we examined collaborative filtering algorithms on perturbed ratings and then compared hybrid, collaborative, and content-based algorithms on perturbed ratings in the second experiment. According to the results, the Singular Value Decomposition++ (SVDpp) algorithm presented the lowest Root Mean Square Error (RMSE) and Mean Absolute Error (MAE) values for epsilon 100, with 0.8889 and 0.6822, respectively. Furthermore, for epsilon 100, the hybrid filtering technique had the lowest RMSE and MAE rates of 0.90664 and 0.69813, respectively.
隐私感知推荐系统的比较研究
推荐系统是一种复杂的信息过滤程序,旨在根据用户的偏好和兴趣为其提供量身定制的推荐。随着网络信息量的增长,用户需要帮助来选择不同的选项。因此,向消费者提供个性化推荐对提高用户忠诚度和满意度至关重要。由于推荐系统使用评分、评论、喜欢和不喜欢等敏感的用户信息,如果不采取隐私保护措施,这些信息就有可能泄露。因此,我们在本文中对隐私感知推荐系统进行了比较。我们进行了两项实验。在第一个实验中,我们考察了在扰动评分上的协同过滤算法,然后在第二个实验中比较了在扰动评分上的混合算法、协同算法和基于内容的算法。结果显示,奇异值分解++(SVDpp)算法在ε100 时的均方根误差(RMSE)和平均绝对误差(MAE)值最低,分别为 0.8889 和 0.6822。此外,对于ε100,混合滤波技术的 RMSE 和 MAE 最低,分别为 0.90664 和 0.69813。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书