Multi-document summarization via budgeted maximization of submodular functions

NAACL HLT 2010 - Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Main Conference

Volumn , Issue , 2010, Pages 912-920

  Lin, Hui ^a   Bilmes, Jeff ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION BOUNDS; BUDGET CONSTRAINT; GREEDY ALGORITHMS; MAXIMIZATION PROBLEM; MULTI-DOCUMENT SUMMARIZATION; SUBMODULAR; SUBMODULAR FUNCTIONS; TEXT SUMMARIZATION;

COMPUTATIONAL LINGUISTICS;

BUDGET CONTROL;

EID: 84863338141     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. S. Brin and L. Page. 1998. The anatomy of a large-scale hypertextual Web search engine. Computer networks and ISDN systems, 30(1-7):107-117.
2. Jaime Carbonell and Jade Goldstein. 1998. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In Proc. of SIGIR.
3. J.M. Conroy, J.D. Schlesinger, J. Goldstein, and D.P. O'leary. 2004. Left-brain/right-brain multi-document summarization. In Proceedings of the Document Understanding Conference (DUC 2004).
4. H.T. Dang. 2005. Overview of DUC 2005. In Proceedings of the Document Understanding Conference.
5. 2004. Document understanding conferences (DUC). http://www-nlpir.nist. gov/projects/duc/index.html.
6. G. Erkan and D.R. Radev. 2004. LexRank: Graphbased Lexical Centrality as Salience in Text Summarization. Journal of Artificial Intelligence Research, 22:457-479. (Pubitemid 41525893)
7. U. Feige, V. Mirrokni, and J. Vondrak. 2007. Maximizing non-monotone submodular functions. In Proceedings of 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
8. U. Feige. 1998. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), 45(4):634-652. (Pubitemid 128488790)
9. G. Goel, C. Karande, P. Tripathi, and L. Wang. 2009. Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions. FOCS.
10. S. Iwata, L. Fleischer, and S. Fujishige. 2001. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM, 48(4):761-777.
11. Yoshinobu Kawahara, Kiyohito Nagano, Koji Tsuda, and Jeff Bilmes. 2009. Submodularity cuts and applications. In Neural Information Processing Society (NIPS), Vancouver, Canada, December.
12. S. Khuller, A. Moss, and J. Naor. 1999. The budgeted maximum coverage problem. Information Processing Letters, 70(1):39-45.
13. A. Krause and C. Guestrin. 2005. A note on the budgeted maximization of submodular functions. Technical Rep. No. CMU-CALD-05, 103.
14. J. Lee, V.S. Mirrokni, V. Nagarajan, and M. Sviridenko. 2009. Non-monotone submodular maximization under matroid and knapsack constraints. In Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, pages 323-332. ACM New York, NY, USA.
15. Hui Lin, Jeff Bilmes, and Shasha Xie. 2009. Graphbased submodular selection for extractive summarization. In Proc. IEEE Automatic Speech Recognition and Understanding (ASRU), Merano, Italy, December.
16. Chin-Yew Lin. 2004. ROUGE: A package for automatic evaluation of summaries. In Text Summarization Branches Out: Proceedings of the ACL-04 Workshop.
17. L. Lovasz. 1983. Submodular functions and convexity. Mathematical programming-The state of the art, (eds. A. Bachem, M. Grotschel and B. Korte) Springer, pages 235-257.
18. R. McDonald. 2007. A study of global inference algorithms in multi-document summarization. Lecture Notes in Computer Science, 4425:557.
19. R. Mihalcea and P. Tarau. 2004. TextRank: bringing order into texts. In Proceedings of EMNLP, Barcelona, Spain.
20. R. Mihalcea, P. Tarau, and E. Figa. 2004. PageRank on semantic networks, with application to word sense disambiguation. In Proceedings of the 20th International Conference on Computational Linguistics (COLING-04).
21. R. Mihalcea. 2004. Graph-based ranking algorithms for sentence extraction, applied to text summarization. In Proceedings of the ACL 2004 (companion volume). 2006. Mosek.
22. G.L. Nemhauser, L.A. Wolsey, and M.L. Fisher. 1978. An analysis of approximations for maximizing submodular set functions I. Mathematical Programming, 14(1):265-294.
23. A. Schrijver. 2000. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80(2):346-355.
24. M. Sviridenko. 2004. A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters, 32(1):41-43.
25. H. Takamura and M. Okumura. 2009. Text summarization model based on maximum coverage problem and its variant. In Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, pages 781-789. Association for Computational Linguistics.