Finding hidden group structure in a stream of communications

J. Baumes, M. Goldberg, M. Hayvanovych, M. Magdon-Ismail, W. Wallace, M. Zaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages201-212
Number of pages12
Volume3975 LNCS
DOIs
Publication statusPublished - 19 Jul 2006
Externally publishedYes
EventIEEE International Conference on Intelligence and Security Informatics, ISI 2006 - San Diego, CA, United States
Duration: 23 May 200624 May 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3975 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherIEEE International Conference on Intelligence and Security Informatics, ISI 2006
CountryUnited States
CitySan Diego, CA
Period23/5/0624/5/06

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Baumes, J., Goldberg, M., Hayvanovych, M., Magdon-Ismail, M., Wallace, W., & Zaki, M. (2006). Finding hidden group structure in a stream of communications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3975 LNCS, pp. 201-212). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3975 LNCS). https://doi.org/10.1007/11760146_18