Abstract
Friend lists group contacts in a social networking site that are to be treated equally in some respect. We have developed a new approach for recommending friend lists, which can then be manually edited and merged by the user to create the final lists. Our approach finds both large networks of friends and smaller friend groups within this network by merging virtual friend cliques. We have identified new metrics for evaluating the user-effort required to process friend-list recommendations, and conducted user studies to evaluate our approach and determine if and how the recommended lists would be used. Our results show that (a) our approach identifies a large fraction of the friend lists of a user, and seeds these lists with hundreds of members, few of which are spurious, and (b) users say they would use the lists for access control, messaging, filling in friend details, and understanding the social structures to which they belong.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bacon, K and Dewan, P. (2009). Towards Automatic Recommendation of Friend Lists. TrustCol Workshop, IEEE.
Chang, J., J. Boyd-Graber, et al. (2009). Reading Tea Leaves: How Humans Interpret Topic Models. Proc. NIPS.
Clauset, A., M. E. J. Newman, et al. (2004). “Finding community structure in very large networks.” Physical Review E. 70(066111).
Dewan, P., E. Horvitz, J. Grudin. (2007). A “Thought Experiment” to Illustrate and Motivate Mixed-Initiative Access Control,. TustCol Workshop, IEEE.
Fisher, D. and P. Dourish (2004). Social and Temporal Structures in Everyday Collaboration. Proc. CHI.
Girvan, M. and M. E. Newman (2002). “Community structure in social and biological networks.” Proc. Natl. Acad. Sci.(99).
Hanneman, R. A. and M. Riddle (2005). Introduction to social network methods, http://faculty.ucr.edu/~hanneman/nettext/.
Hogan, B. (2010). "Pinwheel layout to highlight community structure." Journal of Social Structure.
Li, X., S. Tan, et al. (2005). "Interaction graph mining for protein complexes using local clique merging." Genome Inform 16(2). Naveh, B. Jgrapht, http://jgrapht.sourceforge.net.
Olson, J. S., J. Grudin, et al. (2005). Toward Understanding Preferences for Sharing and Privacy. Proc. CHI.
Palla, G., I. Derényi, et al. (2005). "Uncovering the overlapping community structure of complex networks in nature and society." Nature 435: 814–818.
Skeels, M. and J. Grudin (2009). When Social Networks Cross Boundaries: A Case Study of Workplace Use of Facebook and LinkedIn. Proc. Group.
Wakita, K. and T. Tsurumi (2007). Finding Community Structure in Mega-scale Social Networks. Proc. ACM WWW.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this paper
Cite this paper
Bacon, K., Dewan, P. (2011). Mixed-Initiative Friend-List Creation. In: Bødker, S., Bouvin, N., Wulf, V., Ciolfi, L., Lutters, W. (eds) ECSCW 2011: Proceedings of the 12th European Conference on Computer Supported Cooperative Work, 24-28 September 2011, Aarhus Denmark. Springer, London. https://doi.org/10.1007/978-0-85729-913-0_16
Download citation
DOI: https://doi.org/10.1007/978-0-85729-913-0_16
Published:
Publisher Name: Springer, London
Print ISBN: 978-0-85729-912-3
Online ISBN: 978-0-85729-913-0
eBook Packages: Computer ScienceComputer Science (R0)