Criminal Community Detection Based on Isomorphic Subgraph Analytics

Abstract All highly centralised enterprises run by criminals do share similar traits, which, if recognised, can help in the criminal investigative process. While conducting a complex confederacy investigation, law enforcement agents should not only identify the key participants but also be able to grasp the nature of the inter-connections between the criminals to understand and determine the modus operandi of an illicit operation. We studied community detection in criminal networks using the graph theory and formally introduced an algorithm that opens a new perspective of community detection compared to the traditional methods used to model the relations between objects. Community structure, generally described as densely connected nodes and similar patterns of links is an important property of complex networks. Our method differs from the traditional method by allowing law enforcement agencies to be able to compare the detected communities and thereby be able to assume a different viewpoint of the criminal network, as presented in the paper we have compared our algorithm to the well-known Girvan-Newman. We consider this method as an alternative or an addition to the traditional community detection methods mentioned earlier, as the proposed algorithm allows, and will assists in, the detection of different patterns and structures of the same community for enforcement agencies and researches. This methodology on community detection has not been extensively researched. Hence, we have identified it as a research gap in this domain and decided to develop a new method of criminal community detection.

[1]  Trevor Darrell,et al.  Learning to Reason: End-to-End Module Networks for Visual Question Answering , 2017, 2017 IEEE International Conference on Computer Vision (ICCV).

[2]  Peter Vrancx,et al.  Game Theory and Multi-agent Reinforcement Learning , 2012, Reinforcement Learning.

[3]  Maoguo Gong,et al.  A survey on network community detection based on evolutionary computation , 2016, Int. J. Bio Inspired Comput..

[4]  Osmar R. Zaïane,et al.  Detecting Local Communities in Networks with Edge Uncertainty , 2018, 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[5]  E. Kwon,et al.  Oxidative Amidation of Nitroalkanes with Amine Nucleophiles using Molecular Oxygen and Iodine. , 2015, Angewandte Chemie.

[6]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[7]  P. Foggia,et al.  Performance evaluation of the VF graph matching algorithm , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[8]  Fatih Özgül,et al.  Combined Detection Model for Criminal Network Detection , 2010, PAISI.

[9]  Siddique Latif,et al.  Community detection in networks: A multidisciplinary review , 2018, J. Netw. Comput. Appl..

[10]  Fatih Özgül,et al.  Detecting criminal networks: SNA models are compared to proprietary models , 2012, 2012 IEEE International Conference on Intelligence and Security Informatics.

[11]  Mikel D. Petty,et al.  Reinforcement Learning in an Environment Synthetically Augmented with Digital Pheromones , 2014, Adv. Artif. Intell..

[12]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[13]  Gesine Reinert,et al.  Estimating the number of communities in a network , 2016, Physical review letters.

[14]  Carlo Piccardi,et al.  Uncovering the Structure of Criminal Organizations by Community Analysis: The Infinito Network , 2014, 2014 Tenth International Conference on Signal-Image Technology and Internet-Based Systems.

[15]  Mark E. J. Newman,et al.  Community detection in networks: Modularity optimization and maximum likelihood are equivalent , 2016, ArXiv.

[16]  Douglas C. Schmidt,et al.  A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices , 1976, J. ACM.

[17]  Damien Farine,et al.  The dynamics of transmission and the dynamics of networks. , 2017, The Journal of animal ecology.

[19]  Qiang Liu,et al.  Community Detection Based on Differential Evolution Using Modularity Density , 2018, Inf..

[20]  Nz Jhanjhi,et al.  Link Prediction in Time-Evolving Criminal Network With Deep Reinforcement Learning Technique , 2019, IEEE Access.

[21]  Azween B. Abdullah,et al.  Hidden Link Prediction in Criminal Networks Using the Deep Reinforcement Learning Technique , 2019, Comput..

[22]  Lixin Fu,et al.  OPTIMIZED BACKTRACKING FOR SUBGRAPH ISOMORPHISM , 2012 .

[23]  Boleslaw K. Szymanski,et al.  Community Detection with Edge Augmentation in Criminal Networks , 2018, 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[24]  Xiaodong Li,et al.  Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization , 2014, IEEE Transactions on Evolutionary Computation.

[25]  Azween Abdullah,et al.  Criminal Network Community Detection Using Graphical Analytic Methods: A Survey , 2018, EAI Endorsed Trans. Energy Web.

[26]  Daniel Bodemer,et al.  A review of methodological applications of social network analysis in computer-supported collaborative learning , 2017 .

[27]  Stephen A. Davis,et al.  Using shortest path to discover criminal community , 2015, Digit. Investig..

[28]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[29]  Nz Jhanjhi,et al.  Performance optimization of criminal network hidden link prediction model with deep reinforcement learning , 2019, J. King Saud Univ. Comput. Inf. Sci..

[30]  Alessia Saggese,et al.  Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3 , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[31]  Qiang Huang,et al.  Community Detection Using Cooperative Co-evolutionary Differential Evolution , 2012, PPSN.

[32]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[33]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.