Inductive and transductive link prediction for criminal network analysis

被引:5
作者
Ahmadi, Zahra [1 ]
Nguyen, Hoang H. [1 ]
Zhang, Zijian [1 ]
Bozhkov, Dmytro [1 ]
Kudenko, Daniel [1 ]
Jofre, Maria [2 ]
Calderoni, Francesco [2 ]
Cohen, Noa [3 ]
Solewicz, Yosef [3 ]
机构
[1] Leibniz Univ Hannover, Res Ctr L3S, Hannover, Germany
[2] Univ Cattolica Sacro Cuore, Milan, Italy
[3] Minist Publ Secur, Israel Natl Police, Jerusalem, Israel
关键词
Co-offender prediction; Crime linkage; Repeat offenders; Transductive link prediction; Inductive link prediction; Deep neural networks; Machine learning; CRIME; MACHINE;
D O I
10.1016/j.jocs.2023.102063
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The identification of potential offenders, who are more likely to form a new group and co-offend in a crime, plays an essential role in narrowing down law enforcement investigations and improving predictive policing. Once a crime is committed, focusing on linking it to previously reported crimes and reducing the inspections based on shreds of evidence and the behavior of offenders can also greatly help law enforcement agencies. However, classical investigative techniques are generally case-specific and rely mainly on police officers manually combining information from different sources. Therefore, automatic methods designed to support co-offender research and crime linkage would be beneficial. This paper proposes two graph-based machine learning frameworks to address these issues based on a burglary use case, the first being transductive link prediction, which seeks to predict emergent links between existing graph nodes (which represent offenders or criminal cases), and the other being inductive link prediction, where connections are found between a new case and existing nodes. Our experimental results show a prediction accuracy of 68.5% in co-offender prediction, a 75.83% predictive accuracy for transductive crime linkage, and up to 74.8% accuracy in inductive crime linkage.
引用
收藏
页数:13
相关论文
共 76 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]  
[Anonymous], 2006, P SIAM DAT MIN WORKS
[3]  
[Anonymous], 2012, P 21 INT C WORLD WID, DOI [DOI 10.1145/2187980.2188150, 10.1145/2187980.2188150]
[4]  
Aponte R, 2022, Arxiv, DOI arXiv:2212.14077
[5]   Evolution of the social network of scientific collaborations [J].
Barabási, AL ;
Jeong, H ;
Néda, Z ;
Ravasz, E ;
Schubert, A ;
Vicsek, T .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2002, 311 (3-4) :590-614
[6]   COMPUTERIZED CRIME LINKAGE SYSTEMS A Critical Review and Research Agenda [J].
Bennell, Craig ;
Snook, Brent ;
Macdonald, Sarah ;
House, John C. ;
Taylor, Paul J. .
CRIMINAL JUSTICE AND BEHAVIOR, 2012, 39 (05) :620-634
[7]  
Bojchevski A., 2018, P INT C LEARNING REP
[8]  
Bowers K.J., 2004, W CRIMINOLOGY REV, V5, P3
[9]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[10]  
Campedelli GM, 2022, Machine Learning for Criminology and Crime Research: At the Crossroads, V1st