Finding hidden group structure in a stream of communications

Authors:
J. Baumes;M. Goldberg;M. Hayvanovych;M. Magdon-Ismail;W. Wallace;M. Zaki
Affiliations:
CS Department, RPI, Troy, NY;CS Department, RPI, Troy, NY;CS Department, RPI, Troy, NY;CS Department, RPI, Troy, NY;DSES Department, RPI, Troy, NY;CS Department, RPI, Troy, NY
Venue:
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Year:
2006

Citing 2
Cited 2

Locating hidden groups in communication networks using hidden Markov models

ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
Efficient identification of overlapping communities

ISI'05 Proceedings of the 2005 IEEE international conference on Intelligence and Security Informatics

An approach for temporal analysis of email data based on segmentation

Data & Knowledge Engineering
Cold start link prediction

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.01

Visualization

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.