MétaCan
Menu
Back to cohort
Record W2569302311 · doi:10.1177/1541931215591251

Capturing Non-linear Judgment Policies Using Decision Tree Models of Classification Behavior

2015· article· en· W2569302311 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.

Bibliographic record

VenueProceedings of the Human Factors and Ergonomics Society Annual Meeting · 2015
Typearticle
Languageen
FieldEngineering
TopicMilitary Defense Systems Analysis
Canadian institutionsUniversité LavalThales (Canada)
Fundersnot available
KeywordsDecision treeComputer scienceMachine learningLinear modelLinear regressionArtificial intelligenceDecision tree learningTask (project management)Data miningDecision support systemTree (set theory)MathematicsEngineering

Abstract

fetched live from OpenAlex

Policy capturing is a decision analysis method that typically uses linear statistical modeling to estimate the basis of expert judgments. Using more flexible data mining algorithms may yield more accurate models or instead result in poor functional estimations. The objective of this study is to test the effectiveness of a decision tree induction algorithm for policy capturing in comparison to the standard linear approach. We examined human classification behavior using a simulated naval air-defense task in order to empirically compare the C4.5 decision tree algorithm to linear regression on their ability to capture individual decision policies. The pattern of results shows that C4.5 outperformed linear regression in terms of goodness-of-fit and cross-validation accuracy. Results also show that the decision tree models of individuals’ judgment policies actually classified contacts more accurately than their human counterparts. We conclude that non-linear policy capturing can yield useful models for training and decision support applications.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.509
Threshold uncertainty score0.631

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.000
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.050
GPT teacher head0.254
Teacher spread0.203 · 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