Single-Document Summarization as a Tree Knapsack Problem.
Tsutomu HiraoYasuhisa YoshidaMasaaki NishinoNorihito YasudaMasaaki NagataPublished in: EMNLP (2013)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- single document summarization
- optimal solution
- optimization problems
- exact algorithms
- linear programming relaxation
- np hard
- multi document summarization
- greedy algorithm
- multidimensional knapsack problem
- implicit enumeration
- knn
- continuous relaxation
- maximum profit
- neural network
- information extraction
- active learning
- lower bound
- objective function
- genetic algorithm