Subtree Extractive Summarization via Submodular Maximization
Code (0)
등록된 구현이 없습니다.
Tasks
Extractive SummarizationSentence CompressionText SummarizationSimilar Papers 제목 키워드 기반
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function
Submodular 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 object…
Document SummarizationExtractive SummarizationInformation RetrievalKnapsack Constrained Contextual Submodular List Prediction with Application to Multi-document Summarization
We study the problem of predicting a set or list of options under knapsack constraint. The quality of such lists are evaluated by a submodular reward function that measures both quality and diversity. Similar to DAgger (…
DiversityDocument SummarizationMulti-Document SummarizationSubmodularity In Machine Learning and Artificial Intelligence
In this manuscript, we offer a gentle review of submodularity and supermodularity and their properties. We offer a plethora of submodular definitions; a full description of a number of example submodular functions and th…
Abstractive Text SummarizationBIG-bench Machine Learningfeature selectionStreaming Submodular Maximization under a k-Set System Constraint
In this paper, we propose a novel framework that converts streaming algorithms for monotone submodular maximization into streaming algorithms for non-monotone submodular maximization. This reduction readily leads to the …
Data SummarizationMovie RecommendationStreaming Submodular Maximization under a $k$-Set System Constraint
In this paper, we propose a novel framework that converts streaming algorithms for monotone submodular maximization into streaming algorithms for non-monotone submodular maximization. This reduction readily leads to the …
Data SummarizationMovie Recommendation