Efficient Solution of the Correlation Clustering Problem: An Application to Structural Balance

One challenge for social network researchers is to evaluate balance in a social network. The degree of balance in a social group can be used as a tool to study whether and how this group evolves to a possible balanced state. The solution of clustering problems defined on signed graphs can be used as a criterion to measure the degree of balance in social networks. By considering the original definition of the structural balance, the optimal solution of the Correlation Clustering (CC) Problem arises as one possible measure. In this work, we contribute to the efficient solution of the CC problem by developing sequential and parallel GRASP metaheuristics. Then, by using our GRASP algorithms, we solve the problem of measuring the structural balance of large social networks.

[1]  Shingo Takahashi,et al.  On conditions for a meeting not to reach a deadlock , 1998 .

[2]  Aravind Srinivasan,et al.  Local balancing influences global structure in social networks , 2011, Proceedings of the National Academy of Sciences.

[3]  Rolf Niedermeier,et al.  Separator-based data reduction for signed graph balancing , 2010, J. Comb. Optim..

[4]  F. Heider.  Attitudes and cognitive organization. , 1946, The Journal of psychology.

[5]  Leonidas S. Pitsoulis,et al.  Community detection by modularity maximization using GRASP with path relinking , 2013, Comput. Oper. Res..

[6]  Nalan Gülpinar,et al.  Extracting pure network submatrices in linear programs using signed graphs , 2004, Discret. Appl. Math..

[7]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[8]  Mason A. Porter,et al.  Community Structure in the United Nations General Assembly , 2010, ArXiv.

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

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

[11]  Zhenya Zhang,et al.  Correlation clustering based on genetic algorithm for documents clustering , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[12]  André Carlos Ponce de Leon Ferreira de Carvalho,et al.  Investigation of a new GRASP-based clustering algorithm applied to biological data , 2010, Comput. Oper. Res..

[13]  V. Traag,et al.  Community detection in networks with positive and negative links. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Rosa Figueiredo,et al.  The maximum balanced subgraph of a signed graph: Applications and solution approaches , 2014, Eur. J. Oper. Res..

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

[16]  Peter Abell,et al.  Structural Balance: A Dynamic Perspective , 2009 .

[17]  Michael A. Trick,et al.  Cliques and clustering: A combinatorial approach , 1998, Oper. Res. Lett..

[18]  Patrick Doreian,et al.  Partitioning signed social networks , 2009, Soc. Networks.

[19]  Nikhil Bansal,et al.  Correlation Clustering , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[20]  M. Brusco.  An enhanced branch-and-bound algorithm for a partitioning problem. , 2003, The British journal of mathematical and statistical psychology.

[21]  Mauricio G. C. Resende,et al.  GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data , 2011, SEA.

[22]  Christian Bauckhage,et al.  The slashdot zoo: mining a social network with negative edges , 2009, WWW.

[23]  M. Elsner,et al.  Bounding and Comparing Methods for Correlation Clustering Beyond ILP , 2009, ILP 2009.

[24]  Amos Fiat,et al.  Correlation clustering in general weighted graphs , 2006, Theor. Comput. Sci..

[25]  Eduardo D. Sontag,et al.  Algorithmic and complexity results for decompositions of biological networks into monotone subsystems , 2007, Biosyst..

[26]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[27]  Rosa Figueiredo,et al.  Mixed integer programming formulations for clustering problems related to structural balance , 2013, Soc. Networks.

[28]  P. Doreian,et al.  A partitioning approach to structural balance , 1996 .

[29]  C. Altafini,et al.  Computing global structural balance in large-scale signed social networks , 2011, Proceedings of the National Academy of Sciences.