• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Detecting Malicious Social Robots with Generative Adversarial Networks


Abstract

Malicious social robots, which are disseminators of malicious information on social networks, seriously affect information security and network environments. The detection of malicious social robots is a hot topic and a significant concern for researchers. A method based on classification has been widely used for social robot detection. However, this method of classification is limited by an unbalanced data set in which legitimate, negative samples outnumber malicious robots (positive samples), which leads to unsatisfactory detection results. This paper proposes the use of generative adversarial networks (GANs) to extend the unbalanced data sets before training classifiers to improve the detection of social robots. Five popular oversampling algorithms were compared in the experiments, and the effects of imbalance degree and the expansion ratio of the original data on oversampling were studied. The experimental results showed that the proposed method achieved better detection performance compared with other algorithms in terms of the F1 measure. The GAN method also performed well when the imbalance degree was smaller than 15%.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
B. Wu, L. Liu, Z. Dai, X. Wang and K. Zheng, "Detecting Malicious Social Robots with Generative Adversarial Networks," KSII Transactions on Internet and Information Systems, vol. 13, no. 11, pp. 5594-5515, 2019. DOI: 10.3837/tiis.2019.11.018.

[ACM Style]
Bin Wu, Le Liu, Zhengge Dai, Xiujuan Wang, and Kangfeng Zheng. 2019. Detecting Malicious Social Robots with Generative Adversarial Networks. KSII Transactions on Internet and Information Systems, 13, 11, (2019), 5594-5515. DOI: 10.3837/tiis.2019.11.018.