One plus one makes three (for social networks).
Members of social network platforms often choose to reveal private information, and thus sacrifice some of their privacy, in exchange for the manifold opportunities and amenities offered by such platforms. In this article, we show that the seemingly innocuous combination of knowledge of confirmed co...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2012-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC3321038?pdf=render |
| _version_ | 1819052238718369792 |
|---|---|
| author | Emőke-Ágnes Horvát Michael Hanselmann Fred A Hamprecht Katharina A Zweig |
| author_facet | Emőke-Ágnes Horvát Michael Hanselmann Fred A Hamprecht Katharina A Zweig |
| author_sort | Emőke-Ágnes Horvát |
| collection | DOAJ |
| description | Members of social network platforms often choose to reveal private information, and thus sacrifice some of their privacy, in exchange for the manifold opportunities and amenities offered by such platforms. In this article, we show that the seemingly innocuous combination of knowledge of confirmed contacts between members on the one hand and their email contacts to non-members on the other hand provides enough information to deduce a substantial proportion of relationships between non-members. Using machine learning we achieve an area under the (receiver operating characteristic) curve (AUC) of at least 0.85 for predicting whether two non-members known by the same member are connected or not, even for conservative estimates of the overall proportion of members, and the proportion of members disclosing their contacts. |
| first_indexed | 2024-12-21T12:16:40Z |
| format | Article |
| id | doaj.art-e4d50d328fa6449cb411a68cdd091165 |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-12-21T12:16:40Z |
| publishDate | 2012-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-e4d50d328fa6449cb411a68cdd0911652022-12-21T19:04:26ZengPublic Library of Science (PLoS)PLoS ONE1932-62032012-01-0174e3474010.1371/journal.pone.0034740One plus one makes three (for social networks).Emőke-Ágnes HorvátMichael HanselmannFred A HamprechtKatharina A ZweigMembers of social network platforms often choose to reveal private information, and thus sacrifice some of their privacy, in exchange for the manifold opportunities and amenities offered by such platforms. In this article, we show that the seemingly innocuous combination of knowledge of confirmed contacts between members on the one hand and their email contacts to non-members on the other hand provides enough information to deduce a substantial proportion of relationships between non-members. Using machine learning we achieve an area under the (receiver operating characteristic) curve (AUC) of at least 0.85 for predicting whether two non-members known by the same member are connected or not, even for conservative estimates of the overall proportion of members, and the proportion of members disclosing their contacts.http://europepmc.org/articles/PMC3321038?pdf=render |
| spellingShingle | Emőke-Ágnes Horvát Michael Hanselmann Fred A Hamprecht Katharina A Zweig One plus one makes three (for social networks). PLoS ONE |
| title | One plus one makes three (for social networks). |
| title_full | One plus one makes three (for social networks). |
| title_fullStr | One plus one makes three (for social networks). |
| title_full_unstemmed | One plus one makes three (for social networks). |
| title_short | One plus one makes three (for social networks). |
| title_sort | one plus one makes three for social networks |
| url | http://europepmc.org/articles/PMC3321038?pdf=render |
| work_keys_str_mv | AT emokeagneshorvat oneplusonemakesthreeforsocialnetworks AT michaelhanselmann oneplusonemakesthreeforsocialnetworks AT fredahamprecht oneplusonemakesthreeforsocialnetworks AT katharinaazweig oneplusonemakesthreeforsocialnetworks |