ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing & Management
Volume 27, Issue 1, 1991, Pages 27-41
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1342 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
Special issue
View Record in Scopus
 
doi:10.1016/0306-4573(91)90029-L    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1991 Published by Elsevier Science Ltd. All rights reserved.

Ranking large document collections by a state space search*1

Michael D. Gordon

Computer and Information Systems, School of Business, University of Michigan, Ann Arbor, MI 48109-1234, U.S.A.

Received 9 August 1989; 
accepted 20 June 1990. 
Available online 18 July 2002.

Purchase the full-text article



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.

Article Outline

• References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.