MétaCan
Menu
Back to cohort
Record W2086997424 · doi:10.1145/1854776.1854846

Genomics information retrieval using a Bayesian model for learning and re-ranking

2010· article· en· W2086997424 on OpenAlex

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
TopicAlgorithms and Data Compression
Canadian institutionsYork University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRanking (information retrieval)Computer scienceGenomicsBernoulli distributionBayesian probabilityPaceProperty (philosophy)Bernoulli's principleMachine learningBayesian inferenceArtificial intelligenceData miningMathematicsStatisticsEngineeringGenomeBiology

Abstract

fetched live from OpenAlex

The use of large-scale experimental techniques and biomedical tools has increased the pace at which biologists produce useful information. This promotes us to propose a Bayesian model for learning and re-ranking to boost genomics information retrieval performance. We first describe a general model for discovering the property of each passage. Then, we examine a Bernoulli distribution as the prior distribution and provide an efficient way to obtain the training passages for parameter estimation, according to the characterizations of the Bernoulli distribution. Later, we evaluate our proposed model by conducting extensive experiments on the TREC 2007 and 2006 Genomics data sets. The experimental results show the effectiveness of the proposed model for improving performance on two years' TREC Genomics data sets. Furthermore, the conclusions and future prospects are also discussed.

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.000
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.899
Threshold uncertainty score0.258

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.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.018
GPT teacher head0.262
Teacher spread0.244 · 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

Quick stats

Citations0
Published2010
Admission routes2
Has abstractyes

Explore more

Same topicAlgorithms and Data CompressionFrench-language works237,207