Document Summarization via Submodular Optimization

Abstract

Many criteria for document summarization are known to be submodular functions, which are the discrete counterpart of convex functions. In this paper, we review the recent studies on document summarization based on submodular set-function optimization. And, we also describe some prospects related to this field.