Where are we? Using Scopus to map the literature at the intersection between artificial intelligence and research on crime

被引:14
作者
Campedelli, Gian Maria [1 ]
机构
[1] Univ Trento, Trento, Italy
来源
JOURNAL OF COMPUTATIONAL SOCIAL SCIENCE | 2021年 / 4卷 / 02期
关键词
Artificial intelligence; Criminology; Co-authorship networks; Machine learning; Social network analysis; Computational social science; COMPUTER-SCIENCE; CO-AUTHORSHIP; COLLABORATION; CLASSIFICATION; MANAGEMENT; NETWORKS; PATTERNS; JOURNALS; WEB;
D O I
10.1007/s42001-020-00082-9
中图分类号
O1 [数学]; C [社会科学总论];
学科分类号
03 ; 0303 ; 0701 ; 070101 ;
摘要
Research on artificial intelligence (AI) applications has spread over many scientific disciplines. Scientists have tested the power of intelligent algorithms developed to predict (or learn from) natural, physical and social phenomena. This also applies to crime-related research problems. Nonetheless, studies that map the current state of the art at the intersection between AI and crime are lacking. What are the current research trends in terms of topics in this area? What is the structure of scientific collaboration when considering works investigating criminal issues using machine learning, deep learning, and AI in general? What are the most active countries in this specific scientific sphere? Using data retrieved from the Scopus database, this work quantitatively analyzes 692 published works at the intersection between AI and crime employing network science to respond to these questions. Results show that researchers are mainly focusing on cyber-related criminal topics and that relevant themes such as algorithmic discrimination, fairness, and ethics are considerably overlooked. Furthermore, data highlight the extremely disconnected structure of co-authorship networks. Such disconnectedness may represent a substantial obstacle to a more solid community of scientists interested in these topics. Additionally, the graph of scientific collaboration indicates that countries that are more prone to engage in international partnerships are generally less central in the network. This means that scholars working in highly productive countries (e.g. the United States, China) tend to mostly collaborate domestically. Finally, current issues and future developments within this scientific area are also discussed.
引用
收藏
页码:503 / 530
页数:28
相关论文
共 78 条
[31]   Towards a Critical Race Methodology in Algorithmic Fairness [J].
Hanna, Alex ;
Denton, Emily ;
Smart, Andrew ;
Smith-Loud, Jamila .
FAT* '20: PROCEEDINGS OF THE 2020 CONFERENCE ON FAIRNESS, ACCOUNTABILITY, AND TRANSPARENCY, 2020, :501-512
[32]  
Helbing D., 2019, Will democracy survive big data and artificial intelligence?, P73, DOI 10.1007/978
[33]   Structure and patterns of cross-national Big Data research collaborations [J].
Hu, Jiming ;
Zhang, Yin .
JOURNAL OF DOCUMENTATION, 2017, 73 (06) :1119-1136
[34]   DeepCrime: Attentive Hierarchical Recurrent Networks for Crime Prediction [J].
Huang, Chao ;
Zhang, Junbo ;
Zheng, Yu ;
Chawla, Nitesh V. .
CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, :1423-1432
[35]  
Huang J., 2008, PROC INT C WEB SEARC, P107
[36]   Deep Architecture for Traffic Flow Prediction: Deep Belief Networks With Multitask Learning [J].
Huang, Wenhao ;
Song, Guojie ;
Hong, Haikun ;
Xie, Kunqing .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2014, 15 (05) :2191-2201
[37]   Combining satellite imagery and machine learning to predict poverty [J].
Jean, Neal ;
Burke, Marshall ;
Xie, Michael ;
Davis, W. Matthew ;
Lobell, David B. ;
Ermon, Stefano .
SCIENCE, 2016, 353 (6301) :790-794
[38]  
Johnson J.B., 2019, Political Science Research Methods
[39]   Deep learning in agriculture: A survey [J].
Kamilaris, Andreas ;
Prenafeta-Boldu, Francesc X. .
COMPUTERS AND ELECTRONICS IN AGRICULTURE, 2018, 147 :70-90
[40]   Mapping of nanoscience and nanotechnology research in India: a scientometric analysis, 1990-2009 [J].
Karpagam, R. ;
Gopalakrishnan, S. ;
Natarajan, M. ;
Babu, B. Ramesh .
SCIENTOMETRICS, 2011, 89 (02) :501-522