Query term weights as constraints in fuzzy information retrieval

The generalization of the Boolean information retrieval model has presented several problems, especially with respect to query weighting. Assuming some recent ideas, which outline the need for two levels of query weighting, we propose two different semantics for Boolean expression weights and term w...

Full description

Saved in:
Bibliographic Details
Published inInformation processing & management Vol. 27; no. 1; pp. 15 - 26
Main Authors Bordogna, G., Carrara, P., Pasi, G.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 1991
Elsevier Science
Pergamon Press
Elsevier Science Ltd
Subjects
Online AccessGet full text
ISSN0306-4573
1873-5371
DOI10.1016/0306-4573(91)90028-K

Cover

More Information
Summary:The generalization of the Boolean information retrieval model has presented several problems, especially with respect to query weighting. Assuming some recent ideas, which outline the need for two levels of query weighting, we propose two different semantics for Boolean expression weights and term weights. By interpreting query term weights as constraints on document representations, we formally define them in the fuzzy set theoretical context and show how this formalization satisfies the wish-list clarified by Cater and Kraft.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0306-4573
1873-5371
DOI:10.1016/0306-4573(91)90028-K