Yu Gu, Wentao Li, Liwen Zhang, Mingke Shen, B. Xie
{"title":"A Prioritization Algorithm for Crime Busting based on Centrality Analysis","authors":"Yu Gu, Wentao Li, Liwen Zhang, Mingke Shen, B. Xie","doi":"10.2991/EMEIT.2012.30","DOIUrl":null,"url":null,"abstract":"Detecting conspirators, which often relates to organized crimes, represents a major problem for many investigation bureaus. A prioritization algorithm based on centrality analysis was introduced. The correlation between suspects was modeled as a social network, and the degree, betweeness and eigenvector centralities were utilized to quantify the suspicion degree of individual conspirators. Due to the analysis, conspirators and non-conspirators were able to be sorted into high-suspected, low-suspected, low-unsuspected and high-unsuspected sections based on their likelihood of involving the conspiracy. A detailed scenario is studied and the efficacy of the given method is verified at the end of this paper.","PeriodicalId":211694,"journal":{"name":"Proceedings of the 2nd International Conference on Electronic and Mechanical Engineering and Information Technology (2012)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd International Conference on Electronic and Mechanical Engineering and Information Technology (2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2991/EMEIT.2012.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Detecting conspirators, which often relates to organized crimes, represents a major problem for many investigation bureaus. A prioritization algorithm based on centrality analysis was introduced. The correlation between suspects was modeled as a social network, and the degree, betweeness and eigenvector centralities were utilized to quantify the suspicion degree of individual conspirators. Due to the analysis, conspirators and non-conspirators were able to be sorted into high-suspected, low-suspected, low-unsuspected and high-unsuspected sections based on their likelihood of involving the conspiracy. A detailed scenario is studied and the efficacy of the given method is verified at the end of this paper.