Back to results list
Show full item record
Please use this identifier to cite or link to this item:
|Title:||HyperSum : hypergraph based semi-supervised sentence ranking for query-oriented summarization||Authors:||Wang, W
|Issue Date:||2009||Source:||Proceedings of the 18th ACM Conference on Information and Knowledge Management (CIKM'09), Hong Kong, November 2-6, 2009, p. 1855-1858 How to cite?||Abstract:||Graph based sentence ranking algorithms such as PageRank and HITS have been successfully used in query-oriented summarization. With these algorithms, the documents to be summarized are often modeled as a text graph where nodes represent sentences and edges represent pairwise similarity relationships between two sentences. A deficiency of conventional graph modeling is its incapability of naturally and effectively representing complex group relationships shared among multiple objects. Simply squeezing complex relationships into pairwise ones will inevitably lead to loss of information which can be useful for ranking and learning. In this paper, we propose to take advantage of hypergraph, i.e. a generalization of graph, to remedy this defect. In a text hypergraph, nodes still represent sentences, yet hyperedges are allowed to connect more than two sentences. With a text hypergraph, we are thus able to integrate both group relationships formulated among multiple sentences and pairwise relationships formulated between two sentences in a unified framework. As essential work, it is first addressed in the paper that how a text hypergraph can be built for summarization by applying clustering techniques. Then, a hypergraph based semi-supervised sentence ranking algorithm is developed for query-oriented extractive summarization, where the influence of query is propagated to sentences through the structure of the constructed text hypergraph. When evaluated on DUC data sets, performance of the proposed approach is remarkable.||URI:||http://hdl.handle.net/10397/39824||ISBN:||978-1-60558-512-3||DOI:||10.1145/1645953.1646248|
|Appears in Collections:||Conference Paper|
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.