A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
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 anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
The budgeted maximum coverage problem
Information Processing Letters
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Graph-based ranking algorithms for sentence extraction, applied to text summarization
ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
PageRank on semantic networks, with application to word sense disambiguation
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Maximizing Non-Monotone Submodular Functions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
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
LexRank: graph-based lexical centrality as salience in text summarization
Journal of Artificial Intelligence Research
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
A study of global inference algorithms in multi-document summarization
ECIR'07 Proceedings of the 29th European conference on IR research
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
A class of submodular functions for document summarization
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
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
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Upgrading shortest paths in networks
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
MSSF: a multi-document summarization framework based on submodularity
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Diversity in ranking via resistive graph centers
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fair and balanced: learning to present news stories
Proceedings of the fifth ACM international conference on Web search and data mining
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Retrieving similar discussion forum threads: a structure based approach
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Large-margin learning of submodular summarization models
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Multi-document summarization via submodularity
Applied Intelligence
Navigating large comment threads with CoFi
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Demonstration Session
Temporal corpus summarization using submodular word coverage
Proceedings of the 21st ACM international conference on Information and knowledge management
Ontology-enriched multi-document summarization in disaster management using submodular function
Information Sciences: an International Journal
Understanding and analysing microblogs
Proceedings of the 22nd international conference on World Wide Web companion
iHR: an online recruiting system for Xiamen Talent Service Center
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Using micro-reviews to select an efficient set of reviews
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
TopicDSDR: combining topic decomposition and data reconstruction for summarization
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
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 best-performing method from the DUC'04 evaluation on ROUGE-1 scores.