Ranking the Importance Level of Intermediaries to a Criminal using a Reliance Measure

作者: Asha Rao , Stephen Davis , Pritheega Magalingam

DOI:

关键词:

摘要: Recent research on finding important intermediate nodes in a network suspected to contain criminal activity is highly dependent centrality values. Betweenness centrality, for example, widely used rank the that act as brokers shortest paths connecting all source and end network. However both path node betweenness linearly scaled can only show rankings In this paper we explore mathematical concept of pair-dependency nodes, adapting relationships introducing new source-intermediate reliance measure. To illustrate our measure, apply it Enron email dataset Noordin Top Terrorist networks. We compare ranking with Google PageRank, Markov well investigation using will lead different prioritisation terms possible people investigate. While terrorist yields more extreme differences than transaction network, latter values set finance managers immediately identified another employee convicted money laundering.

参考文章(54)
Dominik Schultes, Robert Geisberger, Peter Sanders, Better approximation of betweenness centrality algorithm engineering and experimentation. pp. 90- 100 ,(2008)
Alireza Farasat, Geoff Gross, Rakesh Nagi, Alexander G. Nikolaev, Social Network Extraction and High Value Individual (HVI) Identification within Fused Intelligence Data Social Computing, Behavioral-Cultural Modeling, and Prediction. pp. 44- 54 ,(2015) , 10.1007/978-3-319-16268-3_5
Sean F. Everton, Disrupting Dark Networks ,(2013)
Barton Evan Schaefer, Gregory Steven Fox, Trusted Electronic Communications ,(2012)
Nele Verbiest, Chris Cornelis, Patricia Victor, Enrique Herrera-Viedma, Strategies for incorporating knowledge defects and path length in trust aggregation international conference industrial engineering other applications applied intelligent systems. ,vol. 6098, pp. 450- 459 ,(2010) , 10.1007/978-3-642-13033-5_46
Jac M. Anthonisse, The rush in a directed graph Journal of Computational Physics. pp. 1- 10 ,(1971)
Mark Newman, Networks: An Introduction ,(2010)
Petter Holme, Beom Jun Kim, Chang No Yoon, Seung Kee Han, None, Attack vulnerability of complex networks Physical Review E. ,vol. 65, pp. 056109- ,(2002) , 10.1103/PHYSREVE.65.056109