skip to main content
10.1145/1390334.1390384acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
research-article

Query-sensitive mutual reinforcement chain and its application in query-oriented multi-document summarization

Authors Info & Claims
Published:20 July 2008Publication History

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

  1. Bollegala, D., Matsuo, Y., and Ishizuka, M. 2007. Measuring Semantic Similarity between Words using Web Search Engines. In Proceedings of 16th WWW, pp 757--766. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Brin, S. and Page, L. 1998. The Anatomy of a Large-scale Hypertextual Web Search Engine. Computer Networks and ISDN Systems, 30(1-7): 107--117. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Cilibrasi, R. L. and Vitanyi, P. M. B. 2007. The Google Similarity Distance. IEEE Transactions on Knowledge and Data Engineering, Vol. 19, No. 3, pp 370--383. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. DUC: http://www-nlpir.nist.gov/projects/duc/pubs.html.Google ScholarGoogle Scholar
  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. Google ScholarGoogle ScholarCross RefCross Ref
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Langville, A. N. and Meyer, C. D. 2004. Deeper Inside PageRank. Journal of Internet Mathematics, 1(3): 335--380.Google ScholarGoogle ScholarCross RefCross Ref
  8. Lin, C. Y. and Hovy, E. 2000. The Automated Acquisition of Topic Signature for Text Summarization. In Proceedings of 18th COLING, pp 495--501. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Lin, C. Y. and Hovy, E. 2003. Automatic Evaluation of Summaries Using N-gram Co-occurrence Statistics, in Proceedings of HLT-NAACL, pp71--78. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Mani, I. and Maybury, M. T.(Eds.). 1999. Advances in Automatic Summarization. The MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Mihalcea, R. 2004. Graph-based Ranking Algorithms for Sentence Extraction, Applied to Text Summarization. In Proceedings of ACL 2004, Article No. 20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Mihalcea, R. 2005. Language Independent Extractive Summarization. In Proceedings of ACL 2005, pp 49--52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Jones, K. S. 2007. Automatic Summarising: The State of the art. Information Processing and Management 43: 1449--1481. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Kleinberg, J. M. 1999. Authoritative Sources in a Hyperlinked Environment. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. Pp 668--677. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Otterbacher, J., Erkan, G., and Radev, D. R. 2005. Using Random Walks for Question-focused Sentence Retrieval. In Proceedings of HLT/EMNLP, pp 915--922. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Ouyang, Y., Li, S. J., and Li, W. J. 2007. Developing Learning Strategies for Topic-Based Summarization. In Proceedings of the 16th CIKM, pp 79--86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Over, P., Dang, H., and Harman, D. 2007. DUC in Context, Information Processing and Management, 43(6): 1506--1520. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Radev, D. R., Jing, H. Y., Stys, M., and Tam, D. 2004. Centroid-based Summarization of Multiple Documents. Information Processing and Management, 40: 919--938. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Sahami, M.and Heliman, T. D. 2006. A Web-based Kernel Function for Measuring the Similarity of Short Text Snippets. In Proceedings of 15th WWW, pp 377--386. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Tombros, A. and Rijsbergen, C. J. v. 2004. Query-Sensitive Similarity Measures for Information Retrieval. Knowledge and Information Systems (2004) 6: 617--642. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle Scholar
  22. Zha, H. Y. 2002. Generic Summarization and Key Phrase Extraction using Mutual Reinforcement Principle and Sentence Clustering. In Proceedings of the 25th ACM SIGIR, pp113--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Zhou, Z. H. and Dai, H. B. 2006. Query-Sensitive Similarity Measure for Content-Based Image Retrieval. In Proceedings of ICDM, pp1211--1215. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Query-sensitive mutual reinforcement chain and its application in query-oriented multi-document summarization

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGIR '08: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
      July 2008
      934 pages
      ISBN:9781605581644
      DOI:10.1145/1390334

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 20 July 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate792of3,983submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader