Skip to main content

Cheshire II at INEX ’04: Fusion and Feedback for the Adhoc and Heterogeneous Tracks

  • Conference paper

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

Abstract

This paper describes the retrieval approach used by UC Berkeley in the adhoc and heterogeneous tracks for the 2004 INEX evaluation. As in previous INEX evaluations, the main technique we are testing is the fusion of multiple probabilistic searches against different XML components using both Logistic Regression (LR) algorithms and a version of the Okapi BM-25 algorithm in conjunction with Boolean constraints for some elements. We also describe some additional experiments, subsequent to INEX that promise further improvements in results.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beitzel, S.M., Jensen, E.C., Chowdhury, A., Frieder, O., Grossman, D., Goharian, N.: Disproving the fusion hypothesis: An analysis of data fusion via effective information retrieval strategies. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 1–5. Springer, Heidelberg (2003)

    Google Scholar 

  2. Belkin, N., Kantor, P.B., Fox, E.A., Shaw, J.A.: Combining the evidence of multiple query representations for information retrieval. Information Processing and Management 31(3), 431–448 (1995)

    Article  Google Scholar 

  3. Cooper, W.S., Gey, F.C., Chen, A.: Full text retrieval based on a probabilistic equation with coefficients fitted by logistic regression. In: Harman, D.K. (ed.) The Second Text Retrieval Conference (TREC-2) (NIST Special Publication 500-215), Gaithersburg, MD. National Institute of Standards and Technology, pp. 57–66 (1994)

    Google Scholar 

  4. Cooper, W.S., Gey, F.C., Dabney, D.P.: Probabilistic retrieval based on staged logistic regression. In: 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Copenhagen, Denmark, June 21-24, pp. 198–210. ACM, New York (1992)

    Chapter  Google Scholar 

  5. Larson, R.R.: TREC interactive with cheshire II. Information Processing and Management 37, 485–505 (2001)

    Article  MATH  Google Scholar 

  6. Larson, R.R.: A logistic regression approach to distributed IR. In: SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Tampere, Finland, August 11-15, pp. 399–400. ACM Press, New York (2002)

    Chapter  Google Scholar 

  7. Larson, R.R.: Cheshire II at INEX: Using a hybrid logistic regression and boolean model for XML retrieval. In: Proceedings of the First Annual Workshop of the Initiative for the Evaluation of XML retrieval (INEX). DELOS workshop series, pp. 18–25 (2003)

    Google Scholar 

  8. Larson, R.R.: Cheshire II at INEX 2003: Component and algorithm fusion for XML retrieval. In: INEX 2003 Workshop Proceedings, pp. 38–45. University of Duisburg (2004)

    Google Scholar 

  9. Larson, R.R.: A fusion approach to XML structured document retrieval. In: Journal of Information Retrieval (2005) (in press)

    Google Scholar 

  10. Lee, J.H.: Analyses of multiple evidence combination. In: SIGIR 1997: Proceedings of the 20th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Philadelphia, Philadelphia, July 27-31, pp. 267–276. ACM Press, New York (1997)

    Chapter  Google Scholar 

  11. Mass, Y., Mandelbrod, M.: Component ranking and automatic query refinement for xml retrieval. In: Fuhr, N., Lalmas, M., Malik, S., Szlávik, Z. (eds.) INEX 2004. LNCS, vol. 3493, pp. 134–140. Springer, Heidelberg (2005)

    Google Scholar 

  12. Robertson, S.E., Walker, S.: On relevance weights with little relevance information. In: Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 16–24. ACM Press, New York (1997)

    Chapter  Google Scholar 

  13. Robertson, S.E., Walker, S., Hancock-Beauliee, M.M.: OKAPI at TREC-7: ad hoc, filtering, vlc and interactive track. In: Text Retrieval Conference (TREC-7) (Notebook), November 9-1, pp. 152–164 (1998)

    Google Scholar 

  14. Shaw, J.A., Fox, E.A.: Combination of multiple searches. In: Proceedings of the 2nd Text REtrieval Conference (TREC-2). National Institute of Standards and Technology Special Publication 500-215, pp. 243–252 (1994)

    Google Scholar 

  15. Sigurbjrnsson, B., Kamps, J., de Rijke, M.: An element-based approach to xml retrieval. In: INEX 2003 Workshop Proceedings, pp. 19–26. University of Duisburg (2004)

    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

Larson, R.R. (2005). Cheshire II at INEX ’04: Fusion and Feedback for the Adhoc and Heterogeneous Tracks. In: Fuhr, N., Lalmas, M., Malik, S., Szlávik, Z. (eds) Advances in XML Information Retrieval. INEX 2004. Lecture Notes in Computer Science, vol 3493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424550_26

Download citation

  • DOI: https://doi.org/10.1007/11424550_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26166-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics