TY - GEN
T1 - An exploration of axiomatic approaches to information retrieval
AU - Fang, Hui
AU - Zhai, Chengxiang
PY - 2005
Y1 - 2005
N2 - Existing retrieval models generally do not offer any guarantee for optimal retrieval performance. Indeed, it is even difficult, if not impossible, to predict a model's empirical performance analytically. This limitation is at least partly caused by the way existing retrieval models are developed where relevance is only coarsely modeled at the level of documents and queries as opposed to a finer granularity level of terms. In this paper, we present a new axiomatic approach to developing retrieval models based on direct modeling of relevance with formalized retrieval constraints defined at the level of terms. The basic idea of this axiomatic approach is to search in a space of candidate retrieval functions for one that can satisfy a set of reasonable retrieval constraints. To constrain the search space, we propose to define a retrieval function inductively and decompose a retrieval function into three component functions. Inspired by the analysis of the existing retrieval functions with the inductive definition, we derive several new retrieval functions using the axiomatic retrieval framework. Experiment results show that the derived new retrieval functions are more robust and less sensitive to parameter settings than the existing retrieval functions with comparable optimal performance.
AB - Existing retrieval models generally do not offer any guarantee for optimal retrieval performance. Indeed, it is even difficult, if not impossible, to predict a model's empirical performance analytically. This limitation is at least partly caused by the way existing retrieval models are developed where relevance is only coarsely modeled at the level of documents and queries as opposed to a finer granularity level of terms. In this paper, we present a new axiomatic approach to developing retrieval models based on direct modeling of relevance with formalized retrieval constraints defined at the level of terms. The basic idea of this axiomatic approach is to search in a space of candidate retrieval functions for one that can satisfy a set of reasonable retrieval constraints. To constrain the search space, we propose to define a retrieval function inductively and decompose a retrieval function into three component functions. Inspired by the analysis of the existing retrieval functions with the inductive definition, we derive several new retrieval functions using the axiomatic retrieval framework. Experiment results show that the derived new retrieval functions are more robust and less sensitive to parameter settings than the existing retrieval functions with comparable optimal performance.
KW - TF-IDF weighting
KW - asxiomatic model
KW - constraints
KW - formal models
KW - retrieval heuristics
UR - http://www.scopus.com/inward/record.url?scp=84885658479&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84885658479&partnerID=8YFLogxK
U2 - 10.1145/1076034.1076116
DO - 10.1145/1076034.1076116
M3 - Conference contribution
AN - SCOPUS:84885658479
SN - 1595930345
SN - 9781595930347
T3 - SIGIR 2005 - Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
SP - 480
EP - 487
BT - SIGIR 2005 - Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
T2 - 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2005
Y2 - 15 August 2005 through 19 August 2005
ER -