Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 615431, 13 pages
Research Article

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

Department of Computer Engineering, College of Electrical and Mechanical Engineering, National University of Sciences and Technology, Islamabad 44000, Pakistan

Received 2 April 2014; Revised 20 June 2014; Accepted 25 June 2014; Published 20 July 2014

Academic Editor: Christian Baumgartner

Copyright © 2014 Wasi Haider Butt et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. V. E. Krebs, “Uncloaking terrorist networks,” First Monday, vol. 7, no. 4, 2002. View at Google Scholar · View at Scopus
  2. S. Wasserman and K. Faust, “Social network analysis in the social and behavioral sciences,” in Social Network Analysis: Methods and Applications, pp. 1–27, Cambridge University Press, 1994. View at Google Scholar
  3. V. Krebs, Connecting the Dots—Tracking Two Identified Terrorists, 2002.
  4. J. Nieminen, “On the centrality in a graph,” Scandinavian Journal of Psychology, vol. 15, no. 1, pp. 332–336, 1974. View at Publisher · View at Google Scholar · View at Scopus
  5. B. R. Memon, “Identifying important nodes in weighted covert networks using generalized centrality measures,” in Proceedings of the European Intelligence and Security Informatics Conference (EISIC ’12), pp. 131–140, Odense, Denmark, August 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Barrat, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani, “The architecture of complex weighted networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 101, no. 11, pp. 3747–3752, 2004. View at Publisher · View at Google Scholar · View at Scopus
  7. S. Yang and D. Knoke, “Optimal connections: Strength and distance in valued graphs,” Social Networks, vol. 23, no. 4, pp. 285–295, 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. M. A. Beauchamp, “An improved index of centrality,” Behavioral Science, vol. 10, pp. 161–163, 1965. View at Publisher · View at Google Scholar · View at Scopus
  9. G. Sabidussi, “The centrality index of a graph,” Psychometrika. A Journal Devoted to the Development of Psychology as a Quantitative Rational Science, vol. 31, pp. 581–603, 1966. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. L. C. Freeman, “Centrality in social networks conceptual clarification,” Social Networks, vol. 1, no. 3, pp. 215–239, 1978-1979. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Bonacich and P. Lloyd, “Eigenvector-like measures of centrality for asymmetric relations,” Social Networks, vol. 23, no. 3, pp. 191–201, 2001. View at Publisher · View at Google Scholar · View at Scopus
  12. V. Chandola, A. Banerjee, and V. Kumar, Outlier Detection: A Survey, 2007.
  13. P. A. Pappas and V. DePuy, “An Overview of Non-parametric Tests in SAS: When, Why, and How”.
  14. A. R. Ansari and R. A. Bradley, “Rank-sum tests for dispersions,” The Annals of Mathematical Statistics, vol. 31, no. 4, pp. 1174–1189, 1960. View at Google Scholar
  15. T. M. Cover and P. E. Hart, “Nearest neighbor pattern classification,” IEEE Transactions on Information Theory, vol. 13, no. 1, pp. 21–27, 1967. View at Google Scholar
  16. S. Theodoridis and K. Koutroumbas, Pattern Recognition, Academic, Burlington, Mass, USA, 1st edition, 1999.
  17. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, Wiley-Interscience, New York, NY, USA, 2nd edition, 2001. View at MathSciNet
  18. Least squares support vector machine,
  19. P.-N. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining, Addison-Wesley, 2005.
  20. S. Boriah, V. Chandola, and V. Kumar, “Similarity measures for categorical data: a comparative evaluation,” in Proceedings of the 8th SIAM International Conference on Data Mining, pp. 243–254, 2008.
  21. V. Chandola, E. Eilertson, L. Ertoz, G. Simon, and V. Kumar, “Data mining for cyber security,” in Data Warehousing and Data Mining Techniques for Computer Security, A. Singhal, Ed., Springer, 2006. View at Google Scholar
  22. E. M. Knorr and R. T. Ng, “Finding intensional knowledge of distance based outliers,” in Proceedings of the 25th International Conference on Very Large Data Bases (VLDB '99), pp. 211–222, Morgan, San Francisco, Calif, USA, 1999.
  23. S. Ramaswamy, R. Rastogi, and K. Shim, “Efficient algorithms for mining outliers from large data sets,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD ’00), pp. 427–438, ACM Press, NewYork, NY, USA, 2000. View at Publisher · View at Google Scholar
  24. N. Roberts and S. F. Everton, Roberts and Everton Terrorist Data: Noordin Top Terrorist Network (Subset), Machine-readable data file.
  25. Y. Freund and R. E. Schapire, “A desicion-theoretic generalization of on-line learning and an application to boosting,” Journal of Computer and System Sciences, vol. 55, no. 1, pp. 119–139, 1995. View at Google Scholar
  26. L. Breiman, “Bagging predictors,” Machine Learning, vol. 24, no. 2, pp. 123–140, 1996. View at Google Scholar
  27. R. Bryll, R. Gutierrez-Osuna, and F. Quek, “Attribute bagging: improving accuracy of classifier ensembles by using random feature subsets,” Pattern Recognition, vol. 36, no. 6, pp. 1291–1302, 2003. View at Publisher · View at Google Scholar · View at Scopus