Skip to main content

Query Length, Number of Classes and Routes through Clusters: Experiments with a Clustering Method for Information Retrieval

  • Conference paper
Internet Applications (ICSC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1749))

Included in the following conference series:

  • 334 Accesses

Abstract

A classical information retrieval system ranks documents according to distances between texts and a user query. The answer list is often so long that users cannot examine all the documents retrieved whereas some relevant ones are badly ranked and thus never retrieved. To solve this problem, retrieved documents are automatically clustered. We describe an algorithm based on hierarchical and clustering methods. It classifies the set of documents retrieved by any IR-system. This method is evaluated over the TREC-7 corpora and queries. We show that it improves the results of the retrieval by providing users at least one high precision cluster. The impact of the number of clusters and the way to browse them to build a reordered list are examined. Over TREC corpora and queries, we show that the choice of the number of clusters according to the length of queries improves results compared with a prefixed number.

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. Allen, R.B., Obry, P., Littman, M.: An interface for navigating clustered document sets returned by queries. In: Proceedings of COCS, p. 166 (1993)

    Google Scholar 

  2. Cutting, D.R., Karger, D.R., Pedersen, J.O., Tukey, J.W.: Sactter/Gather: a Cluster-based Approach to Browsing Large Document Collections. In: ACM/SIGIR, pp. 318–329 (1992)

    Google Scholar 

  3. Diday, E., Lemaire, J., Pouget, J., Testu, F.: Eléments d’Analyse des Données, Dunod Informatique (1982)

    Google Scholar 

  4. Evans, D.A., Huettner, A., Tong, X., Jansen, P., Subasic, P.: Notes on the Effectiveness of Clustering in Ad-Hoc Retrieval. In: TREC-7, NIST special publication (1998)

    Google Scholar 

  5. Frakes, W.B., Baeza-Yates, R. (eds.): Information Retrieval, Data Structures & Algorithms. Prentice-Hall Inc., Englewood Cliffs (1992) ISBN-0-13-463837-9

    Google Scholar 

  6. Hearst, M.A., Pedersen, J.O.: Reexamining the Cluster Hypothesis: Scatter/Gather on Retrieval Results. In: ACM/SIGIR, pp. 76–84 (1996)

    Google Scholar 

  7. Kowalski, G.: Information Retrieval Systems, Theory and Implementation. Kluwer Academic Publishers, Dordrecht (1997) ISBN-0-7923-9926-9

    MATH  Google Scholar 

  8. de Loupy, C., Bellot, P., El-Bèze, M., Marteau, P.F.: Query Expansion and Automatic Classification. In: TREC-7, NIST special publication #500-242, pp. 443–450 (1999)

    Google Scholar 

  9. Sahami, M., Yusufali, S., Baldonaldo, M.Q.W.: SONIA a service for organizing networked information autonomously. In: ACM/DL, pp. 200-209 (1998)

    Google Scholar 

  10. Schütze, H., Silverstein, C.: Projections for Efficient Document Clustering. In: ACM/SIGIR, pp. 74-81 (1997)

    Google Scholar 

  11. Silverstein, C., Pedersen, J.O.: Almost-Constant-Time Clustering of Arbitrary Corpus Subsets. In: ACM/SIGIR, pp. 60-66 (1997)

    Google Scholar 

  12. Van Rijsbergen, C.J.: Information Retrieval, Buttherwords, London (1979)

    Google Scholar 

  13. Voorhees, E.M., Harman, D.: Overview of the Seventh Text REtrieval Conference (TREC- 7), NIST special publication (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bellot, P., El-Bèze, M. (1999). Query Length, Number of Classes and Routes through Clusters: Experiments with a Clustering Method for Information Retrieval. In: Hui, L.C.K., Lee, DL. (eds) Internet Applications. ICSC 1999. Lecture Notes in Computer Science, vol 1749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46652-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46652-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66903-6

  • Online ISBN: 978-3-540-46652-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics