The use of MMR, diversity-based reranking for reordering documents and producing summaries
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
The budgeted maximum coverage problem
Information Processing Letters
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Bayesian query-focused summarization
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Search-based structured prediction
Machine Learning
Text summarization model based on maximum coverage problem and its variant
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Exploring content models for multi-document summarization
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Local search for balanced submodular clusterings
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Multi-document summarization using sentence-based topic models
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Multi-document summarization via budgeted maximization of submodular functions
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
A hybrid hierarchical model for multi-document summarization
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Citation summarization through keyphrase extraction
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Multi-document summarization via the minimum dominating set
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Word alignment via submodular maximization over matroids
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Submodularity beyond submodular energies: Coupling edges in graph cuts
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Word alignment via submodular maximization over matroids
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Large-margin learning of submodular summarization models
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Domain and function: a dual-space model of semantic relations and compositions
Journal of Artificial Intelligence Research
Panorama: a semantic-aware application search framework
Proceedings of the 16th International Conference on Extending Database Technology
Text summarization while maximizing multiple objectives with lagrangian relaxation
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Sub-sentence extraction based on combinatorial optimization
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Mining semantics for culturomics: towards a knowledge-based approach
Proceedings of the 2013 international workshop on Mining unstructured big data using natural language processing
Promoting diversity in recommendation by entropy regularizer
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Journal of Information Science
Hi-index | 0.00 |
We design a class of submodular functions meant for document summarization tasks. These functions each combine two terms, one which encourages the summary to be representative of the corpus, and the other which positively rewards diversity. Critically, our functions are monotone nondecreasing and submodular, which means that an efficient scalable greedy optimization scheme has a constant factor guarantee of optimality. When evaluated on DUC 2004-2007 corpora, we obtain better than existing state-of-art results in both generic and query-focused document summarization. Lastly, we show that several well-established methods for document summarization correspond, in fact, to submodular function optimization, adding further evidence that submodular functions are a natural fit for document summarization.