MétaCan
Menu
Back to cohort
Record W2143482925

Constrained classification on structured data

2008· article· en· W2143482925 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

VenueJournal of Bioresource Management · 2008
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image and Video Retrieval Techniques
Canadian institutionsAlberta Cancer FoundationUniversity of Alberta
Fundersnot available
KeywordsConditional random fieldRandom forestIndependent and identically distributed random variablesSupport vector machineComputer scienceArtificial intelligenceRandom fieldPixelPattern recognition (psychology)SegmentationField (mathematics)Machine learningImage segmentationRandom variableMathematicsStatistics
DOInot available

Abstract

fetched live from OpenAlex

Most standard learning algorithms, such as Logistic Re-gression (LR) and the Support Vector Machine (SVM), are designed to deal with i.i.d. (independent and identi-cally distributed) data. They therefore do not work ef-fectively for tasks that involve non-i.i.d. data, such as “region segmentation”. (Eg, the “tumor vs non-tumor” labels in a medical image are correlated, in that adja-cent pixels typically have the same label.) This has mo-tivated the work in random fields, which has produced classifiers for such non-i.i.d. data that are significantly better than standard i.i.d.-based classifiers. However, these random field methods are often too slow to be trained for the tasks they were designed to solve. This paper presents a novel variant, Pseudo Conditional Ran-dom Fields (PCRFs), that is also based on i.i.d. learners, to allow efficient training but also incorporates correla-tions, like random fields. We demonstrate that this sys-tem is as accurate as other random fields variants, but significantly faster to train.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.926
Threshold uncertainty score0.332

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.0020.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.074
GPT teacher head0.305
Teacher spread0.230 · 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