Identifying and tracking dynamic processes in social networks

The detection and tracking of embedded malicious subnets in an active social network can be computationally daunting due to the quantity of transactional data generated in the natural interaction of large numbers of actors comprising a network. In addition, detection of illicit behavior may be further complicated by evasive strategies designed to camouflage the activities of the covert subnet. In this work, we move beyond traditional static methods of social network analysis to develop a set of dynamic process models which encode various modes of behavior in active social networks. These models will serve as the basis for a new application of the Process Query System (PQS) to the identification and tracking of covert dynamic processes in social networks. We present a preliminary result from application of our technique in a real-world data stream— the Enron email corpus.

[1]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[2]  Sherry Marcus,et al.  Graph-based technologies for intelligence analysis , 2004, CACM.

[3]  M Girvan,et al.  Structure of growing social networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  G. Cybenko,et al.  Temporal and spatial distributed event correlation for network security , 2004, Proceedings of the 2004 American Control Conference.

[5]  J. Lafferty,et al.  Time-Sensitive Dirichlet Process Mixture Models , 2005 .

[6]  Luciano Rossoni,et al.  Models and methods in social network analysis , 2006 .

[7]  Michael I. Jordan,et al.  Hierarchical Dirichlet Processes , 2006 .

[8]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[9]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[10]  Vincent H. Berk,et al.  An overview of process query systems , 2004, SPIE Defense + Commercial Sensing.

[11]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[12]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[13]  Yiming Yang,et al.  Introducing the Enron Corpus , 2004, CEAS.

[14]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[15]  T.R. Coffman,et al.  Pattern classification in social network analysis: a case study , 2004, 2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720).

[16]  S. Wasserman,et al.  Models and Methods in Social Network Analysis , 2005 .

[17]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[18]  Andrew McCallum,et al.  Extracting social networks and contact information from email and the Web , 2004, CEAS.

[19]  Andrew McCallum,et al.  Topic and Role Discovery in Social Networks , 2005, IJCAI.

[20]  Vladimir Batagelj,et al.  Exploratory Social Network Analysis with Pajek , 2005 .