Xiong, S.; Ji, D.: Query-focused multi-document summarization using hypergraph-based ranking (2016)
0.01
0.0060245167 = product of:
0.015061291 = sum of:
0.009535614 = weight(_text_:a in 2972) [ClassicSimilarity], result of:
0.009535614 = score(doc=2972,freq=8.0), product of:
0.053464882 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046368346 = queryNorm
0.17835285 = fieldWeight in 2972, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=2972)
0.005525676 = product of:
0.011051352 = sum of:
0.011051352 = weight(_text_:information in 2972) [ClassicSimilarity], result of:
0.011051352 = score(doc=2972,freq=2.0), product of:
0.08139861 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046368346 = queryNorm
0.13576832 = fieldWeight in 2972, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=2972)
0.5 = coord(1/2)
0.4 = coord(2/5)
- Abstract
- General graph random walk has been successfully applied in multi-document summarization, but it has some limitations to process documents by this way. In this paper, we propose a novel hypergraph based vertex-reinforced random walk framework for multi-document summarization. The framework first exploits the Hierarchical Dirichlet Process (HDP) topic model to learn a word-topic probability distribution in sentences. Then the hypergraph is used to capture both cluster relationship based on the word-topic probability distribution and pairwise similarity among sentences. Finally, a time-variant random walk algorithm for hypergraphs is developed to rank sentences which ensures sentence diversity by vertex-reinforcement in summaries. Experimental results on the public available dataset demonstrate the effectiveness of our framework.
- Source
- Information processing and management. 52(2016) no.4, S.670-681
- Type
- a
