BFF: A tool for eliciting tie strength and user communities in social networking services

The use of social networking services (SNSs) such as Facebook has explosively grown in the last few years. Users see these SNSs as useful tools to find friends and interact with them. Moreover, SNSs allow their users to share photos, videos, and express their thoughts and feelings. However, users are usually concerned about their privacy when using SNSs. This is because the public image of a subject can be affected by photos or comments posted on a social network. In this way, recent studies demonstrate that users are demanding better mechanisms to protect their privacy. An appropriate approximation to solve this could be a privacy assistant software agent that automatically suggests a privacy policy for any item to be shared on a SNS. The first step for developing such an agent is to be able to elicit meaningful information that can lead to accurate privacy policy predictions. In particular, the information needed is user communities and the strength of users’ relationships, which, as suggested by recent empirical evidence, are the most important factors that drive disclosure in SNSs. Given the number of friends that users can have and the number of communities they may be involved on, it is infeasible that users are able to provide this information without the whole eliciting process becoming confusing and time consuming. In this work, we present a tool called Best Friend Forever (BFF) that automatically classifies the friends of a user in communities and assigns a value to the strength of the relationship ties to each one. We also present an experimental evaluation involving 38 subjects that showed that BFF can significantly alleviate the burden of eliciting communities and relationship strength.

[1]  Jennifer Neville,et al.  Modeling relationship strength in online social networks , 2010, WWW '10.

[2]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[3]  Eric Gilbert,et al.  Predicting tie strength with social media , 2009, CHI.

[4]  N. Lin,et al.  Social Resources and Strength of Ties: Structural Factors in Occupational Status Attainment , 1981, Social Capital, Social Support and Stratification.

[5]  Xiaokang Yang,et al.  A Hierarchical Diffusion Algorithm for Community Detection in Social Networks , 2010, 2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery.

[6]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[7]  Danah Boyd,et al.  Facebook privacy settings: Who cares? , 2010, First Monday.

[8]  Carles Sierra,et al.  The LOGIC negotiation model , 2007, AAMAS '07.

[9]  Heather Richter Lipford,et al.  Strategies and struggles with privacy in an online social networking community , 2008, BCS HCI.

[10]  Heather Richter Lipford,et al.  Understanding Privacy Settings in Facebook with an Audience View , 2008, UPSEC.

[11]  B. Wellman,et al.  Different Strokes from Different Folks: Community Ties and Social Support , 1990, American Journal of Sociology.

[12]  Steven M. Bellovin,et al.  Facebook and privacy: it's complicated , 2012, SOUPS.

[13]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[14]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[15]  Kristen LeFevre,et al.  Privacy wizards for social networking sites , 2010, WWW '10.

[16]  Jennifer Neville,et al.  Using Transactional Information to Predict Link Strength in Online Social Networks , 2009, ICWSM.

[17]  Mehmet A. Orgun,et al.  Optimal Social Trust Path Selection in Complex Social Networks , 2010, AAAI.

[18]  Cliff Lampe,et al.  The Benefits of Facebook "Friends: " Social Capital and College Students' Use of Online Social Network Sites , 2007, J. Comput. Mediat. Commun..

[19]  Andrew McCallum,et al.  Extracting social networks and contact information from email and the Web , 2004, CEAS.

[20]  Sharma Gajendra,et al.  Communication in virtual world: Second life and business opportunities , 2013, Inf. Syst. Frontiers.

[21]  Munindar P. Singh,et al.  Platys Social: Relating Shared Places and Private Social Circles , 2012, IEEE Internet Computing.

[22]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[23]  Jessica Staddon,et al.  Are privacy concerns a turn-off?: engagement and privacy in social networks , 2012, SOUPS.

[24]  John Zimmerman,et al.  Are you close with me? are you nearby?: investigating social groups, closeness, and willingness to share , 2011, UbiComp '11.

[25]  Alessandro Acquisti,et al.  Information revelation and privacy in online social networks , 2005, WPES '05.

[26]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[27]  K. Strater,et al.  Strategies and struggles with privacy in an online social networking community , 2008 .

[28]  Daniele Quercia,et al.  The personality of popular facebook users , 2012, CSCW.

[29]  Kôiti Hasida,et al.  POLYPHONET: an advanced social network extraction system from the web , 2006, WWW '06.

[30]  Mark S. Granovetter The Strength of Weak Ties , 1973, American Journal of Sociology.

[31]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.