Skip to main content

Finding Pertinent Page-Pairs from Web Search Results

  • Conference paper
Digital Libraries: Implementing Strategies and Sharing Experiences (ICADL 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3815))

Included in the following conference series:

Abstract

Conventional Web search engines evaluate each single page as a ranking unit. When the information a user wishes to have is distributed on multiple Web pages, it is difficult to find pertinent search results with these conventional engines. Furthermore, search result lists are hard to check and they do not tell us anything about the relationships between the searched Web pages. We often have to collect Web pages that reflect different viewpoints. Here, a collection of pages may be more pertinent as a search result item than a single Web page. In this paper, we propose the idea to realize the notion of “multiple viewpoint retrieval” in Web searches. Multiple viewpoint retrieval means searching Web pages that have been described from different viewpoints for a specific topic, gathering multiple collections of Web pages, ranking each collection as a search result and returning them as results. In this paper, we consider the case of page-pairs. We describe a feature-vector based approach to finding pertinent page-pairs. We also analyze the characteristics of page-pairs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Google, http://www.google.com

  2. Cutting, D.R., Pedersen, J.O., Karger, D., Tukey, J.W.: Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections. In: Proceedings of the Fifteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 318–329 (1992)

    Google Scholar 

  3. Clusty the Clustering Engine, http://clusty.com

  4. NewsInEssence, http://lada.si.umich.edu:8080/clair/nie1/nie.cgi

  5. Columbia NewsBlaster, http://www1.cs.columbia.edu/nlp/newsblaster

  6. Salton, G.: Developments in automatic text retrieval. Science (253), 974–979 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yumoto, T., Tanaka, K. (2005). Finding Pertinent Page-Pairs from Web Search Results. In: Fox, E.A., Neuhold, E.J., Premsmit, P., Wuwongse, V. (eds) Digital Libraries: Implementing Strategies and Sharing Experiences. ICADL 2005. Lecture Notes in Computer Science, vol 3815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599517_34

Download citation

  • DOI: https://doi.org/10.1007/11599517_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30850-8

  • Online ISBN: 978-3-540-32291-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics