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. © 2013 Springer-Verlag.
CITATION STYLE
Drummond, L., Figueiredo, R., Frota, Y., & Levorato, M. (2013). Efficient solution of the correlation clustering problem: An application to structural balance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8186 LNCS, pp. 674–683). https://doi.org/10.1007/978-3-642-41033-8_85
Mendeley helps you to discover research relevant for your work.