Skip to main content

Finding Good Elements for Focused Retrieval

  • Conference paper
Advances in Focused Retrieval (INEX 2008)

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

Abstract

This paper describes the integration of our methodology for the dynamic retrieval of XML elements [2] with traditional article retrieval to facilitate the Focused and the Relevant-in-Context Tasks of the INEX 2008 Ad Hoc Track. The particular problems that arise for dynamic element retrieval in working with text containing both tagged and untagged elements have been solved [3]. The current challenge involves utilizing its ability to produce a rank-ordered list of elements in the context of focused retrieval. Our system is based on the Vector Space Model [8]; basic functions are performed using the Smart experimental retrieval system [7]. Experimental results are reported for the Focused, Relevant-in-Context, and Best-in-Context Tasks of both the 2007 and 2008 INEX Ad Hoc Tracks. These results indicate that the goal of our 2008 investigations—namely, finding good focused elements in the context of the Wikipedia collection–has been achieved.

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. Bapat, S.: Improving the results for focused and relevant-in-context tasks. M.S. Thesis, Department of Computer Science, University of Minnesota Duluth (2008), http://www.d.umn.edu/cs/thesis/bapat.pdf

  2. Crouch, C.: Dynamic element retrieval in a structured environment. ACM TOIS 24(4), 437–454 (2006)

    Article  Google Scholar 

  3. Crouch, C., Crouch, D., Kamat, N., Malik, V., Mone, A.: Dynamic element retrieval in the Wikipedia collection. In: Fuhr, N., Kamps, J., Lalmas, M., Trotman, A. (eds.) INEX 2007. LNCS, vol. 4862, pp. 70–79. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Mehta, S.: Finding the best entry point. M.S. Thesis, Department of Computer Science, University of Minnesota Duluth (2008), http://www.d.umn.edu/cs/thesis/mehta.pdf

  5. Mone, A.: Dynamic element retrieval for semi-structured documents. M.S. Thesis, Department of Computer Science, University of Minnesota Duluth (2007), http://www.d.umn.edu/cs/thesis/mone.pdf

  6. Paranjape, D.: Improving focused retrieval. M.S. Thesis, Department of Computer Science, University of Minnesota Duluth (2007), http://www.d.umn.edu/cs/thesis/paranjape.pdf

  7. Salton, G. (ed.): The Smart Rretrieval System—Experiments in Automatic Document Processing. Prentice-Hall, Englewood Cliffs (1971)

    Google Scholar 

  8. Salton, G., Wong, A., Yang, C.S.: A vector space model for automatic indexing. Comm. ACM 18(11), 613–620 (1975)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crouch, C.J., Crouch, D.B., Bapat, S., Mehta, S., Paranjape, D. (2009). Finding Good Elements for Focused Retrieval. In: Geva, S., Kamps, J., Trotman, A. (eds) Advances in Focused Retrieval. INEX 2008. Lecture Notes in Computer Science, vol 5631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03761-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03761-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03760-3

  • Online ISBN: 978-3-642-03761-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics