Efficiently Evolutionary Computation on the Weak Structural Imbalance of Large Scale Signed Networks

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With The symbolic network adds the emotional information of the relationship, that is, the “+” and “−” information of the edge, which greatly enhances the modeling ability and has wide application in many fields. Weak unbalance is an important indicator to measure the network tension. This paper starts from the weak structural equilibrium theorem, and integrates the work of predecessors, and proposes the weak unbalanced algorithm EAWSB based on evolutionary algorithm. Experiments on the large symbolic networks Epinions, Slashdot and WikiElections show the effectiveness and efficiency of the proposed method. In EAWSB, this paper proposes a compression-based indirect representation method, which effectively reduces the size of the genotype space, thus making the algorithm search more complete and easier to get better solutions.

Cite

CITATION STYLE

APA

Jiang, W., Jiang, Y., Chen, J., Wang, Y., & Xu, Y. (2019). Efficiently Evolutionary Computation on the Weak Structural Imbalance of Large Scale Signed Networks. In Communications in Computer and Information Science (Vol. 1042 CCIS, pp. 554–566). Springer. https://doi.org/10.1007/978-981-15-1377-0_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free