Titre du document / Document title
Systematic weighting and ranking : Cutting the Gordian knot
Auteur(s) / Author(s)
DAVIS C. H. (1) ;
MCKIM G. W. (1) ;
Affiliation(s) du ou des auteurs / Author(s) Affiliation(s)
(1) School of Library and Information Science, Indiana University, Bloomington, IN 47405, ETATS-UNIS
Résumé / Abstract
A powers-of-two algorithm is described that automatically creates discrete, well-defined, and unique result sets, displaying them in decreasing order of likely relevance. All computations are transparent, and a simple query form allows the searcher to focus on the choice of terms and their sequence-an implicit indicator of their relative importance. The program can be used with traditional databases or with search engines designed for the Word Wide Web. It also can be used with an intelligent agent to search the Web with a pushdown store, returning only those items that best reflect the searcher's stated interests.
Revue / Journal Title
Journal of the American Society for Information Science
ISSN
0002-8231
CODEN AISJB6
Source / Source
1999, vol. 50, n
o7, pp. 626-628 (7 ref.)
Langue / Language
Anglais
Editeur / Publisher
John Wiley & Sons, New York, NY, ETATS-UNIS
(1970-2000)
(Revue)
Mots-clés anglais / English Keywords
;
;
;
;
;
Mots-clés français / French Keywords
;
;
;
;
;
Mots-clés espagnols / Spanish Keywords
;
;
;
;
;
Localisation / Location
INIST-CNRS, Cote INIST : 6025, 35400008416944.0060
Nº notice refdoc (ud4) : 1795720
