Binary Independence Model

From Wikipedia, the free encyclopedia
Jump to: navigation, search

The Binary Independence Model (BIM)[1][2] is a probabilistic information retrieval technique that makes some simple assumptions to make the estimation of document/query similarity probability feasible.

Definitions[edit]

The Binary Independence Assumption is that documents are binary vectors. That is, only the presence or absence of terms in documents are recorded. Terms are independently distributed in the set of relevant documents and they are also independently distributed in the set of irrelevant documents. The representation is an ordered set of Boolean variables. That is, the representation of a document or query is a vector with one Boolean element for each term under consideration. More specifically, a document is represented by a vector d = (x1, ..., xm) where xt=1 if term t is present in the document d and xt=0 if it's not. Many documents can have the same vector representation with this simplification. Queries are represented in a similar way. "Independence" signifies that terms in the document are considered independently from each other and no association between terms is modeled. This assumption is very limiting, but it has been shown that it gives good enough results for many situations. This independence is the "naive" assumption of a Naive Bayes classifier, where properties that imply each other are nonetheless treated as independent for the sake of simplicity. This assumption allows the representation to be treated as an instance of a Vector space model by considering each term as a value of 0 or 1 along a dimension orthogonal to the dimensions used for the other terms.

The probability P(R|d,q) that a document is relevant derives from the probability of relevance of the terms vector of that document P(R|x,q). By using the Bayes rule we get:

P(R|x,q) = \frac{P(x|R,q)*P(R|q)}{P(x|q)}

where P(x|R=1,q) and P(x|R=0,q) are the probabilities of retrieving a relevant or nonrelevant document, respectively. If so, then that document's representation is x. The exact probabilities can not be known beforehand, so use estimates from statistics about the collection of documents must be used.

P(R=1|q) and P(R=0|q) indicate the previous probability of retrieving a relevant or nonrelevant document respectively for a query q. If, for instance, we knew the percentage of relevant documents in the collection, then we could use it to estimate these probabilities. Since a document is either relevant or nonrelevant to a query we have that:

P(R=1|x,q) + P(R=0|x,q) = 1

Query Terms Weighting[edit]

Given a binary query and the dot product as the similarity function between a document and a query, the problem is to assign weights to the terms in the query such that the retrieval effectiveness will be high. Let p_i and q_i be the probability that a relevant document and an irrelevant document has the i^{th} term respectively. Yu and Salton,[1] who first introduce BIM, propose that the weight of the i^{th} term is an increasing function of Y_i =  \frac{p_i *(1-q_i)}{(1-p_i)*q_i}. Thus, if Y_i is higher than Y_j, the weight of term i will be higher than that of term j. Yu and Salton[1] showed that such a weight assignment to query terms yields better retrieval effectiveness than if query terms are equally weighted. Robertson and Spärck Jones[2] later showed that if the i^{th} term is assigned the weight of log Y_i, then optimal retrieval effectiveness is obtained under the Binary Independence Assumption.

The Binary Independence Model was introduced by Yu and Salton.[1] The name Binary Independence Model was coined by Robertson and Spärck Jones.[2]

See also[edit]

Further reading[edit]

References[edit]

  1. ^ a b c d Yu, C. T.; Salton, G. (1976). "Precision Weighting – An Effective Automatic Indexing Method". Journal of the ACM 23: 76. doi:10.1145/321921.321930.  edit
  2. ^ a b c Robertson, S. E.; Spärck Jones, K. (1976). "Relevance weighting of search terms". Journal of the American Society for Information Science 27 (3): 129. doi:10.1002/asi.4630270302.  edit