Discovery and regeneration of hidden emails

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2005, Pages 503-510

  Carenini, Giuseppe ^a   Ng, Raymond ^a   Zhou, Xiaodong ^a   Zwart, Ed ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Document Forensics; Hidden Email discovery; Text Mining

Indexed keywords

DATA MINING; HEURISTIC METHODS; INFORMATION RETRIEVAL;

DOCUMENT FORENSICS; HIDDEN EMAIL DISCOVERY; TEXT MINING;

ELECTRONIC MAIL;

EID: 32344432810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066677.1066792     Document Type: Conference Paper

References (18)

1. Jacek Gwizdka. Reinventing the inbox: supporting the management of pending tasks in email CHI '02 extended abstracts on Human factors in computing systems, Minneapolis, Minnesota, USA, 2002, pp. 550-551.
2. Li-te Cheng and Daniel Gruen. A Mobile User Interface for threading, Marking, and Previewing Email IBM Technical Report, 2003
3. Ani Nenkova and Amit Bagga. Email classification for contact centers Proceedings of the 2003 ACM symposium on Applied computing, Melbourne, Florida, 2003, pp. 789-792.
4. Gwizdka, J, Chignell. M.H. Individual Differences and Task-based User Interface Evaluation: A Case Study of Pending Tasks in Email Interacting with Computers, Elsevier Science, Minneapolis, Minnesota, USA, 2004, v.16(4) pp. 550-551.
5. Steven L. Rohall. Reinventing email CSCW'02 Workshop: Redesigning email for the 21st centry, Portland, Oregon, USA, November, 2002
6. Bryan Klimt and Yiming Yang. The enron corpus: a new dataset for email classification research European Conference on Machine Learning (ECML 2004), Italy, 2004
7. Rakesh Agrawal and Sridhar Rajagopalan and Ramakrishnan Srikant and Yirong Xu. Mining newsgroups using networks arising from social behavior Proceedings of the twelfth international conference on World Wide Web, Budapest, Hungary, 2003, pp. 529-535.
8. Derek Lam, Steven L. Rohall, Chris Schmandt and Mia K. Stern. Exploiting E-mail structure to improve summarization CSCW'02 Poster Session, New Orleans, Louisiana, United States, 2002,
9. Paula S. Newman. Exploring discussion lists: steps and directions Proceedings of the second ACM/IEEE-CS joint conference on Digital libraries, Portland, Oregon, USA, 2002, pp. 126-134.
10. Vitor R. Carvalho and William W. Cohen. Learning to Extract Signature and Reply Lines from Email First Conferences on Emails and Anti-spam, Mountain View, CA, USA.
11. Olivier Y. de Vel and A. Anderson and M. Corney and George M. Mohay. Mining Email Content for Author Identification Forensics SIGMOD Record v.30(4), 55-64, 2001
12. Kulesh Shanmugasundaram and Nasir D. Memon. Automatic Reassembly of Document Fragments via Context Based Statistical Models ACSAC, 2003, pp. 152-159.
13. Samir Khuller and Balaji Raghavachari and Neal E. Young. Approximating the minimum equivalent digraph Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, Arlington, Virginia, United States, 1994, pp. 177-186.
14. Eduard H. Hovy and Yigal Arens. Automatic generation of formatted text Proceedings of Ninth National Conference on Artificial Intel ligence (AAAI-1991), 1991, pp. 92-97.
15. Milind Dawande and Pinar Keskinocak and Jayashankar M. Swaminathan and Sridhar Tayur. On bipartite and multipartite clique problems J. Algorithms, v.41(2), 2001, pp. 388-403.
16. Jack Edmonds and Richard M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems Journal of ACM, vol.19(2),1972,pp. 248-264
17. Rene Peeters. The maximum edge biclique problem is NP-complete Discrete Appl. Math., v.131(3), 2003, pp. 651-654.
18. Dorit S. Hochbaum. Approximating clique and biclique problems J. Algorithms, v.29(1), 1998, pp. 174-200.