MSSF: A Multi-Document Summarization Framework based on Submodularity

被引：0

作者：

Li, Jingxuan ^{[1
]}

Li, Lei ^{[1
]}

Li, Tao ^{[1
]}

机构：

[1] Florida Int Univ, Sch Comp & Informat Sci, Miami, FL 33199 USA

来源：

PROCEEDINGS OF THE 34TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR'11) | 2011年

基金：

美国国家科学基金会;

关键词：

Submodularity; Summarization; Framework;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Multi-document summarization aims to distill the most representative information from a set of documents to generate a 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 textual-unit similarity motivates us to incorporate this property into our solution to multi-document summarization tasks. In this poster, we propose a new principled and versatile framework for different multi-document summarization tasks using the submodular function [8].

引用

页码：1247 / 1248

页数：2

共 11 条

[1] Dang H.T., 2008, P TAC 2008
[2] Goldstein J., 2000, NAACL ANLP 2000 WORK
[3] The budgeted maximum coverage problem
Khuller, S
Moss, A
Naor, JS
[J]. INFORMATION PROCESSING LETTERS, 1999, 70 (01) : 39 - 45
[4] Krause A., 2007, AAAI, V7, P1650
[5] Lin H, 2010, HUMAN LANGUAGE TECHN, P912
[6] Minoux M., 1978, Proceedings of the 8th IFIP Conference on Optimization Techniques, P234, DOI 10.1007/BFb0006528
[7] Nastase V, 2008, P EMNLP
[8] ANALYSIS OF APPROXIMATIONS FOR MAXIMIZING SUBMODULAR SET FUNCTIONS .1.
NEMHAUSER, GL
WOLSEY, LA
FISHER, ML
[J]. MATHEMATICAL PROGRAMMING, 1978, 14 (03) : 265 - 294
[9] Wang D., 2009, P CIKM
[10] Wang D, 2008, P 31 ANN INT ACM SIG, P307, DOI DOI 10.1145/1390334.1390387

← 1 2 →