Preferential Infinitesimals for Information Retrieval
In this paper, we propose a preference framework for information retrieval in which the user and the system administrator are enabled to express preference annotations on search keywords and document elements, respectively. Our framework is flexible and allows expressing preferences such as “A is infinitely more preferred than B,” which we capture by using hyperreal numbers. Due to the widespread of XML as a standard for representing documents, we consider XML documents in this paper and propose a consistent preferential weighting scheme for nested document elements. We show how to naturally incorporate preferences on search keywords and document elements into an IR ranking process using the well-known TF-IDF ranking measure.
KeywordsInformation Retrieval Search Keyword System Administrator Inverse Document Frequency Music Information Retrieval
- 2.Bex J. G., F. Neven, T. Schwentick and K. Tuyls. Inference of Concise DTDs from XML Data. Proc. VLDB ′06, pp. 115–126.Google Scholar
- 4.Chowdhury M., A. Thomo, and W. Wadge. Preferential Infinitesimals for Information Retrieval. Full version: http://webhome.cs.uvic.ca/?thomo/papers/aiai09.pdf
- 6.Keisler H. J. Elementary Calculus: An Approach Using Infinitesimals. On-line Edition: http://www.math.wisc.edu/?keisler/keislercalc1.pdf 2002.
- 7.Keisler H. J. Foundations of Infinitesimal Calculus. On-line Edition: http://www.math.wisc.edu/?keisler/foundations.pdf 2007.
- 8.Manning D. C, P. Raghavan and H. Schutze Introduction to Information Retrieval. Cambridge University Press. 2008.Google Scholar
- 12.On-line Internet Shakespeare Edition. English Department, University of Victoria. http://internetshakespeare.uvic.ca/index.html
- 13.Malik S., A. Trotman, M. Lalmas, N. Fuhr. Overview of INEX 2006. Proc. 5th Workshop of the INitiative for the Evaluation of XML Retrieval, pp 1–11, 2007.Google Scholar