返回
Multi-document summarization via submodularity
DOI:10.1007/s10489-012-0336-1.png)
摘要
En 中文
Multi-document summarization is becoming an important issue in the Information Retrieval community. It aims to distill the most important information from a set of documents to generate a compressed summary. Given a set of documents as input, most of existing multi-document summarization approaches utilize different sentence selection techniques to extract a set of sentences from the document set as the summary. The submodularity hidden in the term coverage and the textual-unit similarity motivates us to incorporate this property into our solution to multi-document summarization tasks. In this paper, we propose a new principled and versatile framework for different multi-document summarization tasks using submodular functions (Nemhauser et al. in Math. Prog. 14(1):265-294, 1978) based on the term coverage and the textual-unit similarity which can be efficiently optimized through the improved greedy algorithm. We show that four known summarization tasks, including generic, query-focused, update, and comparative summarization, can be modeled as different variations derived from the proposed framework. Experiments on benchmark summarization data sets (e.g., DUC04-06, TAC08, TDT2 corpora) are conducted to demonstrate the efficacy and effectiveness of our proposed framework for the general multi-document summarization tasks.
Keyword:
Multi-document summarization
Submodularity
Greedy algorithm
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Vocal Development and Its Differentiation in a Non-Songbird: the Collared Dove (Streptopelia Decaocto)
Behaviour
IF0
The Effects of Propagation Techniques on Cell Wall Chemistry and Wood Anatomy in Micropropagated and Grafted Plants of the Dutch Elm Hybrid ‘Dodoens’繁殖技术对微繁和嫁接的荷兰榆杂交种‘Dodoens’细胞壁化学和木材解剖学的影响


