This Article 
 Bibliographic References 
 Add to: 
Update Summarization via Graph-Based Sentence Ranking
May 2013 (vol. 25 no. 5)
pp. 1162-1174
Xuan Li, Institute of Software, Chinese Academy of Sciences, Beijing
Liang Du, Institute of Software, Chinese Academy of Sciences, Beijing
Yi-Dong Shen, Institute of Software, Chinese Academy of Sciences, Beijing
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.
Index Terms:
Manifolds,Cost function,Quadratic programming,Equations,Software,Computer science,quadratic programming,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
Xuan Li, Liang Du, Yi-Dong Shen, "Update Summarization via Graph-Based Sentence Ranking," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 5, pp. 1162-1174, May 2013, doi:10.1109/TKDE.2012.42
Usage of this product signifies your acceptance of the Terms of Use.