Computationally tractable probabilistic modeling of Boolean operators
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Analyses of multiple evidence combination
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
PIC matrices: a computationally tractable class of probabilistic query operators
ACM Transactions on Information Systems (TOIS)
Information Retrieval System for XML Documents
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Extended Boolean retrieval for systematic biomedical reviews
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
| Hi-index | 0.00 |
Many extended Boolean models such as fuzzy set, $p$-norm, et al. have been proposed in the information retrieval literature to support ranking facility for the Boolean retrieval system. They can be explained within the same framework, and each extended Boolean model is characterized by evaluation formulas for AND and OR operations. A variety of operators have been also developed in the area of fuzzy set theory for AND and OR operations, and can be used in extended Boolean models. In this paper we analyze the behavioral aspects of various operators for AND and OR operations, and address important properties in terms of retrieval effectiveness. Our analyses show that the four properties, namely single operand dependency, negative compensation, double operand dependency and unequal importance decrease retrieval effectiveness in some circumstances. This suggests that the two properties, namely positive compensation and equal importance might help retrieval effectiveness. We also provide the experimental results that coincide with our analyses.