Using the spanning tree of a criminal network for identifying its leaders

Date

2016-10-26

Supervisor/s

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE

Department

Type

Article

ISSN

Format

Free to read from

Citation

Taha K, Yoo PD. Using the spanning tree of a criminal network for identifying its leaders. IEEE Transactions on Information Forensics and Security, Volume 12, Issue 2, 2017, pp. 445-453

Abstract

We introduce a forensic analysis system called ECLfinder that identifies the influential members of a criminal organization as well as the immediate leaders of a given list of lower-level criminals. Criminal investigators usually seek to identify the influential members of criminal organizations, because eliminating them is most likely to hinder and disrupt the operations of these organizations and put them out of business. First, ECLfinder constructs a network representing a criminal organization from either mobile communication data associated with the organization or crime incident reports that include information about the organization. It then constructs a minimum spanning tree (MST) of the network. It identifies the influential members of a criminal organization by determining the important vertices in the network representing the organization, using the concept of existence dependence. Each vertex v is assigned a score, which is the number of other vertices, whose existence in MST is dependent on v. Vertices are ranked based on their scores. Criminals represented by the top ranked vertices are considered the influential members of the criminal organization represented by the network. We evaluated the quality of ECLfinder by comparing it experimentally with three other systems. Results showed marked improvement.

Description

Software Description

Software Language

Github

Keywords

DOI

Rights

Attribution-NonCommercial 4.0 International

Relationships

Relationships

Supplements

Funder/s