Behavioral Profile Generation for 9/11 Terrorist Network Using Efficient Selection Strategies

  • S. Karthika
  • A. Kiruthiga
  • S. Bose
Part of the Advances in Intelligent Systems and Computing book series (volume 167)


In recent days terrorism poses a threat to homeland security. It’s highly motivated by the “net-war” where the extremist are organized in a network structure. The major problem faced is to automatically identify the key player who can maximally influence other nodes in a large relational covert network. The nodes and links are represented in the form of a directional semantic graph where each node is related with more than one relationship with the other node. The behaviors of nodes are analyzed based on the semantic profile generated. This analysis helps the crime analyst to judge the key player for a criminal activity. The semantic profile is obtained by choosing carefully the path types that suits best for a specific node. The selection strategies can be generalized as path equivalence and constraint based. The strategy further supports the variable relaxation approach by grouping all the paths with the same sequence of relations as a single path type. This can also be made as user friendly by letting the user to represent their own preferences on the nodes and links.


Social Network Analysis (SNA) Terrorism Unsupervised learning Selection Strategy Semantic profile 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Borgatti, S.: Identifying sets of key players in a social network. Comput. Math. Organiz. Theor. 12, 21–34 (2006)MATHCrossRefGoogle Scholar
  2. 2.
    Lin, S.-D., Chalupsky, H.: Discovering and explaining abnormal nodes in semantic graphs. IEEE Transactions on Knowledge and Data Engineering 20(8), 1039–1052 (2008)CrossRefGoogle Scholar
  3. 3.
    Lin, S.-D., Chalupsky, H.: Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis. In: Third IEEE International Conference on Data Mining (2003)Google Scholar
  4. 4.
    Lin, S.-D., Chalupsky, H.: Using Unsupervised Link Discovery Methods to Find Interesting Facts and Connections in a Bibliography Dataset. ACM SIGKDD Explorations Newsletter (2003)Google Scholar
  5. 5.
    Krebs, V.E.: Mapping Networks of Terrorist Cells. Connections 24(3), 43–52 (2002)Google Scholar
  6. 6.
    Hasan, M., Chaoji, V., Salem, S., Zaki, M.: Link prediction using supervised learning. In: Proceedings of the Workshop on Link Discovery: Issues, Approaches and Applications (2005)Google Scholar
  7. 7.
    Zhao, B., Sen, P., Getoor, L.: Entity and relationship labeling in affiliation networks. In: ICML Workshop on Statistical Network Analysis (2006)Google Scholar
  8. 8.
    Zou, L., Chen, L., Lu, Y.: Top-k subgraph matching query in a large graph. In: PIKM 2007: Proceedings of the ACM First Ph.D. Workshop in CIKM, pp. 139–146. ACM, New York (2007)CrossRefGoogle Scholar
  9. 9.
    Kocsis, R.N.: Criminal Profiling: International Theory, Research, and Practice, pp. 169–188. Humana Press Inc., Totowa (2007)Google Scholar
  10. 10.
    Memon, N., Harkiolakis, N., Hicks, D.L.: Detecting High-Value Individuals in Covert Networks: 7/7 London Bombing Case Study. Computer System and Application (2008)Google Scholar
  11. 11.
    Memon, N., Larsen, H.L., Hicks, D.L., Harkiolakis, N.: Detecting Hidden Hierarchy in Terrorist Networks: Some Case Studies. In: ISI 2008 Workshops, pp. 477–489 (2008)Google Scholar
  12. 12.
    Memon, N., Wiil, U.K., Alhajj, R., Atzenbeck, C., Harkiolakis, N.: Harvesting covert networks: a case study of the iMiner database. Int. J. Networking and Virtual OrganisationsGoogle Scholar
  13. 13.
    Boyer, R.S., Strother Moore, J.: A Fast String Searching Algorithm. Communications of the ACM 20(10) (1977)Google Scholar
  14. 14.
    Kean, T.H.: The 9/11 Commission Report. National Commission on Terrorist Attacks upon the United States, USA (2004)Google Scholar
  15. 15.
    Responsibility for September 11 attacks (November 2010),

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringCollege of Engineering Guindy, Anna UniversityChennaiIndia

Personalised recommendations