Finding Hidden Group Structure in a Stream of Communications

  • J. Baumes
  • M. Goldberg
  • M. Hayvanovych
  • M. Magdon-Ismail
  • W. Wallace
  • M. Zaki
Conference paper

DOI: 10.1007/11760146_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3975)
Cite this paper as:
Baumes J., Goldberg M., Hayvanovych M., Magdon-Ismail M., Wallace W., Zaki M. (2006) Finding Hidden Group Structure in a Stream of Communications. In: Mehrotra S., Zeng D.D., Chen H., Thuraisingham B., Wang FY. (eds) Intelligence and Security Informatics. ISI 2006. Lecture Notes in Computer Science, vol 3975. Springer, Berlin, Heidelberg

Abstract

A hidden group in a communication network is a group of individuals planning an activity over a communication medium without announcing their intentions. We develop algorithms for separating non-random planning-related communications from random background communications in a streaming model. This work extends previous results related to the identification of hidden groups in the cyclic model. The new statistical model and new algorithms do not assume the existence of a planning time-cycle in the stream of communications of a hidden group. The algorithms construct larger hidden groups by building them up from smaller ones. To illustrate our algorithms, we apply them to the Enron email corpus in order to extract the evolution of Enron’s organizational structure.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • J. Baumes
    • 1
  • M. Goldberg
    • 1
  • M. Hayvanovych
    • 1
  • M. Magdon-Ismail
    • 1
  • W. Wallace
    • 2
  • M. Zaki
    • 1
  1. 1.CS DepartmentRPITroyUSA
  2. 2.DSES DepartmentRPITroyUSA

Personalised recommendations