MétaCan
Menu
Back to cohort
Record W104995555 · doi:10.63317/5n34rmh7y5bw

Cost-Sensitive Learning in Answer Extraction

2008· article· en· W104995555 on OpenAlexaff
Michael Wiegand, Jochen L. Leidner, Dietrich Klakow

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsThomson Reuters (Canada)
FundersUniversität des SaarlandesBundesministerium für Bildung und ForschungDeutsche Forschungsgemeinschaft
KeywordsComputer scienceMachine learningArtificial intelligenceClass (philosophy)Task (project management)Set (abstract data type)Training setData mining

Abstract

fetched live from OpenAlex

One problem of data-driven answer extraction in open-domain factoid question answering is that the class distribution of labeled training data is fairly imbalanced.This imbalance has a deteriorating effect on the performance of resulting classifiers.In this paper, we propose a method to tackle class imbalance by applying some form of cost-sensitive learning which is preferable to sampling.We present a simple but effective way of estimating the misclassification costs on the basis of the class distribution.This approach offers three benefits.Firstly, it maintains the distribution of the classes of the labeled training data.Secondly, this form of meta-learning can be applied to a wide range of common learning algorithms.Thirdly, this approach can be easily implemented with the help of state-of-the-art machine learning software.

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.014
metaresearch head score (Gemma)0.063
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.014
Threshold uncertainty score0.075

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0140.063
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0030.003
Science and technology studies0.0010.002
Scholarly communication0.0030.007
Open science0.0030.004
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0020.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.027
GPT teacher head0.301
Teacher spread0.274 · 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 designSimulation or modeling
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

Citations1
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicNatural Language Processing TechniquesFrench-language works237,207