Friend Grouping Algorithms for Online Social Networks: Preference, Bias, and Implications

被引:0
作者
Eslami, Motahhare [1 ]
Aleyasen, Amirhossein [1 ]
Moghaddam, Roshanak Zilouchian [1 ]
Karahalios, Karrie [1 ]
机构
[1] Univ Illinois Urbana Champaing, Dept Comp Sci, Urbana, IL 61801 USA
来源
SOCIAL INFORMATICS, SOCINFO 2014 | 2014年 / 8851卷
关键词
Automated Grouping; Clustering Algorithms; Online Social Networks;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Managing friendship relationships in social media is challenging due to the growing number of people in online social networks (OSNs). To deal with this challenge, OSNs' users may rely on manually grouping friends with personally meaningful labels. However, manual grouping can become burdensome when users have to create multiple groups for various purposes such as privacy control, selective sharing, and filtering of content. More recently, recommendation-based grouping tools such as Facebook smart lists have been proposed to address this concern. In these tools, users must verify every single friend suggestion. This can hinder users' adoption when creating large content sharing groups. In this paper, we proposed an automated friend grouping tool that applies three clustering algorithms on a Facebook friendship network to create groups of friends. Our goal was to uncover which algorithms were better suited for social network groupings and how these algorithms could be integrated into a grouping interface. In a series of semi-structured interviews, we asked people to evaluate and modify the groupings created by each algorithm in our interface. We observed an overwhelming consensus among the participants in preferring this automated grouping approach to existing recommendation-based techniques such as Facebook smart lists. We also discovered that the automation created a significant bias in the final modified groups. Finally, we found that existing group scoring metrics do not translate well to OSN groupings-new metrics are needed. Based on these findings, we conclude with several design recommendations to improve automated friend grouping approaches in OSNs.
引用
收藏
页码:34 / 49
页数:16
相关论文
共 27 条
[1]  
Amershi S., 2012, P CHI 2002
[2]   A comparison of extrinsic clustering evaluation metrics based on formal constraints [J].
Amigo, Enrique ;
Gonzalo, Julio ;
Artiles, Javier ;
Verdejo, Felisa .
INFORMATION RETRIEVAL, 2009, 12 (04) :461-486
[3]  
[Anonymous], 2012, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI 12, DOI DOI 10.1145/2207676.2208552
[4]  
[Anonymous], P ACM SIGKDD WORKSH
[5]  
[Anonymous], 2000, GRAPH CLUSTERING FLO
[6]  
[Anonymous], CORR
[7]  
Bernstein MS, 2010, CHI2010: PROCEEDINGS OF THE 28TH ANNUAL CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, VOLS 1-4, P971
[8]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[9]   Evaluation of clustering algorithms for protein-protein interaction networks [J].
Brohee, Sylvain ;
van Helden, Jacques .
BMC BIOINFORMATICS, 2006, 7 (1)
[10]  
Carr A., 2010, FACEBOOKS NEW GROUPS