Skip to main content

A No-Word-Segmentation Hierarchical Clustering Approach to Chinese Web Search Results

  • 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:

  • 1393 Accesses

Abstract

In this paper, we present a No-Word-Segmentation Hierarchical Clustering Approach (NWSHCA) to Chinese Web search results. The approach uses a new similarity measure between two documents based on a variation of the Edit Distance, and then it generates preliminary clusters using a partitioning clustering method. Next it ranks all common substring in a cluster using a cluster-discriminative metric with the top K as cluster description labels. Finally it uses HAC to cluster the top K cluster labels to form a navigational tree. NWSHCA can generate overlapping clusters contrast to most clustering algorithms. Experimental results show that the approach is feasible and effective.

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.

References

  1. Zamir, O., Etzioni, O.: Grouper: A dynamic clustering interface to Web search results. Computer Networks 31(11-16), 1361–1374 (1999)

    Article  Google Scholar 

  2. Voorhees, E.M.: Implementing agglomerative hierarchical clustering algorithms for use in document retrieval. Information Processing and Management 22, 465–476 (1986)

    Article  Google Scholar 

  3. Hill, D.R.: A vector clustering technique. In: Samuelson (ed.) Mechanized Information Storage, Retrieval and Dissemination, North-Holland, Amsterdam (1968)

    Google Scholar 

  4. Raghavan, V.V., Wong, S.K.M.: A critical analysis of vector space model for information retrieval. Journal of the American Society for Information Science (1986)

    Google Scholar 

  5. Zamir, O., Etzioni, O.: Grouper: A dynamic clustering interface to Web search results. Computer Networks 31(11-16), 1361–1374 (1999)

    Article  Google Scholar 

  6. Ristad, Yianilos, E.S.: Learning string-edit distance. Pattern Analysis and Machine Intelligence, IEEE Transactions (1998)

    Google Scholar 

  7. Navarro, G., Fredriksson, K.: Average complexity of exact and approximate multiple string matching[J]. Theoretical Computer Science 321(2-3), 283–290 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. http://www.vivisimo.com

  9. http://www.baidu.com

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

Zhang, H., Zhao, L., Liu, R., Wang, D. (2008). A No-Word-Segmentation Hierarchical Clustering Approach to Chinese Web Search Results. 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_66

Download citation

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

  • 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