.png){kind=icon}
返回
Formulation of document summarization as a 0-1 nonlinear programming problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2012.09.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Generic summarization
Optimization model
Balancing coverage and diversity
Weighted combination of arithmetic and geometric means
Discrete particle swarm optimization
Estimation of distribution
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏Development of the long-distance pipeline transport for backfill mixes in terms of Oktyabrsky Mine
PREAI
分享收藏
查看更多内容