TY - GEN
T1 - Feasibility of structural network clustering for group-based privacy control in social networks
AU - Jones, Simon
AU - O'Neill, Eamonn
PY - 2010
Y1 - 2010
N2 - Users of social networking sites often want to manage the sharing of information and content with different groups of people based on their differing relationships. However, grouping contacts places a significant configuration burden on the user. Automated approaches to grouping may have the potential to reduce this burden, however, their use remains largely untested. We investigate people's rationales when grouping their contacts for the purpose of controlling their privacy, finding six criteria that they commonly considered. We assess an automated approach to grouping, based on a network clustering algorithm, whose performance may be analogous to the human's use of some of these criteria. We find that the similarity between the groups created by people and those created by the algorithm is correlated with the modularity of their network. We also demonstrate that the particular clustering algorithm, SCAN, which detects hubs and outliers within a network can be beneficial for identifying contacts who are hard to group or for whom privacy preferences are inconsistent with the rest of their group.
AB - Users of social networking sites often want to manage the sharing of information and content with different groups of people based on their differing relationships. However, grouping contacts places a significant configuration burden on the user. Automated approaches to grouping may have the potential to reduce this burden, however, their use remains largely untested. We investigate people's rationales when grouping their contacts for the purpose of controlling their privacy, finding six criteria that they commonly considered. We assess an automated approach to grouping, based on a network clustering algorithm, whose performance may be analogous to the human's use of some of these criteria. We find that the similarity between the groups created by people and those created by the algorithm is correlated with the modularity of their network. We also demonstrate that the particular clustering algorithm, SCAN, which detects hubs and outliers within a network can be beneficial for identifying contacts who are hard to group or for whom privacy preferences are inconsistent with the rest of their group.
UR - http://www.scopus.com/inward/record.url?scp=77956238232&partnerID=8YFLogxK
UR - http://dx.doi.org/10.1145/1837110.1837122
U2 - 10.1145/1837110.1837122
DO - 10.1145/1837110.1837122
M3 - Chapter in a published conference proceeding
SN - 9781450302647
T3 - ACM International Conference Proceeding Series
BT - SOUPS '10 Proceedings of the Sixth Symposium on Usable Privacy and Security
PB - Association for Computing Machinery
CY - New York
T2 - 6th Symposium on Usable Privacy and Security, SOUPS 2010, July 14, 2010 - July 16, 2010
Y2 - 1 January 2010
ER -