MétaCan
Menu
Back to cohort
Record W1968799289 · doi:10.1145/2808194.2809493

Pooling for User-Oriented Evaluation Measures

2015· article· en· W1968799289 on OpenAlexafffund
Gaurav Baruah, Adam Roegiest, Mark D. Smucker

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of Waterloo
KeywordsPoolingAutomatic summarizationComputer scienceInformation retrievalRelevance (law)Focus (optics)Rank (graph theory)Order (exchange)World Wide WebData miningArtificial intelligence

Abstract

fetched live from OpenAlex

Traditional TREC-style pooling methodology relies on using predicted relevance by systems to select documents for judgment. This coincides with typical search behaviour (e.g., web search). In the case of temporally ordered streams of documents, the order that users encounter documents is in this temporal order and not some predetermined rank order. We investigate a user oriented pooling methodology focusing on the documents that simulated users would likely read in such temporally ordered streams. Under this user model, many of the relevant documents found in the TREC 2013 Temporal Summarization Track's pooling effort would never be read. Not only does our pooling strategy focus on pooling documents that will be read by (simulated) users, the resultant pools are different from the standard TREC pools.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.058
metaresearch head score (Gemma)0.134
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.058
Threshold uncertainty score0.305

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0580.134
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0050.004
Science and technology studies0.0010.002
Scholarly communication0.0050.008
Open science0.0030.004
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.001

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.120
GPT teacher head0.326
Teacher spread0.206 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2015
Admission routes2
Has abstractyes

Explore more

Same topicData Management and AlgorithmsFrench-language works237,207