ACM Home Page
Please provide us with feedback. Feedback
Link-based event detection in email communication networks
Full text PdfPdf (303 KB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
SESSION: Data streams track table of contents
Pages 1506-1510  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Authors
Xiaomeng Wan  Dalhousie University, Halifax, Canada
Evangelos Milios  Dalhousie University, Halifax, Canada
Nauzer Kalyaniwalla  Dalhousie University, Halifax, Canada
Jeannette Janssen  Dalhousie University, Halifax, Canada
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 38,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529618
What is a DOI?

ABSTRACT

People's email communications can be modeled as graphs with vertices representing email accounts and edges representing email communications. Email communication data usually comes in as continuous data stream. Event detection aims to identify abnormal email communications that serve as analogs of real-world events imposed upon the data stream. The goal is to understand the communications behaviors of the subjects. The contents of emails are often not available or protected by privacy, which makes linkage information the only resource we can rely on. We propose a link-based event detection method that clusters vertices with similar communication patterns together and then, considers deviations from each vertex's individual profile, as well as its cluster profile. Experiments show that this method performs well on both Enron and our own email datasets.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Scan statistics on enron graphs. http://cis.jhu.edu/parky/Enron/enron.html.
 
2
J. D. Banfield and A. E. Raftery. Model-based gaussian and non-gaussian clustering. Biometrics, 49(3): 803--821, Sep. 1993.
 
3
C. Cortes, D. Pregibon, and C. Volinsky. Computational Methods for Dynamic Graphs. Journal of Computational and Graphical Statistics, 12(4): 950--970, 2003.
4
5
 
6
 
7

Collaborative Colleagues:
Xiaomeng Wan: colleagues
Evangelos Milios: colleagues
Nauzer Kalyaniwalla: colleagues
Jeannette Janssen: colleagues