The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Understanding Terror Networks
Mining for offender group detection and story of a police operation
AusDM '07 Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70
Node Removal in Criminal Networks
EISIC '11 Proceedings of the 2011 European Intelligence and Security Informatics Conference
Practical algorithms for destabilizing terrorist networks
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Identifying Important Nodes in Weighted Covert Networks Using Generalized Centrality Measures
EISIC '12 Proceedings of the 2012 European Intelligence and Security Informatics Conference
Computational Analysis of Terrorist Groups: Lashkar-e-Taiba
Computational Analysis of Terrorist Groups: Lashkar-e-Taiba
Covertness Centrality in Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Hi-index | 0.00 |
This paper focuses primarily on the Person Successor Problem (PSP): when a terrorist is removed from a terrorist network, who is most likely to take his place? We leverage the solution to PSP to predict a new terrorist network after removal of a set of terrorists and to answer the question: which set of k (k 0) terrorists should be removed in order to minimize the lethality of the terrorist network? We propose a theoretical model to study these questions taking into account the fact that terrorists may have different individual capabilities. We develop an algorithm for PSP in which analysts can specify the conditions an individual needs to satisfy in order to replace another person. We test the correctness of our algorithm on a real-world partial network dataset for two terrorist groups: Al-Qaeda and Lashkar-e-Taiba where we have ground truth about who replaced who, as well as a synthetic dataset where experts estimate who replaced who. Building on the solution to PSP, we develop an algorithm to identify which set of k people to remove from a terrorist network to minimize the organization's efficiency (formalized as an objective function in some different ways).