MétaCan
Menu
Back to cohort
Record W2114113935 · doi:10.1109/grc.2006.1635879

A multilevel searching and re-ranking framework for information retrieval

2006· article· en· W2114113935 on OpenAlex
Miao Wen

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicInformation Retrieval and Search Behavior
Canadian institutionsYork University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRanking (information retrieval)Computer scienceInformation retrievalIndex (typography)Data miningLearning to rankDocument retrievalWorld Wide Web

Abstract

fetched live from OpenAlex

In this paper, we propose a multilevel searching and re-ranking framework (MLSRF) for information retrieval. In this framework, indexes are constructed at multi-level such as document level and passage level. For each topic, we search against each index independently and generate a sub-result for corresponding index. The final result is generated by re-ranking and integrating the sub-results for all the indexes. Experiments on 2004 and 2005 HARD data sets show that the proposed framework can make a positive contribution on both document level retrieval and passage level retrieval. We also investigate the effect of the blind feedback method on TREC HARD data sets. The results show that the performance of blind feedback material depends on the topic it works on.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.832
Threshold uncertainty score0.483

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.023
GPT teacher head0.287
Teacher spread0.264 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it