.png){kind=icon}
返回
CDDS: Constraint-driven document summarization models
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2012.07.049.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a constraint-driven document summarization approach emphasizing the following two requirements: (1) diversity in summarization, which seeks to reduce redundancy among sentences in the summary and (2) sufficient coverage, which focuses on avoiding the loss of the document's main information when generating the summary. The constraint-driven document summarization models with tuning the constraint parameters can drive content coverage and diversity in a summary. The models are formulated as a quadratic integer programming (QIP) problem. To solve the QIP problem we used a discrete PSO algorithm. The models are implemented on multi-document summarization task. The comparative results showed that the proposed models outperform other methods on DUC2005 and DUC2007 datasets. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Constraint-driven summarization
Coverage-driven summarization
Diversity-driven summarization
Quadratic integer programming
Particle swarm optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
GenDocSum plus MCLR: Generic document summarization based on maximum coverage and less redundancy
PREAI
分享收藏
查看更多内容