Skip to main content

An Entropy-Based Hierarchical Search Result Clustering Method by Utilizing Augmented Information

  • Conference paper
Information Retrieval Technology (AIRS 2008)

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

Included in the following conference series:

  • 1414 Accesses

Abstract

Because of the improvement of the technology of search engines, and the massively increase of the number of web pages, the results returned by the search engines are always mixed and disordered. Especially for the queries with multiple topics, the mixed and disorderly situation of the search results would be more obvious. The search engines can return information of several hundred to thousand of the pages’ titles, snippets and URLs. Almost all of the technologies about search result clustering must attain further information from the contents of the returned lists. However, long execution time is not permitted for a real-time clustering system.

In this paper we propose some methods with better efficiency to improve the previous technologies. We utilize and augment information that search engines returned and use entropy calculation to attain the term distribution in snippets. We also propose several new methods to attain better clustered search results and reduce execution time. Our experiments indicate that these proposed methods obtain the better clustered results.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Ferragina, P., Gulli, A.: A Personalized Search Engine Based on Web-Snippet Hierarchical Clustering. In: WWW 2005, pp. 801–810 (2005)

    Google Scholar 

  2. Lawrie, D.J., Croft, W.B.: Generating Hierarchical Summaries for Web Searches. In: SIGIR 2003, pp. 457–458 (2003)

    Google Scholar 

  3. Kummamuru, K., Krishnapuram, R.: A Clustering Algorithm for Asymmetrically Related Data with Application to Text Mining. In: CIKM 2001, pp. 571–573 (2001)

    Google Scholar 

  4. Kummamuru, K., Lotlikar, R., Roy, S., Singal, K., Krishnapuram, R.: A Hierarchical Monothetic Document Clustering Algorithm for Summarization and Browsing Search Results. In: WWW 2004, pp. 658–665 (2004)

    Google Scholar 

  5. Zeng, H.-J., He, Q.-C., Chen, Z., Ma, W.-Y., Ma, J.: Learning to Cluster Web Search Results. In: SIGIR 2004, pp. 210–217 (2004)

    Google Scholar 

  6. Zamir, O., Etzioni, O.: Grouper: A Dynamic Clustering Interface to Web Search Results. In: WWW 1999, pp. 1361–1374 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hang Li Ting Liu Wei-Ying Ma Tetsuya Sakai Kam-Fai Wong Guodong Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hung-Yu, K., Hsin-Wei, H., Chih-Lu, L., Chia-Chun, S., Tse-Ming, T. (2008). An Entropy-Based Hierarchical Search Result Clustering Method by Utilizing Augmented Information. In: Li, H., Liu, T., Ma, WY., Sakai, T., Wong, KF., Zhou, G. (eds) Information Retrieval Technology. AIRS 2008. Lecture Notes in Computer Science, vol 4993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68636-1_81

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68636-1_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68633-0

  • Online ISBN: 978-3-540-68636-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics