社交网络的隐私保护建议

Kamalkumar R. Macwan, Abdessamad Imine, M. Rusinowitch
{"title":"社交网络的隐私保护建议","authors":"Kamalkumar R. Macwan, Abdessamad Imine, M. Rusinowitch","doi":"10.1109/SNAMS58071.2022.10062760","DOIUrl":null,"url":null,"abstract":"Social recommendation is an advanced service of social networking platforms that is provided to their users. Social recommendation uses profiles and connections to generate personalized suggestions of contents, advertisements, people, pages, or interest groups. Since individual sensitive information is possibly involved in elaborating a recommendation, it may be inferred by an adversary in some situations. In this work, we design a differentially private setting to prevent social recommendations from disclosing sensitive information. Our recommendation system targets users of online social networks by leveraging their attributes and relationships. Unlike other approaches, we rely on both profile similarity and homophily properties. Therefore, our system estimates the frequency of friends who share some attribute values and applies non-negative matrix factorization to derive recommendations such as hobbies, movies, etc. We demonstrate the effectiveness of the proposed approach through experiments on real-world datasets and evaluation according to utility measures.","PeriodicalId":371668,"journal":{"name":"2022 Ninth International Conference on Social Networks Analysis, Management and Security (SNAMS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Privacy Preserving Recommendations for Social Networks\",\"authors\":\"Kamalkumar R. Macwan, Abdessamad Imine, M. Rusinowitch\",\"doi\":\"10.1109/SNAMS58071.2022.10062760\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Social recommendation is an advanced service of social networking platforms that is provided to their users. Social recommendation uses profiles and connections to generate personalized suggestions of contents, advertisements, people, pages, or interest groups. Since individual sensitive information is possibly involved in elaborating a recommendation, it may be inferred by an adversary in some situations. In this work, we design a differentially private setting to prevent social recommendations from disclosing sensitive information. Our recommendation system targets users of online social networks by leveraging their attributes and relationships. Unlike other approaches, we rely on both profile similarity and homophily properties. Therefore, our system estimates the frequency of friends who share some attribute values and applies non-negative matrix factorization to derive recommendations such as hobbies, movies, etc. We demonstrate the effectiveness of the proposed approach through experiments on real-world datasets and evaluation according to utility measures.\",\"PeriodicalId\":371668,\"journal\":{\"name\":\"2022 Ninth International Conference on Social Networks Analysis, Management and Security (SNAMS)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 Ninth International Conference on Social Networks Analysis, Management and Security (SNAMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNAMS58071.2022.10062760\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Ninth International Conference on Social Networks Analysis, Management and Security (SNAMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNAMS58071.2022.10062760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

社交推荐是社交网络平台提供给用户的一项高级服务。社交推荐使用配置文件和连接来生成内容、广告、人员、页面或兴趣组的个性化建议。由于在制定建议时可能涉及到个人敏感信息,因此在某些情况下可能会被对手推断出来。在这项工作中,我们设计了一个不同的隐私设置,以防止社交推荐泄露敏感信息。我们的推荐系统通过利用他们的属性和关系来瞄准在线社交网络的用户。与其他方法不同的是,我们同时依赖于轮廓的相似性和同质性。因此,我们的系统估计共享某些属性值的朋友的频率,并应用非负矩阵分解来导出诸如爱好,电影等推荐。我们通过在真实世界数据集上的实验和根据效用度量的评估来证明所提出方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Privacy Preserving Recommendations for Social Networks
Social recommendation is an advanced service of social networking platforms that is provided to their users. Social recommendation uses profiles and connections to generate personalized suggestions of contents, advertisements, people, pages, or interest groups. Since individual sensitive information is possibly involved in elaborating a recommendation, it may be inferred by an adversary in some situations. In this work, we design a differentially private setting to prevent social recommendations from disclosing sensitive information. Our recommendation system targets users of online social networks by leveraging their attributes and relationships. Unlike other approaches, we rely on both profile similarity and homophily properties. Therefore, our system estimates the frequency of friends who share some attribute values and applies non-negative matrix factorization to derive recommendations such as hobbies, movies, etc. We demonstrate the effectiveness of the proposed approach through experiments on real-world datasets and evaluation according to utility measures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信