Graph-based submodular selection for extractive summarization

Proceedings of the 2009 IEEE Workshop on Automatic Speech Recognition and Understanding, ASRU 2009

Volumn , Issue , 2009, Pages 381-386

  Lin, Hui ^a   Bilmes, Jeff ^a   Xie, Shasha ^b  

^a University of Washington   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC SPEECH RECOGNITION; CONCEPT-BASED APPROACH; GRAPH-BASED; HUMAN TRANSCRIPTS; INTEGER LINEAR PROGRAMMING; PAGERANK; RANKING ALGORITHM; SEMANTIC GRAPHS; SUBMODULAR; SUBMODULAR FUNCTIONS; SUBMODULARITY;

INTEGER PROGRAMMING; LINEARIZATION; OPTIMIZATION; SEMANTICS;

SPEECH RECOGNITION;

EID: 77949397801     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASRU.2009.5373486     Document Type: Conference Paper

References (31)

1. R. McDonald, "A study of global inference algorithms in multi-document summarization," Lecture Notes in Computer Science, vol. 4425, p. 557, 2007.
2. H. Dang, "Overview of DUC 2005," in Proceedings of the Document Understanding Conference, 2005.
3. J. Carbonell and J. Goldstein, "The use of MMR, diversity-based reranking for reordering documents and producing summaries," in Proc. of SIGIR, 1998.
4. A. Krause, H. McMahan, C. Guestrin, and A. Gupta, "Robust submodular observation selection," Journal of Machine Learning Research, vol. 9, pp. 2761-2801, 2008.
5. D. Gillick, K. Riedhammer, B. Favre, and D. Hakkani-Tür, "A global optimization framework for meeting summarization," in Proc. of ICASSP, 2009.
6. R. Mihalcea, P. Tarau, and E. Figa, "PageRank on semantic networks, with application to word sense disambiguation," in Proceedings of the 20th International Conference on Computational Linguistics (COLING-04), 2004.
7. L. Lovasz, "Submodular functions and convexity," Mathematical programming-The state of the art,(eds. A. Bachem, M. Grotschel and B. Korte) Springer, pp. 235-257, 1983.
8. M. Goemans and D. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," Journal of the ACM (JACM), vol. 42, no. 6, pp. 1115-1145, 1995.
9. U. Feige, "A threshold of ln n for approximating set cover," Journal of the ACM (JACM), vol. 45, no. 4, pp. 634-652, 1998.
10. G. Cornuejols, M. Fisher, and G. Nemhauser, "On the uncapacitated location problem," in Studies in Integer Programming: Proceedings of the Institute of Operations Research Workshop, vol. 1. North Holland, 1977, pp. 163-177.
11. L. Shapley, "Cores of convex games," International Journal of Game Theory, vol. 1, no. 1, pp. 11-26, 1971.
12. A. Schrijver, "A combinatorial algorithm minimizing submodular functions in strongly polynomial time," Journal of Combinatorial Theory, Series B, vol. 80, no. 2, pp. 346-355, 2000.
13. S. Iwata, L. Fleischer, and S. Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions," Journal of the ACM, vol. 48, no. 4, pp. 761-777, 2001.
14. M. Narasimhan and J. Bilmes, "A submodular-supermodular procedure with applications to discriminative structure learning," in Proc. Conf. Uncertainty in Artifical Intelligence. Edinburgh, Scotland: Morgan Kaufmann Publishers, July 2005.
15. M. Narasimhan and J. Bilmes, "Local search for balanced submodular clusterings," in Twentieth International Joint Conference on Artificial Intelligence (IJCAI07), Hyderabad, India, January 2007.
16. G. Nemhauser, L. Wolsey, and M. Fisher, "An analysis of approximations for maximizing submodular set functions I," Mathematical Programming, vol. 14, no. 1, pp. 265-294, 1978.
17. A. R. Krause, "Optimizing sensing: Theory and applications," Ph.D. dissertation, Carnegie Mellon University, 2008.
18. G. Erkan and D. Radev, "LexRank: Graph-based Lexical Centrality as Salience in Text Summarization," Journal of Artificial Intelligence Research, vol. 22, pp. 457-479, 2004.
19. R. Mihalcea and P. Tarau, "TextRank: bringing order into texts," in Proceedings of EMNLP, Barcelona, Spain, 2004.
20. S. Brin and L. Page, "The anatomy of a large-scale hypertextual Web search engine," Computer networks and ISDN systems, vol. 30, no. 1-7, pp. 107-117, 1998.
21. R. Mihalcea, "Graph-based ranking algorithms for sentence extraction, applied to text summarization," in Proceedings of the ACL 2004 (companion volume), 2004.
22. H. Lin and J. A. Bilmes, "How to select a good training-data subset for transcription: Submodular active selection for sequences," in Proc. of Interspeech, Brighton, UK, September 2009.
23. A. Janin, D. Baron, and J. E. et al., "The ICSI meeting corpus," in Proc. of ICASSP, 2003.
24. G. Murray, S. Renals, and J. Carletta, "Extractive summarization of meeting recordings," in Proc. of Interspeech, 2005.
25. S. Xie, B. Favre, D. Hakkani-Tür, and Y. Liu, "Leveraging sentence weights in a concept-based optimization framework for extractive meeting summarization," in Proc. of Interspeech, 2009.
26. Q. Zhu, A. Stolcke, B. Chen, and N. Morgan, "Using MLP features in SRI's conversational speech recognition system," in Proc. of Interspeech, 2005.
27. C.-Y. Lin, "ROUGE: A package for automatic evaluation of summaries," in Text Summarization Branches Out: Proceedings of the ACL-04 Workshop, 2004.
28. J. J. Zhang, H. Y. Chan, and P. Fung, "Improving lecture speech summarization using rhetorical information," in Proc. of ASRU, 2007.
29. X. Zhu and G. Penn, "Summarization of spontaneous conversations," in Proc. of Interspeech, 2006.
30. M. Galley, "A skip-chain conditional random field for ranking meeting utterances by importance," in Proc. of EMNLP, 2006.
31. S. Xie, Y. Liu, and H. Lin, "Evaluating the effectiveness of features and sampling in extractive meeting summarization," in Proc. of IEEE Spoken Language Technology (SLT), 2008.