Detecting latent terrorist communities testing a gower’s similarity-based clustering algorithm for multi-partite networks

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

Abstract

Finding hidden patterns represents a key task in terrorism research. In light of this, the present work seeks to test an innovative clustering algorithm designed for multi-partite networks to find communities of terrorist groups active worldwide from 1997 to 2016. This algorithm uses Gower’s coefficient of similarity as the similarity measure to cluster perpetrators. Data include information on weapons, tactics, targets, and active regions. We show how different dimensional weighting schemes lead to different types of grouping, and we therefore concentrate on the outcomes of the unweighted algorithm to highlight interesting patterns naturally emerging from the data. We highlight that groups belonging to different ideologies actually share very common behaviors. Finally, future work directions are discussed.

Cite

CITATION STYLE

APA

Campedelli, G. M., Cruickshank, I., & Carley, K. M. (2019). Detecting latent terrorist communities testing a gower’s similarity-based clustering algorithm for multi-partite networks. In Studies in Computational Intelligence (Vol. 812, pp. 292–303). Springer Verlag. https://doi.org/10.1007/978-3-030-05411-3_24

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