.png){kind=icon}
返回
Update Summarization via Graph-Based Sentence Ranking
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2012.42.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to the fast evolution of the information on the Internet, update summarization has received much attention in recent years. It is to summarize an evolutionary document collection at current time supposing the users have read some related previous documents. In this paper, we propose a graph-ranking-based method. It performs constrained reinforcements on a sentence graph, which unifies previous and current documents, to determine the salience of the sentences. The constraints ensure that the most salient sentences in current documents are updates to previous documents. Since this method is NP-hard, we then propose its approximate method, which is polynomial time solvable. Experiments on the TAC 2008 and 2009 benchmark data sets show the effectiveness and efficiency of our method.
Keyword:
Summarization
update summarization
topic-focused summarization
multidocument summarization
extraction-based summarization
graph-based ranking
manifold ranking
large-margin constrained ranking
novelty
quadratically constrained quadratic programming
quadratic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
分享收藏Temperament traits and microhabitat use in bullhead, Cottus perifretum: fish associated with complex habitats are less aggressive.png)
Behaviour
BehaviourIF0
PREAI
分享收藏A SURVEY OF PROJECT MANAGEMENT MATURITY FOR CONSTRUCTION CONTRACTORS IN EGYPT: THE CURRENT STATUS
OAAI
OAAI分享收藏
查看更多内容