Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Aizawa N. A. An Information-Theoretic Perspective of TF-IDF measures. Inf. Process. Manage. 39(1): 45–65, 2003.
Bex J. G., F. Neven, T. Schwentick and K. Tuyls. Inference of Concise DTDs from XML Data. Proc. VLDB ′06, pp. 115–126.
Bruggemann-Klein A. and D. Wood. One-Unambiguous Regular Languages. Inf. Comput. 140(2): 229–253, 1998.
Chowdhury M., A. Thomo, and W. Wadge. Preferential Infinitesimals for Information Retrieval. Full version: http://webhome.cs.uvic.ca/?thomo/papers/aiai09.pdf
Liu B. Web Data Mining: Exploring Hyperlinks, Contents and Usage Data. Springer, Berlin Heidelberg, 2007.
Keisler H. J. Elementary Calculus: An Approach Using Infinitesimals. On-line Edition: http://www.math.wisc.edu/?keisler/keislercalc1.pdf 2002.
Keisler H. J. Foundations of Infinitesimal Calculus. On-line Edition: http://www.math.wisc.edu/?keisler/foundations.pdf 2007.
Manning D. C, P. Raghavan and H. Schutze Introduction to Information Retrieval. Cambridge University Press. 2008.
Shannon C. E. A Mathematical Theory of Communication. The Bell System Technical Journal 27: 379–423, 1948.
Robertson S. Understanding Inverse Document Frequency: On theoretical arguments for IDF. J. of Documentation 60: 503–520, 2004.
Rondogiannis P., and W. W. Wadge. Minimum Model Semantics for Logic Programs with Negation-as-Failure. ACM Trans. Comput. Log. 6 (2): 441–467, 2005.
On-line Internet Shakespeare Edition. English Department, University of Victoria. http://internetshakespeare.uvic.ca/index.html
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chowdhury, M., Thomo, A., Wadge, W.W. (2009). Preferential Infinitesimals for Information Retrieval. In: Iliadis, Maglogiann, Tsoumakasis, Vlahavas, Bramer (eds) Artificial Intelligence Applications and Innovations III. AIAI 2009. IFIP International Federation for Information Processing, vol 296. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0221-4_15
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0221-4_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0220-7
Online ISBN: 978-1-4419-0221-4
eBook Packages: Computer ScienceComputer Science (R0)
Keywords
- Information Retrieval
- Search Keyword
- System Administrator
- Inverse Document Frequency
- Music Information Retrieval
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.