Better Safe Than Sorry: an Adversarial Approach to improve Social Bot Detection

被引:29
作者
Cresci, Stefano [1 ]
Petrocchi, Marinella [1 ]
Spognardi, Angelo [2 ]
Tognazzi, Stefano [3 ]
机构
[1] IIT CNR, Pisa, Italy
[2] Sapienza Univ Rome, Dept Comp Sci, Rome, Italy
[3] IMT Sch Adv Studies, Lucca, Italy
来源
PROCEEDINGS OF THE 11TH ACM CONFERENCE ON WEB SCIENCE (WEBSCI'19) | 2019年
关键词
Social bots; online social networks security; adversarial classifier evasion; genetic algorithms; Twitter;
D O I
10.1145/3292522.3326030
中图分类号
C [社会科学总论];
学科分类号
03 ; 0303 ;
摘要
The arm race between spambots and spambot-detectors is made of several cycles (or generations): a new wave of spambots is created (and new spam is spread), new spambot filters are derived and old spambots mutate (or evolve) to new species. Recently, with the diffusion of the adversarial learning approach, a new practice is emerging: to manipulate on purpose target samples in order to make stronger detection models. Here, we manipulate generations of Twitter social bots, to obtain - and study - their possible future evolutions, with the aim of eventually deriving more effective detection techniques. In detail, we propose and experiment with a novel genetic algorithm for the synthesis of online accounts. The algorithm allows to create synthetic evolved versions of current state-of-the-art social bots. Results demonstrate that synthetic bots really escape current detection techniques. However, they give all the needed elements to improve such techniques, making possible a proactive approach for the design of social bot detection systems.
引用
收藏
页码:47 / 56
页数:10
相关论文
共 55 条
[1]   A generic statistical approach for spam detection in Online Social Networks [J].
Ahmed, Faraz ;
Abulaish, Muhammad .
COMPUTER COMMUNICATIONS, 2013, 36 (10-11) :1120-1129
[2]  
[Anonymous], 2011, P INT AAAI C WEB SOC
[3]  
[Anonymous], 1996, INTRO GENETIC ALGORI
[4]  
[Anonymous], 2012, KDD
[5]  
[Anonymous], 1997, ACM SIGACT NEWS
[6]  
[Anonymous], 2012, Proceedings of the International AAAI Conference on Web and Social Media, DOI DOI 10.1609/ICWSM.V6I1.14236
[7]   Linear Time Algorithms for Generalizations of the Longest Common Substring Problem [J].
Arnold, Michael ;
Ohlebusch, Enno .
ALGORITHMICA, 2011, 60 (04) :806-818
[8]   Hybrid Crowdsensing: A Novel Paradigm to Combine the Strengths of Opportunistic and Participatory Crowdsensing [J].
Avvenuti, Marco ;
Bellomo, Salvatore ;
Cresci, Stefano ;
La Polla, Mariantonietta N. ;
Tesconi, Maurizio .
WWW'17 COMPANION: PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2017, :1413-1421
[9]  
Bagci Hakan, 2015, DSAA
[10]  
Cai Chiyu, 2017, CIKM