Optimizing transformations of structural balance in signed networks with potential relationships

A signed network includes positive edges, negative edges and “0” edges, the last of which denote potential relationships. However, “0” edges are commonly ignored in transformations of unbalanced networks. In this paper, we take “0” edges into account and solve the optimization problem in a more comprehensive way. We transform the unbalanced network by not only changing signs of edges but also changing edges into potential. The experimental results show that our method can solve this problem efficiently, and that our solutions are cost-saving.