A global optimization framework for meeting summarization (2009)
| Venue: | in Proc. IEEE ICASSP |
| Citations: | 11 - 3 self |
BibTeX
@INPROCEEDINGS{Gillick09aglobal,
author = {Dan Gillick and Korbinian Riedhammer and Benoit Favre and Dilek Hakkani-tür},
title = {A global optimization framework for meeting summarization},
booktitle = {in Proc. IEEE ICASSP},
year = {2009},
pages = {4769--4772}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by frequency, and an integer linear program to determine the best set of utterances, that is, covering as many concepts as possible while satisfying a length constraint, we achieve ROUGE scores at least as good as a ROUGEbased oracle derived from human summaries. This brings us to a critical discussion of ROUGE and the future of extractive meeting summarization. Index Terms — meeting summarization, integer linear programming, summarization evaluation 1.
