Formulation of document summarization as a 0–1 nonlinear programming problem

Formulation of document summarization as a 0–1 nonlinear programming problem

0.00 Avg rating0 Votes
Article ID: iaor2013349
Volume: 64
Issue: 1
Start Page Number: 94
End Page Number: 102
Publication Date: Jan 2013
Journal: Computers & Industrial Engineering
Authors: , ,
Keywords: document retrieval, programming (binary)
Abstract:

We proposed a novel text summarization model based on 0–1 non‐linear programming problem. This proposed model covers the main content of the given document(s) through sentence assignment. We implemented our model on multi‐document summarization task. When comparing our method to several existing summarization methods on an open DUC2001 and DUC2002 datasets, we found that the proposed method could improve the summarization results significantly. The methods were evaluated using ROUGE‐1, ROUGE‐2 and ROUGE‐W metrics.

Reviews

Required fields are marked *. Your email address will not be published.