MétaCan
Menu
Back to cohort
Record W2130573243 · doi:10.1109/ijcnn.2005.1556171

Estimating accurate multi-class probabilities with support vector machines

2006· article· en· W2130573243 on OpenAlex
Jonathan Milgram, Mohamed Cheriet, Robert Sabourin

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. 2005 IEEE International Joint Conference on Neural Networks, 2005. · 2006
Typearticle
Languageen
FieldComputer Science
TopicFace and Expression Recognition
Canadian institutionsÉcole de Technologie SupérieureUniversité du Québec à Montréal
Fundersnot available
KeywordsSoftmax functionSupport vector machineComputer sciencePattern recognition (psychology)Artificial intelligenceProbabilistic logicClass (philosophy)Function (biology)Machine learningAlgorithmArtificial neural network

Abstract

fetched live from OpenAlex

In this paper, we propose a comparison of several post-processing methods for estimating multi-class probabilities with standard support vector machines. The different approaches have been tested on a real pattern recognition problem with a large number of training samples. The best results have been obtained by using a "one against air coupling strategy along with a softmax function optimized by minimizing the negative log-likelihood of the training data. Finally, the analysis of the error-reject tradeoff have shown that SVM allows to estimate probabilities more accurate than a classical MLP, which is indeed promising in the view of incorporated within pattern recognition system using probabilistic framework.

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 categoriesMeta-epidemiology (narrow)
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.573
Threshold uncertainty score1.000

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.0010.002
Open science0.0010.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.043
GPT teacher head0.272
Teacher spread0.229 · 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