基于osn的隐私评分:作为潜在维度的共享数据粒度

IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS ACM Transactions on the Web Pub Date : 2023-06-17 DOI:https://dl.acm.org/doi/10.1145/3604909
Yasir Kilic, Ali Inan
{"title":"基于osn的隐私评分:作为潜在维度的共享数据粒度","authors":"Yasir Kilic, Ali Inan","doi":"https://dl.acm.org/doi/10.1145/3604909","DOIUrl":null,"url":null,"abstract":"<p>Privacy scoring aims at measuring the privacy violation risk of a user over an online social network (OSN) based on attribute values shared in the user’s OSN profile page and the user’s position in the network. Existing studies on privacy scoring rely on possibly biased or emotional survey data. In this study, we work with real-world data collected from the professional LinkedIn OSN and show that probabilistic scoring models derived from the item response theory (IRT) fit real-world data better than naive approaches. We also introduce the granularity of the data an OSN user shares on her profile as a latent dimension of the OSN privacy scoring problem. Incorporating data granularity into our model, we build the most comprehensive solution to the OSN privacy scoring problem. Extensive experimental evaluation of various scoring models indicate the effectiveness of the proposed solution.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 11","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Privacy Scoring Over OSNs: Shared Data Granularity as a Latent Dimension\",\"authors\":\"Yasir Kilic, Ali Inan\",\"doi\":\"https://dl.acm.org/doi/10.1145/3604909\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Privacy scoring aims at measuring the privacy violation risk of a user over an online social network (OSN) based on attribute values shared in the user’s OSN profile page and the user’s position in the network. Existing studies on privacy scoring rely on possibly biased or emotional survey data. In this study, we work with real-world data collected from the professional LinkedIn OSN and show that probabilistic scoring models derived from the item response theory (IRT) fit real-world data better than naive approaches. We also introduce the granularity of the data an OSN user shares on her profile as a latent dimension of the OSN privacy scoring problem. Incorporating data granularity into our model, we build the most comprehensive solution to the OSN privacy scoring problem. Extensive experimental evaluation of various scoring models indicate the effectiveness of the proposed solution.</p>\",\"PeriodicalId\":50940,\"journal\":{\"name\":\"ACM Transactions on the Web\",\"volume\":\"43 11\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2023-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on the Web\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/https://dl.acm.org/doi/10.1145/3604909\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on the Web","FirstCategoryId":"94","ListUrlMain":"https://doi.org/https://dl.acm.org/doi/10.1145/3604909","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

隐私评分是根据用户的OSN配置页面中共享的属性值和用户在网络中的位置,衡量用户在某个OSN (online social network)上隐私被侵犯的风险。现有的隐私评分研究依赖于可能有偏见或情绪化的调查数据。在本研究中,我们使用从专业LinkedIn OSN收集的真实世界数据,并表明从项目反应理论(IRT)衍生的概率评分模型比朴素方法更适合真实世界数据。我们还引入了OSN用户在其个人资料上共享的数据粒度,作为OSN隐私评分问题的潜在维度。将数据粒度整合到我们的模型中,我们构建了最全面的OSN隐私评分问题解决方案。各种评分模型的广泛实验评估表明了所提出的解决方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Privacy Scoring Over OSNs: Shared Data Granularity as a Latent Dimension

Privacy scoring aims at measuring the privacy violation risk of a user over an online social network (OSN) based on attribute values shared in the user’s OSN profile page and the user’s position in the network. Existing studies on privacy scoring rely on possibly biased or emotional survey data. In this study, we work with real-world data collected from the professional LinkedIn OSN and show that probabilistic scoring models derived from the item response theory (IRT) fit real-world data better than naive approaches. We also introduce the granularity of the data an OSN user shares on her profile as a latent dimension of the OSN privacy scoring problem. Incorporating data granularity into our model, we build the most comprehensive solution to the OSN privacy scoring problem. Extensive experimental evaluation of various scoring models indicate the effectiveness of the proposed solution.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on the Web
ACM Transactions on the Web 工程技术-计算机:软件工程
CiteScore
4.90
自引率
0.00%
发文量
26
审稿时长
7.5 months
期刊介绍: Transactions on the Web (TWEB) is a journal publishing refereed articles reporting the results of research on Web content, applications, use, and related enabling technologies. Topics in the scope of TWEB include but are not limited to the following: Browsers and Web Interfaces; Electronic Commerce; Electronic Publishing; Hypertext and Hypermedia; Semantic Web; Web Engineering; Web Services; and Service-Oriented Computing XML. In addition, papers addressing the intersection of the following broader technologies with the Web are also in scope: Accessibility; Business Services Education; Knowledge Management and Representation; Mobility and pervasive computing; Performance and scalability; Recommender systems; Searching, Indexing, Classification, Retrieval and Querying, Data Mining and Analysis; Security and Privacy; and User Interfaces. Papers discussing specific Web technologies, applications, content generation and management and use are within scope. Also, papers describing novel applications of the web as well as papers on the underlying technologies are welcome.
期刊最新文献
DCDIMB: Dynamic Community-based Diversified Influence Maximization using Bridge Nodes Know their Customers: An Empirical Study of Online Account Enumeration Attacks Learning Dynamic Multimodal Network Slot Concepts from the Web for Forecasting Environmental, Social and Governance Ratings MuLX-QA: Classifying Multi-Labels and Extracting Rationale Spans in Social Media Posts Heterogeneous Graph Neural Network with Personalized and Adaptive Diversity for News Recommendation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1