This item is a Paper in the Data Mining track.
- Li, Liangda - Shanghai Jiao-Tong University
- Zhou, Ke - Shanghai Jiao-Tong University
- Xue, Gui-Rong - Shanghai Jiao-Tong University
- Zha, Hongyuan - Georgia Institute of Technology
- Yu, Yong - Shanghai Jiao-Tong University
Document summarization plays an increasingly important role with the exponential growth of documents on the Web. Many supervised and unsupervised approaches have been proposed to generate summaries from documents. However, these approaches seldom simultaneously consider summary diversity, coverage, and balance issues which to a large extent determine the quality of summaries. In this paper, we consider extract-based summarization emphasizing the following three requirements: 1) diversity in summarization, which seeks to reduce redundancy among sentences in the summary; 2) sufficient coverage, which focuses on avoiding the loss of the document’s main information when generating the summary; and 3) balance, which demands that different aspects of the document need to have about the same relative importance in the summary. We formulate the extract-based summarization problem as learning a mapping from a set of sentences of a given document to a subset of the sentences that satisﬁes the above three requirements. The mapping is learned by incorporating several constraints in a structure learning framework, and we explore the graph structure of the output variables and employ structural SVM for solving the resulted optimization problem. Experiments on the DUC2001 data sets demonstrate signiﬁcant performance improvements in terms of F1 and ROUGE metrics.
Export Record As...
- HTML Citation
- ASCII Citation
- Resource Map
- OpenURL ContextObject
- OpenURL ContextObject in Span
- EP3 XML
- Dublin Core
- Reference Manager
- Eprints Application Profile
- Simple Metadata