A Cluster-Sensitive Graph Model for Query-Oriented Multi-document Summarization

  • Furu Wei
  • Wenjie Li
  • Qin Lu
  • Yanxiang He
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4956)


In this paper, we develop a novel cluster-sensitive graph model for query-oriented multi-document summarization. Upon it, an iterative algorithm, namely QoCsR, is built. As there is existence of natural clusters in the graph in the case that a document comprises a collection of sentences, we suggest distinguishing intra- and inter-document sentence relations in order to take into consideration the influence of cluster (i.e. document) global information on local sentence evaluation. In our model, five kinds of relations are involved among the three objects, i.e. document, sentence and query. Three of them are new and normally ignored in previous graph-based models. All these relations are then appropriately formulated in the QoCsR algorithm though in different ways. ROUGE evaluations shows that QoCsR can outperform the best DUC 2005 participating systems.


Query-Oriented Summarization Multi-document Summarization Graph Model and Ranking Algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Brin, S., Page, L.: The Anatomy of a Large-scale Hypertextual Web Search Engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)CrossRefGoogle Scholar
  2. 2.
  3. 3.
    Erkan, G., Radev, D.R.: LexPageRank: Prestige in Multi-Document Text Summarization. In: Proceedings of EMNLP, pp. 365–371 (2004)Google Scholar
  4. 4.
    Erkan, G., Radev, D.R.: LexRank: Graph-based Centrality as Salience in Text Summarization. Journal of Artificial Intelligence Research 22, 457–479 (2004)Google Scholar
  5. 5.
    Leskovec, J., Grobelnik, M., Milic-Frayling, N.: Learning Sub-structures of Document Semantic Graphs for Document Summarization. In: Proceedings of LinkKDD Workshop, pp. 133–138 (2004)Google Scholar
  6. 6.
    Li, W., Wu, M., Lu, Q., Xu, W., Yuan, C.: Extractive Summarization using Intra- and Inter-Event Relevance. In: Proceedings of ACL/COLING, pp. 369–376 (2006)Google Scholar
  7. 7.
    Lin, C.-Y., Hovy, E.: Automatic Evaluation of Summaries Using N-gram Co-occurrence Statistics. In: Proceedings of HLT-NAACL, pp. 71–78 (2003)Google Scholar
  8. 8.
    Mihalcea, R., Tarau, P.: TextRank – Bringing Order into Text. In: Proceedings of EMNLP, pp. 404–411 (2004)Google Scholar
  9. 9.
    Mihalcea, R.: Graph-based Ranking Algorithms for Sentence Extraction, Applied to Text Summarization. In: Proceedings of ACL (Companion Volume) (2004)Google Scholar
  10. 10.
    OtterBacher, J., Erkan, G., Radev, D.R.: Using Random Walks for Question-focused Sentence Retrieval. In: Proceedings of HLT/EMNLP, pp. 915–922 (2005)Google Scholar
  11. 11.
    Padmanabhan, D., Desikan, P., Srivastava, J., Riaz, K.: WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs. In: Proceedings of 2005 IEEE/WIC/ACM International Conference on Web Intelligence, pp. 522–528 (2005)Google Scholar
  12. 12.
    Vanderwende, L., Banko, M., Menezes, A.: Event-Centric Summary Generation. In: Working Notes of DUC 2004 (2004)Google Scholar
  13. 13.
    Wan, X., Yang, J., Xiao, J.: Using Cross-Document Random Walks for Topic-Focused Multi-Document Summarization. In: Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence, pp. 1012–1018 (2006)Google Scholar
  14. 14.
    Yoshioka, M., Haraguchi, M.: Multiple News Articles Summarization based on Event Reference Information. In: Working Notes of NTCIR-4 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Furu Wei
    • 1
    • 2
  • Wenjie Li
    • 2
  • Qin Lu
    • 2
  • Yanxiang He
    • 1
  1. 1.Department of Computer Science and TechnologyWuhan UniversityChina
  2. 2.Department of ComputingThe Hong Kong Polytechnic UniversityHong Kong 

Personalised recommendations