Copyright © 1991 Published by Elsevier Science Ltd. All rights reserved.
Ranking large document collections by a state space search*1
Received 9 August 1989;
accepted 20 June 1990.
Available online 18 July 2002.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
An algorithm is described for ordering by probability of relevance overlapping document subsets from which a searcher should choose the next document. The algorithm produces the ordering without assumptions of index term independence, improves its performance with increasing feedback, and estimates most accurately the probabilities of relevance of the subsets most likely to be relevant. The efficiency and effectiveness of the algorithm are analyzed theoretically.







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)





