Title :
Whom to remove? Breaking the covert network
Author :
Karthika, S. ; Geetha, R. ; Bose, Sayan
Author_Institution :
Dept. of Comput. Sci. & Eng., Anna Univ., Chennai, India
Abstract :
The law enforcement analyst had a necessity for a new type of network analysis to understand the structure of the organization behind such brutal and well executed attacks so that experts could identify the involved key players. The network analysis which studies who is related to whom based on what relation called as Social Network Analysis (SNA) is applied here. In this paper we present graph theoretic and POSET oriented methodologies to efficiently fragment a clandestine network using a naïve Relationship Centrality CR. Our results evidently show that the predominant cut-set of actors recognized, isolate the covert network into multiple fragments with minimum number of actors. CR measure could precisely identify the top ordered crucial nodes of the attack by not only using the distance measure as other centralities but also considers various other attributes like relations, time order and importance of the event occurrence. This paper also compares the relational measure with other conventional distance based centralities.
Keywords :
graph theory; information analysis; police data processing; social networking (online); POSET oriented methodology; SNA; distance based centrality; distance measure; event occurrence; graph theory; law enforcement analyst; naive relationship centrality; predominant cut-set; relation attribute; relational measure; social network analysis; time order attribute; Muscles; Fragmentation; Key player identification; Order theory; Relationship; Social Network Analysis; Terrorism;
Conference_Titel :
Advanced Computing (ICoAC), 2013 Fifth International Conference on
Conference_Location :
Chennai
Print_ISBN :
978-1-4799-3447-8
DOI :
10.1109/ICoAC.2013.6921975