Treffer: TREC-5 Ad Hoc retrieval using K nearest-neighbors Re-scoring
Title:
TREC-5 Ad Hoc retrieval using K nearest-neighbors Re-scoring
Authors:
Source:
TREC-5 Text REtrieval ConferenceNIST special publication. (500238):415-425
Publisher Information:
Gaithersburg, MD: National Institute of Standards and Technology, 1997.
Publication Year:
1997
Physical Description:
print, 5 ref
Original Material:
INIST-CNRS
Subject Terms:
Science technology, industry, Sciences et technologies, industries, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Sciences de l'information. Documentation, Information science. Documentation, Traitement et recherche de l'information, Information processing and retrieval, Recherche de l'information. Relation homme machine, Information retrieval. Man machine relationship, Processus de recherche. Evaluation, Research process. Evaluation, Sciences de l'information et de la communication, Information and communication sciences, Traitement et recherche d'information, Analyse morphologique, Morphological analysis, Análisis morfológico, Classement, Filing, Clasificación, Evaluation performance, Performance evaluation, Evaluación prestación, Question documentaire, Query, Pregunta documental, Recherche information, Information retrieval, Recuperación información, Traitement automatisé, Automated processing, Tratamiento automatizado, Bigramme, Elargissement question, K nearest-neighbors, Okapi, Reformulation, Score, Traitement question, Question processing
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
IBM T. J. Watson Research Center, POB 718, Yorktown Heights, NY 10598, United States
ISSN:
1048-776X
Rights:
Copyright 1998 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Sciences of information and communication. Documentation
FRANCIS
FRANCIS
Accession Number:
edscal.2237094
Database:
PASCAL Archive
Weitere Informationen
AA. focus on improving on baseline results obtained from another search engine by means of automatic query expansion. They call the specific formula used for query expansion Knn re-scoring, where Knn stands for K nearest-neighbors. The first-pass ranking is done using Okapi system's basic scoring formula. The documents are theen rescored using the same formula with the top-ranked K documents as queries, weighted according to their first-pass scores. The formula is motivated by viewing the rescoring process as a Markov process. This approach improves the precision outside the topK retrieved documents. They have implemented a query expansion scheme using all the words and some of the bigrams in the topK documents.