ACM Home Page
Please provide us with feedback. Feedback
CollabSum: exploiting multiple document clustering for collaborative single document summarizations
Full text PdfPdf (331 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Amsterdam, The Netherlands
SESSION: Summaries table of contents
Pages: 143 - 150  
Year of Publication: 2007
ISBN:978-1-59593-597-7
Authors
Xiaojun Wan  Jianguo XiaoPeking University
Jianwu Yang  Jianguo XiaoPeking University
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 34,   Downloads (12 Months): 343,   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/1277741.1277768
What is a DOI?

ABSTRACT

Almost all existing methods conduct the summarization tasks for single documents separately without interactions for each document under the assumption that the documents are considered independent of each other. This paper proposes a novel framework called CollabSum for collaborative single document summarizations by making use of mutual influences of multiple documents within a cluster context. In this study, CollabSum is implemented by first employing the clustering algorithm to obtain appropriate document clusters and then exploiting the graph-ranking based algorithm for collaborative document summarizations within each cluster. Both the with-document and cross-document relationships between sentences are incorporated in the algorithm. Experiments on the DUC2001 and DUC2002 datasets demonstrate the encouraging performance of the proposed approach. Different clustering algorithms have been investigated and we find that the summarization performance relies positively on the quality of document cluster.


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
 
2
 
3
4
5
6
 
7
ErKan, Günes, Radev, D. R.: LexPageRank: Prestige in Multi-Document Text Summarization. In Proceedings of EMNLP2004.
8
 
9
Hovy, E., Lin, C. Y.: Automated Text Summarization in SUMMARIST. In Proceeding of ACL'1997/EACL'1997 Worshop on Intelligent Scalable Text Summarization, 1997.
10
 
11
 
12
13
 
14
15
 
16
 
17
 
18
Luhn, H. P.: The Automatic Creation of literature Abstracts. IBM Journal of Research and Development, 1969, 2(2).
19
 
20
Mihalcea, R., Tarau, P.: TextRank: Bringing Order into Texts. In Proceedings of EMNLP2004.
 
21
Mihalcea, R. and Tarau, P.: A language independent algorithm for single and multiple document summarization. In Proceedings of IJCNLP2005.
22
 
23
Porter, M. F. An algorithm for suffix stripping. Program, 14(3): 130--137, 1980.
 
24
Shen, D., Sun, J. -T., Li, H., Yang, Q., and Chen, Z. Document Summarization using Conditional Random Fields. In Proceedings of IJCAI 2007.
25
 
26
SteinBack, M., Karypis, G., and Kumar, V. A comparison of document clustering techniques. In KDD Workshop on Text Mining, 1999.
27
 
28
Zhang, B., Li, H., Liu, Y., Ji, L., Xi, W., Fan, W., Chen, Z., and Ma, W. -Y. Improving web search results using affinity graph. In Proceedings of SIGIR2005.

Collaborative Colleagues:
Xiaojun Wan: colleagues
Jianwu Yang: colleagues