Computationally tractable probabilistic modeling of Boolean operators (original) (raw)

ACM SIGIR Forum, 1997

Abstract

The inference network model of information retrieval allows for a probabilistic interpretation of Boolean query operators. Prior work has shown, however, that these operators do not perform as well as the pnorrn operators developed in the context of the vector space model. The design of alternativeoperators in the inference network framework must contend with the issue of computational tractability. We define a flexible class of link matrices that are natural candidates for the implementation of Boolean operators and art 0(n2) algorithm for the computation of ...

Warren Greiff hasn't uploaded this paper.

Let Warren know you want this paper to be uploaded.

Ask for this paper to be uploaded.