Forming Compatible Teams in Signed Networks

The problem of team formation in a social network asks for a set of individuals who not only have the required skills to perform a task but who can also communicate effectively with each other. Existing work assumes that all links in a social network are positive, that is, they indicate friendship or collaboration between individuals. However, it is often the case that the network is signed, that is, it contains both positive and negative links, corresponding to friend and foe relationships. Building on the concept of structural balance, we provide definitions of compatibility between pairs of users in a signed network, and algorithms for computing it. We then define the team formation problem in signed networks, where we ask for a compatible team of individuals that can perform a task with small communication cost. We show that the problem is NP-hard even when there are no communication cost constraints, and we provide heuristic algorithms for solving it. We present experimental results with real data to investigate the properties of the different compatibility definitions, and the effectiveness of our algorithms.

[1]  Ying Liu,et al.  Consensus and Polarization of Binary Opinions in Structurally Balanced Networks , 2016, IEEE Transactions on Computational Social Systems.

[2]  Aijun An,et al.  Discovering top-k teams of experts with/without a leader in social networks , 2011, CIKM '11.

[3]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[4]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[5]  Charu C. Aggarwal,et al.  A Survey of Signed Network Mining in Social Media , 2015, ACM Comput. Surv..

[6]  Jiming Liu,et al.  Community Mining from Signed Social Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[7]  Nagarajan Natarajan,et al.  Exploiting longer cycles for link prediction in signed networks , 2011, CIKM '11.

[8]  Luca Becchetti,et al.  Online team formation in social networks , 2012, WWW.

[9]  Cheng-Te Li,et al.  Team Formation for Generalized Tasks in Expertise Social Networks , 2010, 2010 IEEE Second International Conference on Social Computing.

[10]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

[11]  Theodoros Lappas,et al.  Finding a team of experts in social networks , 2009, KDD.

[12]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[13]  Yuejin Tan,et al.  The influence of structural balance and homophily/heterophobia on the adjustment of random complete signed networks , 2016, Soc. Networks.

[14]  J. Davis Structural Balance, Mechanical Solidarity, and Interpersonal Relations , 1963, American Journal of Sociology.

[15]  Lúcia Maria de A. Drummond,et al.  Efficient Solution of the Correlation Clustering Problem: An Application to Structural Balance , 2013, OTM Workshops.