By Topic

An evaluation of new and old similarity ranking algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Lynch, P. ; Comput. Sci. Branch, Nat. Libr. of Med., Bethesda, MD, USA ; Luan, X. ; Prettyman, M. ; Mericle, L.
more authors

The National Library of Medicine's (NLM) IRVIS project has been evaluating "similarity ranking" algorithms that reorder search results according to their similarity to a target result. Several variations of known ranking algorithms were tested, as well as one (we believe) new one which weights terms based on word length. When the algorithms were evaluated using the OHSUMED test collection, the new word length based algorithm was found to outperform the others.

Published in:

Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on  (Volume:2 )

Date of Conference:

5-7 April 2004