Skip to main content

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

Included in the following conference series:

Abstract

Conventional Web search engines rank their searched results page by page. That is, conventionally, the information unit for both searching and ranking is a single Web page. There are, however, cases where a set of searched pages shows a better similarity (relevance) to a given (keyword) query than each individually searched page. This is because the information a user wishes to have is sometimes distributed on multiple Web pages. In such cases, the information unit used for ranking should be a set of pages rather than a single page. In this paper, we propose the notion of a “page set ranking”, which is to rank each pertinent set of searched Web pages. We describe our new algorithm of the page set ranking to efficiently construct and rank page sets. We present some experimental results and the effectiveness of our approach.

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. 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 

  2. clusty.com, http://clusty.com/

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

  4. Yumoto, T., Tanaka, K.: Finding pertinent page-pairs from web search results. In: Fox, E.A., Neuhold, E.J., Premsmit, P., Wuwongse, V. (eds.) ICADL 2005. LNCS, vol. 3815, pp. 301–310. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Sun, J.T., Wang, X., Shen, D., Zeng, H.J., Chen, Z.: CWS: a comparative web search system. In: WWW 2006: Proceedings of the 15th international conference on World Wide Web, pp. 467–476. ACM Press, New York (2006)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Oyama, S., Tanaka, K.: Query modification by discovering topics from web page structures. In: Yu, J.X., Lin, X., Lu, H., Zhang, Y. (eds.) APWeb 2004. LNCS, vol. 3007, pp. 553–564. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yumoto, T., Tanaka, K. (2006). Page Sets as Web Search Answers. In: Sugimoto, S., Hunter, J., Rauber, A., Morishima, A. (eds) Digital Libraries: Achievements, Challenges and Opportunities. ICADL 2006. Lecture Notes in Computer Science, vol 4312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11931584_27

Download citation

  • DOI: https://doi.org/10.1007/11931584_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49375-4

  • Online ISBN: 978-3-540-49377-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics