ACM Home Page
Please provide us with feedback. Feedback
Summarizing email conversations with clue words
Full text PdfPdf (222 KB)
Source
International World Wide Web Conference archive
Proceedings of the 16th international conference on World Wide Web table of contents
Banff, Alberta, Canada
SESSION: Mining textual data table of contents
Pages: 91 - 100  
Year of Publication: 2007
ISBN:978-1-59593-654-7
Authors
Giuseppe Carenini  University of British Columbia, Vancouver, BC, Canada
Raymond T. Ng  University of British Columbia, Vancouver, BC, Canada
Xiaodong Zhou  University of British Columbia, Vancouver, BC, Canada
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 292,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1242572.1242586
What is a DOI?

ABSTRACT

Accessing an ever increasing number of emails, possibly on small mobile devices, has become a major problem for many users. Email summarization is a promising way to solve this problem. In this paper, we propose a new framework for email summarization. One novelty is to use a fragment quotation graph to try to capture an email conversation. The second novelty is to use clue words to measure the importance of sentences in conversation summarization. Based on clue words and their scores, we propose a method called CWS, which is capable of producing a summary of any length as requested by the user. We provide a comprehensive comparison of CWS with various existing methods on the Enron data set. Preliminary results suggest that CWS provides better summaries than existing methods.


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
Regina Barzilay and Michael Elhadad. Using lexical chains for text summarization. In Proceedings of the Intelligent Scalable Text Summarization Workshop (ISTS'97), ACL, Madrid, Spain, 1997.
2
3
 
4
Chris Schmandt Derek Lam, Steven L. Rohall and Mia K. Stern. Exploiting e-mail structure to improve summarization. In CSCW'02 Poster Session, 2002.
 
5
Günes Erkan and Dragomir R. Radev. Lexrank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research(JAIR), 22:457--479, 2004.
 
6
Aaron Harnly Jen-Yuan Yeh. Email thread reassembly using similarity matching. In Third Conference on Email and Anti-Spam (CEAS), July 27--28 2006.
 
7
8
 
9
Owen Rambow, Lokesh Shrestha, John Chen, and Chirsty Lauridsen. Summarizing email threads. In HLT/NAACL, May 2-7 2004.
 
10
Gordon Rios and Hongyuan Zha. Exploring support vector machines and random forests for spam detection. In First Conference on Email and Anti-Spam (CEAS), July 30--31, 2004.
 
11
12
13
14
 
15
 
16
Xiaojun Wan and Jianwu Yang. Improved affinity graph based multi-document summarization. In HLT/NAACL, June 2006.
17
 
18

Collaborative Colleagues:
Giuseppe Carenini: colleagues
Raymond T. Ng: colleagues
Xiaodong Zhou: colleagues