Identifying Important Nodes in Weighted Covert Networks Using Generalized Centrality Measures

Abstract

For investigators working on criminal covert networks, identification of key actor(s) in the network is a major objective. Taking out key nodes will decrease the ability of the criminal network to function normally. Traditionally, the node centrality measurements have relied solely on the number of edges incident to nodes but not on the weights of those edges. However, in some generalizations for centrality measures for weighted networks, the focus shifts solely to the weights of the links and they don't account for the number of ties which was the central idea in the original centrality measures. Hence, answering which nodes are most central in a network with weighted relations depends on what imporantce is given the weights of the incident edges in comparison to the number of those edges. Opsahl et al. propose a generalized method for controlling the relative importance between the number of incident ties (nodal degree) versus the total weight of those ties (nodal strength). Research in TNA has largely focused on un-weighted ties, whereas richer and more sophisticated models of covert networks are needed to give precise and more realistic knowledge about such networks. Moreover, the existing implementation of node centrality algorithms in TNA tools don't support networks having weighted/values relations among nodes. New implementations of node centrality algorithms for weighted networks based on the generalized approach have been developed in CrimeFighter Assistant tool and are evaluated with known network dataset of the 9/11 incident.

A Tool for Monitoring of YouTube Content

“…This component is responsible for extracting commenters and authors with respect to a particular video under investigation. (Memon, 2012) and determining various clusters in the resulting social network is supported by this component.…”

Covert Network Analysis for Key Player Detection and Event Prediction Using a Hybrid Classifier

“…For weighted graphs, a variation of DC has been presented by Memon [ 5 ]. According to author, for weighted networks, the simplest extension of degree is node strength [ 6 , 7 ], which is the sum of weights of node's direct ties.…”

Shortlisting the Influential Members of Criminal Organizations and Identifying Their Important Communication Channels

“…Hierarchically structured criminal organizations mainly use mobile phones and emails to communicate, so access to mobile communications data (MCD) and email records allows the relationships among the members of such organizations to be depicted as networks, often allowing the identification of leaders and the most important communication channels [16,18,22,28,29,30,41,45]. For example, the email addresses of Nigeria-based scammers were linked to their Facebook profiles and the k-clique was used to identify the scammers and their leaders, based on a social network with 40,000 nodes [18].…”