| Title: | Deep learning criminal networks |
|---|
| Authors: | ID Ribeiro, Haroldo V. (Author)
ID Lopes, Diego D. (Author)
ID Pessa, Arthur A. B. (Author)
ID Martins, Alvaro F. (Author)
ID Cunha, Bruno R. da (Author)
ID Gonçalves, Sebastián (Author)
ID Lenzi, Ervin K. (Author)
ID Hanley, Quentin S. (Author)
ID Perc, Matjaž (Author) |
|---|
| Files: |  RAZ_Ribeiro_Haroldo_V._2023.pdf (2,36 MB)
MD5: 05763565CCD8084CCC54F7A143395FCE
 https://doi.org/10.1016/j.chaos.2023.113579
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FNM - Faculty of Natural Sciences and Mathematics
|
|---|
| Abstract: | Recent advances in deep learning methods have enabled researchers to develop and apply algorithms for the analysis and modeling of complex networks. These advances have sparked a surge of interest at the interface between network science and machine learning. Despite this, the use of machine learning methods to investigate criminal networks remains surprisingly scarce. Here, we explore the potential of graph convolutional networks to learn patterns among networked criminals and to predict various properties of criminal networks. Using empirical data from political corruption, criminal police intelligence, and criminal financial networks, we develop a series of deep learning models based on the GraphSAGE framework that are able to recover missing criminal partnerships, distinguish among types of associations, predict the amount of money exchanged among criminal agents, and even anticipate partnerships and recidivism of criminals during the growth dynamics of corruption networks, all with impressive accuracy. Our deep learning models significantly outperform previous shallow learning approaches and produce high-quality embeddings for node and edge properties. Moreover, these models inherit all the advantages of the GraphSAGE framework, including the generalization to unseen nodes and scaling up to large graph structures. |
|---|
| Keywords: | organized crime, complexity, crime prediction, GraphSAGE |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Submitted for review: | 14.04.2023 |
|---|
| Article acceptance date: | 12.05.2023 |
|---|
| Publication date: | 29.05.2023 |
|---|
| Publisher: | Elsevier |
|---|
| Year of publishing: | 2023 |
|---|
| Number of pages: | 11 str. |
|---|
| Numbering: | Vol. 172, [article no.] 113579 |
|---|
| PID: | 20.500.12556/DKUM-88185  |
|---|
| UDC: | 53 |
|---|
| ISSN on article: | 0960-0779 |
|---|
| COBISS.SI-ID: | 153996291 |
|---|
| DOI: | 10.1016/j.chaos.2023.113579 |
|---|
| Publication date in DKUM: | 20.06.2024 |
|---|
| Views: | 215 |
|---|
| Downloads: | 4 |
|---|
| Metadata: |     |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
