We give a principled method for allowing users to assign subjective weights to the importance of search terms, that is, the terms forming a query, in information retrieval systems. For example, our method makes it possible for a user to say that she cares twice as much about the rst search term as the second search term, and to obtain a ranked list of results that reeects this preference. Our method is based upon a simple formula derived from any existing \unweighted" ranking function. A naive application of the weighted formula would require issuing as many distinct queries as there are search terms, thus damaging the response time of the retrieval. We explain here how to \smoothly" integrate the formula in most retrieval engines, so as not to aaect the retrieval performance in terms of response time.
[1]
Ronald Fagin,et al.
Incorporating User Preferences in Multimedia Queries
,
1997,
ICDT.
[2]
Michael McGill,et al.
Introduction to Modern Information Retrieval
,
1983
.
[3]
Yoelle Maarek,et al.
Full text indexing based on lexical relations an application: software libraries
,
1989,
SIGIR '89.
[4]
Gerard Salton,et al.
Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer
,
1989
.
[5]
Yoelle Maarek.
Software library construction from an IR perspective
,
1991,
SIGF.
[6]
Donna K. Harman,et al.
Ranking Algorithms
,
1992,
Information Retrieval: Data Structures & Algorithms.