Субмодульная максимизация

This study proposes a text summarization model that simultaneously performs sen- tence extraction and compression. We translate the text summarization task into a problem of extracting a set of depen- …...

AbstractSubmodular maximization with the greedy algorithm has been studied as an effective approach to extractive summarization. This approach is known to have three advantages: its applicability to many useful submodular …...

AbstractExtreme classification is a classification task on an extremely large number of labels (tags). User generated labels for any type of online data can be sparing per individual user but …...