%0 Journal Article %1 10.1371/journal.pone.0034740 %A Horvát, Emöke-Ágnes %A Hanselmann, Michael %A Hamprecht, Fred A. %A Zweig, Katharina A. %D 2012 %I Public Library of Science %J PLoS ONE %K privacy social_network %N 4 %P e34740 %R 10.1371/journal.pone.0034740 %T One Plus One Makes Three (for Social Networks) %U http://dx.doi.org/10.1371%2Fjournal.pone.0034740 %V 7 %X 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.

@article{10.1371/journal.pone.0034740, abstract = {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.}, added-at = {2012-05-04T19:40:05.000+0200}, author = {Horvát, Emöke-Ágnes and Hanselmann, Michael and Hamprecht, Fred A. and Zweig, Katharina A.}, biburl = {https://www.bibsonomy.org/bibtex/2d5f741b2660d3772e8e4504ebfbbbbc9/meneteqel}, description = {PLoS ONE: One Plus One Makes Three (for Social Networks)}, doi = {10.1371/journal.pone.0034740}, interhash = {16574904ad6d44fc0183bb3c4532c558}, intrahash = {d5f741b2660d3772e8e4504ebfbbbbc9}, journal = {PLoS ONE}, keywords = {privacy social_network}, month = {04}, number = 4, pages = {e34740}, publisher = {Public Library of Science}, timestamp = {2012-05-04T19:52:03.000+0200}, title = {One Plus One Makes Three (for Social Networks)}, url = {http://dx.doi.org/10.1371%2Fjournal.pone.0034740}, volume = 7, year = 2012 }