Link Prediction Based on Sequential Bayesian Updating in a Terrorist Network

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 213)

Abstract

Link prediction techniques are being increasingly employed to detect covert networks, such as terrorist networks. The challenging problem we have been facing is to improve the performance and accuracy of link prediction methods. We develop an algorithm based on Sequential Bayesian Updating method that combines probabilistic reasoning techniques. This algorithm adopts a recursive way to estimate the statistical confidence of the results a prior and then regenerate observed graphs to make inferences. This novel idea can be efficiently adapt to small datasets in link prediction problems of various engineering applications and science researches. Our experiment with a terrorist network shows significant improvement in terms of prediction accuracy measured by mean average precision. This algorithm has also been integrated into an emergency decision support system (NBCDSS) to provide decision-makers’ auxiliary information.

Keywords

Link prediction Probabilistic reasoning Bayesian inference Decision-making Terrorist network 

Notes

Acknowledgments

This work is supported by National Basic Research Program of China (973 program) with Grant No. 2011CB706900, National Natural Science Foundation of China (Grant No. 70971128), Beijing Natural Science Foundation (Grant No. 9102022), and the President Fund of UCAS (Grant No. O95101HY00).

References

  1. 1.
    Rhodes CJ, Keefe EMJ (2007) Social network topology: a bayesian approach. J Oper Res Soc 58:1605–1611CrossRefGoogle Scholar
  2. 2.
    Greengrass E (2000) Information retrieval: a survey. University of Maryland, BaltimoreGoogle Scholar
  3. 3.
    Lu L, Medo M, Yeung CH et al (2012) Recommender systems, Phys Rep 519(1):1–49 Google Scholar
  4. 4.
    Jansen R et al (2003) A Bayesian networks approach for predicting protein–protein interactions from genomic data. Science 302:449–453CrossRefGoogle Scholar
  5. 5.
    Yu H et al (2008) High-quality binary protein interaction map of the yeast interactome network. Science 322:104–110CrossRefGoogle Scholar
  6. 6.
    Xiang E (2008) A survey on link prediction models for social network data. PhD thesis, Hong Kong UST, Department of Computer Science and EngineeringGoogle Scholar
  7. 7.
    Resnik P (1995b) Using information content to evaluate semantic similarity in a taxonomy. In: Proceedings of IJCAI-95. Montreal, Canada pp 448–453Google Scholar
  8. 8.
    Frakes WB, Baeza-Yates R (1992) Information retrieval: data structures and algorithms. Prentice Hall, USGoogle Scholar
  9. 9.
    Hindle D (1990) Noun classification from predicate argument structures. In: Proceedings of the 28th annual meeting of the association for computational linguistics, pp 268–275Google Scholar
  10. 10.
    Jin EM, Girvan M, Newman MEJ (2001) The structure of growing social networks. Phys Rev Lett E 64:046132Google Scholar
  11. 11.
    Salton G, McGill MJ (1983) Introduction to modern information retrieval. McGraw-Hill, MaidenherdGoogle Scholar
  12. 12.
    Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211–230, July 2003Google Scholar
  13. 13.
    Mitzenmacher M (2001) A brief history of log normal and power law distributions. In: Proceedings of the Allerton conference on communication, control, and computing, pp 182–191Google Scholar
  14. 14.
    Rhodes CJ (2009) Inference approaches to constructing covert social network topologies. In: Memon N, Farley JD, Hicks DL, Rosenoorn T (eds) Mathematical methods in counter-terrorism. Springer, BerlinGoogle Scholar
  15. 15.
    Xu Z, Tresp V, Yu K, Yu S, Kriegel H-P (2005) Dirichlet enhanced relational learning. In: Proceedings of the 22nd international conference on machine learning. Bonn, Germany, p 1004Google Scholar
  16. 16.
    Yu K, Chu W, Yu S, Tresp V, Xu Z (2007) Stochastic relational models for discriminative link prediction. In: Proceedings of neural information processing systems. MIT Press, Cambridge, MA, pp 1553–1560Google Scholar
  17. 17.
    Kim M, Leskovec J (2011) The network completion problem: inferring missing nodes and edges in networks. In: Proceedings of SDM. pp 47–58Google Scholar
  18. 18.
    Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C, Ghahramani Z (2010) Kronecker graphs: an approach to modeling networks. JMLRGoogle Scholar
  19. 19.
    Clauset A, Moore C, Newman MEJ (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453:98–101CrossRefGoogle Scholar
  20. 20.
    Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: Proceedings of ACM international conference on web search and data mining (WSDM)Google Scholar
  21. 21.
    Kim M, Leskovec J (2010) Multiplicative attribute graph model of real-world networks. arXiv:1009.3499v2Google Scholar
  22. 22.
    Rhodes CJ (2011) The use of open source intelligence in the construction of covert social networks. Counterterrorism and open source intelligence. Lect Notes Soc Netw (LNSN 2). Springer, Wien Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.College of EngineeringUniversity of Chinese Academy of SciencesBeijingChina
  2. 2.The School of ScienceCommunication University of ChinaBeijingChina

Personalised recommendations