Uncovering hidden alliances in organized crime networks with machine learning: from node similarity to graph neural networks

Oscar Contreras-Velasco (), Nathan P. Jones, Daniel Weisz Argomedo, John P. Sullivan and Chris Callaghan
Additional contact information
Oscar Contreras-Velasco: University of California
Nathan P. Jones: Sam Houston State University
Daniel Weisz Argomedo: University of California
John P. Sullivan: University of Southern California
Chris Callaghan: CSG Justice Center

Journal of Computational Social Science, 2025, vol. 8, issue 4, No 20, 25 pages

Abstract: Abstract Covert or dark networks, such as those formed by organized crime or illicit alliances, pose unique challenges for link prediction research due to their inherent secrecy and data incompleteness. In this study, we compare a suite of advanced methods for inferring missing links in covert networks, including classical node similarity indices, graph embedding approaches, and GNN-based methods. We evaluate them on two real-world datasets: the Lantia dataset (a 2021 network of alliances between criminal organizations) and the 2020 Bacrim dataset (an open dataset on alliances among Mexican criminal groups in 2020). Our experiments focus on how these algorithms handle missing or partially observed links, a common reality in covert networks. Performance is measured using Area Under the ROC Curve (AUC) and F1 scores. Although classical similarity measures and embedding algorithms offer meaningful predictions, GNN-based models, particularly the Graph Convolutional Network, consistently achieve near-perfect AUC and F1 scores. These results highlight that learning from the broader graph topology via GNNs can effectively uncover hidden ties in incomplete and inherently noisy covert network data. Our findings provide practical guidance for researchers, analysts, and policymakers looking to identify future or missing alliances in large, fragmented, and illicit networks.

Keywords: Artificial intelligence; Graph neural networks; Hidden ties; Organized crime; Link prediction; Dark networks (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s42001-025-00429-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcsosc:v:8:y:2025:i:4:d:10.1007_s42001-025-00429-0

Ordering information: This journal article can be ordered from
http://www.springer. ... iences/journal/42001

DOI: 10.1007/s42001-025-00429-0

Access Statistics for this article

Journal of Computational Social Science is currently edited by Takashi Kamihigashi

More articles in Journal of Computational Social Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().