ACM Home Page
Please provide us with feedback. Feedback
Query-sensitive mutual reinforcement chain and its application in query-oriented multi-document summarization
Full text PdfPdf (299 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Singapore, Singapore
SESSION: Summarization table of contents
Pages 283-290  
Year of Publication: 2008
ISBN:978-1-60558-164-4
Authors
Furu Wei  The Hong Kong Polytechnic University, Hong Kong, Hong Kong and Wuhan University, Wuhan, China
Wenjie Li  The Hong Kong Polytechnic University, Hong Kong, Hong Kong
Qin Lu  The Hong Kong Polytechnic University, Hong Kong, Hong Kong
Yanxiang He  Wuhan University, Wuhan, China
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 28,   Downloads (12 Months): 268,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390334.1390384
What is a DOI?

ABSTRACT

Sentence ranking is the issue of most concern in document summarization. Early researchers have presented the mutual reinforcement principle (MR) between sentence and term for simultaneous key phrase and salient sentence extraction in generic single-document summarization. In this work, we extend the MR to the mutual reinforcement chain (MRC) of three different text granularities, i.e., document, sentence and terms. The aim is to provide a general reinforcement framework and a formal mathematical modeling for the MRC. Going one step further, we incorporate the query influence into the MRC to cope with the need for query-oriented multi-document summarization. While the previous summarization approaches often calculate the similarity regardless of the query, we develop a query-sensitive similarity to measure the affinity between the pair of texts. When evaluated on the DUC 2005 dataset, the experimental results suggest that the proposed query-sensitive MRC (Qs-MRC) is a promising approach for summarization.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
DUC: http://www-nlpir.nist.gov/projects/duc/pubs.html.
 
5
Erkan, G. and Radev, D. R. 2004. LexRank: Graph-based Centrality as Salience in Text Summarization, Journal of Artificial Intelligence Research 22:457--479.
 
6
Haveliwala, T. H. 2003. Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search. IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 4, pp 784--796.
 
7
Langville, A. N. and Meyer, C. D. 2004. Deeper Inside PageRank. Journal of Internet Mathematics, 1(3): 335--380.
 
8
 
9
 
10
 
11
 
12
 
13
 
14
 
15
16
 
17
 
18
19
 
20
 
21
Wan, X. Y., Yang, J. W., and Xiao, J. G. 2007. Towards Iterative Reinforcement Approach for Simultaneous Document Summarization and Keyword Extraction. In Proceedings of ACL.
22
 
23

Collaborative Colleagues:
Furu Wei: colleagues
Wenjie Li: colleagues
Qin Lu: colleagues
Yanxiang He: colleagues