Query-oriented summarization based on neighborhood graph model

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we investigate how to combine the link-aware and link-free information in sentence ranking for query-oriented summarization. Although the link structure has been emphasized in the existing graph-based summarization models, there is lack of pertinent analysis on how to use the links. By contrasting the text graph with the web graph, we propose to evaluate significance of sentences based on neighborhood graph model. Taking the advantage of the link information provided on the graph, each sentence is evaluated according to its own value as well as the cumulative impacts from its neighbors. For a task like query-oriented summarization, it is critical to explore how to reflect the influence of the query. To better incorporate query information into the model, we further design a query-sensitive similarity measure to estimate the association between a pair of sentences. When evaluated on DUC 2005 dataset, the results of the pro-posed approach are promising. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wei, F., He, Y., Li, W., & Huang, L. (2009). Query-oriented summarization based on neighborhood graph model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5459 LNAI, pp. 156–167). https://doi.org/10.1007/978-3-642-00831-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free