Papers by Shinsaku Sakaue
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function (N18-1)
Copied to clipboard
| Challenge: | Submodular maximization with the greedy algorithm is an effective approach to extractive summarization. |
| Approach: | They propose a submodular maximization method that is 100 to 400 times faster than existing methods for extractive summarization. |
| Outcome: | The proposed method is 100 to 400 times faster than existing method based on integer-linear-programming formulations and achieves 95%-approximation. |