首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:How to Hide One’s Relationships from Link Prediction Algorithms
  • 本地全文:下载
  • 作者:Marcin Waniek ; Kai Zhou ; Yevgeniy Vorobeychik
  • 期刊名称:Scientific Reports
  • 电子版ISSN:2045-2322
  • 出版年度:2019
  • 卷号:9
  • 期号:1
  • 页码:1-10
  • DOI:10.1038/s41598-019-48583-6
  • 出版社:Springer Nature
  • 摘要:Our private connections can be exposed by link prediction algorithms. To date, this threat has only been addressed from the perspective of a central authority, completely neglecting the possibility that members of the social network can themselves mitigate such threats. We fill this gap by studying how an individual can rewire her own network neighborhood to hide her sensitive relationships. We prove that the optimization problem faced by such an individual is NP-complete, meaning that any attempt to identify an optimal way to hide one's relationships is futile. Based on this, we shift our attention towards developing effective, albeit not optimal, heuristics that are readily-applicable by users of existing social media platforms to conceal any connections they deem sensitive. Our empirical evaluation reveals that it is more beneficial to focus on "unfriending" carefully-chosen individuals rather than befriending new ones. In fact, by avoiding communication with just 5 individuals, it is possible for one to hide some of her relationships in a massive, real-life telecommunication network, consisting of 829,725 phone calls between 248,763 individuals. Our analysis also shows that link prediction algorithms are more susceptible to manipulation in smaller and denser networks. Evaluating the error vs. attack tolerance of link prediction algorithms reveals that rewiring connections randomly may end up exposing one's sensitive relationships, highlighting the importance of the strategic aspect. In an age where personal relationships continue to leave digital traces, our results empower the general public to proactively protect their private relationships.
国家哲学社会科学文献中心版权所有