Multi-document Summarization via Budgeted Maximization of Submodular Functions

@inproceedings{Lin2010MultidocumentSV,
  title={Multi-document Summarization via Budgeted Maximization of Submodular Functions},
  author={Hui Lin and Jeff A. Bilmes},
  booktitle={HLT-NAACL},
  year={2010}
}
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can efficiently solve the budgeted submodular maximization problem near-optimally, and we derive new approximation bounds in doing so. Experiments on DUC’04 task show that our approach is superior to the bestperforming method from the DUC’04 evaluation on ROUGE-1 scores. 
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 286 citations. REVIEW CITATIONS

4 Figures & Tables

Topics

Statistics

0204060201020112012201320142015201620172018
Citations per Year

287 Citations

Semantic Scholar estimates that this publication has 287 citations based on the available data.

See our FAQ for additional information.