Title
Integrating Boolean queries in conjunctive normal form with probabilistic retrieval models
Abstract
Most commercial document retrieval systems require queries to be valid Boolean expressions that may be used to split the set of available documents into a subset consisting of documents to be retrieved and a subset of documents not to be retrieved. Research has suggested that the ranking of documents and use of relevance feedback may significantly improve retrieval performance. We suggest that by placing Boolean database queries into Conjunctive Normal Form, a conjunction of disjunctions, and by making the assumption that the disjunctions represent a hyperfeature, documents to be retrieved can be probabilistically ranked and relevance feedback incorporated, improving retrieval performance. Experimental results compare the performance of a sequential learning probabilistic retrieval model with both the proposed integrated Boolean-probabilistic model and with a fuzzy-set model.
Year
DOI
Venue
1988
10.1016/0306-4573(88)90097-0
Inf. Process. Manage.
Keywords
Field
DocType
probabilistic retrieval model,integrating boolean query,conjunctive normal form,mathematical models,feedback,relevance information retrieval,information retrieval
Data mining,Divergence-from-randomness model,Relevance feedback,Information retrieval,Computer science,Conjunctive normal form,Standard Boolean model,Relevance (information retrieval),Probabilistic logic,Document retrieval,Boolean expression
Journal
Volume
Issue
ISSN
24
3
Information Processing and Management
Citations 
PageRank 
References 
15
3.33
12
Authors
2
Name
Order
Citations
PageRank
Robert M. Losee127636.01
Abraham Bookstein2710480.57