Fuzzy retrieval

Short description: Information retrieval technique

Fuzzy retrieval techniques are based on the Extended Boolean model and the Fuzzy set theory. There are two classical fuzzy retrieval models: Mixed Min and Max (MMM) and the Paice model. Both models do not provide a way of evaluating query weights, however this is considered by the P-norms algorithm.

Mixed Min and Max model (MMM)

In fuzzy-set theory, an element has a varying degree of membership, say d_A, to a given set A instead of the traditional membership choice (is an element/is not an element).
In MMM each index term has a fuzzy set associated with it. A document's weight with respect to an index term A is considered to be the degree of membership of the document in the fuzzy set associated with A. The degree of membership for union and intersection are defined as follows in Fuzzy set theory:

[math]\displaystyle{ d_{A\cap B}= min(d_A, d_B) }[/math]

[math]\displaystyle{ d_{A\cup B}= max(d_A,d_B) }[/math]

According to this, documents that should be retrieved for a query of the form A or B, should be in the fuzzy set associated with the union of the two sets A and B. Similarly, the documents that should be retrieved for a query of the form A and B, should be in the fuzzy set associated with the intersection of the two sets. Hence, it is possible to define the similarity of a document to the or query to be max(d_A, d_B) and the similarity of the document to the and query to be min(d_A, d_B). The MMM model tries to soften the Boolean operators by considering the query-document similarity to be a linear combination of the min and max document weights.

Given a document D with index-term weights d_A1, d_A2, ..., d_An for terms A₁, A₂, ..., A_n, and the queries:

Q_or = (A₁ or A₂ or ... or A_n)
Q_and = (A₁ and A₂ and ... and A_n)

the query-document similarity in the MMM model is computed as follows:

SlM(Q_or, D) = C_or1 * max(d_A1, d_A2, ..., d_An) + C_or2 * min(d_A1, d_A2, ..., d_An)
SlM(Q_and, D) = C_and1 * min(d_A1, d_A2, ..., d_An) + C_and2 * max(d_A1, d_A2 ..., d_An)

where C_or1, C_or2 are "softness" coefficients for the or operator, and C_and1, C_and2 are softness coefficients for the and operator. Since we would like to give the maximum of the document weights more importance while considering an or query and the minimum more importance while considering an and query, generally we have C_or1 > C_or2 and C_and1 > C_and2. For simplicity it is generally assumed that C_or1 = 1 - C_or2 and C_and1 = 1 - C_and2.

Lee and Fox experiments indicate that the best performance usually occurs with C_and1 in the range [0.5, 0.8] and with C_or1 > 0.2. In general, the computational cost of MMM is low, and retrieval effectiveness is much better than with the Standard Boolean model.

Paice model

The Paice model is a general extension to the MMM model. In comparison to the MMM model that considers only the minimum and maximum weights for the index terms, the Paice model incorporates all of the term weights when calculating the similarity:

[math]\displaystyle{ S(D,Q) = \sum_{i=1}^n\frac{r^{i-1}*w_{di}}{\sum_{j=1}^n r^{j-1}} }[/math]

where r is a constant coefficient and w_di is arranged in ascending order for and queries and descending order for or queries. When n = 2 the Paice model shows the same behavior as the MMM model.

The experiments of Lee and Fox have shown that setting the r to 1.0 for and queries and 0.7 for or queries gives good retrieval effectiveness. The computational cost for this model is higher than that for the MMM model. This is because the MMM model only requires the determination of min or max of a set of term weights each time an and or or clause is considered, which can be done in O(n). The Paice model requires the term weights to be sorted in ascending or descending order, depending on whether an and clause or an or clause is being considered. This requires at least an 0(n log n) sorting algorithm. A good deal of floating point calculation is needed too.

Improvements over the Standard Boolean model

Lee and Fox compared the Standard Boolean model with MMM and Paice models with three test collections, CISI, CACM and INSPEC. These are the reported results for average mean precision improvement:

	CISI	CACM	INSPEC
MMM	68%	109%	195%
Paice	77%	104%	206%

These are very good improvements over the Standard model. MMM is very close to Paice and P-norm results which indicates that it can be a very good technique, and is the most efficient of the three.

Recent work

In 2005, Kang et al.. have devised a fuzzy retrieval system indexed by concept identification.

If we look at documents on a pure Tf-idf approach, even eliminating stop words, there will be words more relevant to the topic of the document than others and they will have the same weight because they have the same term frequency. If we take into account the user intent on a query we can better weight the terms of a document. Each term can be identified as a concept in a certain lexical chain that translates the importance of that concept for that document.
They report improvements over Paice and P-norm on the average precision and recall for the Top-5 retrieved documents.

Zadrozny revisited the fuzzy information retrieval model. He further extends the fuzzy extended Boolean model by:

• assuming linguistic terms as importance weights of keywords also in documents
• taking into account the uncertainty concerning the representation of documents and queries
• interpreting the linguistic terms in the representation of documents and queries as well as their matching in terms of the Zadeh's fuzzy logic (calculus of linguistic statements)
• addressing some pragmatic aspects of the proposed model, notably the techniques of indexing documents and queries

The proposed model makes it possible to grasp both imprecision and uncertainty concerning the textual information representation and retrieval.

See also

• Information retrieval

Further reading

• Fox, E.; S. Betrabet; M. Koushik; W. Lee (1992), Information Retrieval: Algorithms and Data structures; Extended Boolean model, Prentice-Hall, Inc., https://www.scribd.com/doc/13742235/Information-Retrieval-Data-Structures-Algorithms-William-B-Frakes