MétaCan
Menu
Back to cohort
Record W2134511703 · doi:10.1109/ccece.1998.685647

A reliable composite classification strategy

2002· article· en· W2134511703 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Data Classification
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsClassifier (UML)WeightingComputer scienceA priori and a posterioriArtificial intelligencePattern recognition (psychology)Quadratic classifierData miningClassification schemeLinear classifierMachine learningRandom subspace methodTest dataTraining set

Abstract

fetched live from OpenAlex

A composite classification scheme is proposed by combining several classifiers with distinctly different design methodologies. The classifiers are selected from a number of state of the art pattern classification schemes with a view to obtain superior performance. In this scheme, no a priori information except a set of pre-classified data is assumed to be available. By using distinctly different classifiers, the common mode data misclassification is reduced. Traditionally, after the design and evaluation phase, the pre-classified data is discarded. In this scheme, however, the misclassified data from each classifier in the training set is tagged and stored with a view to weight the decisions of the classifiers. If a given test sample is close to a misclassified data cluster of a particular classifier, then the decision made by this classifier is given a lower weighting. The final decision is made by analysing the weighted combination of individual classifier decisions. The proposed algorithm is evaluated on both simulated data and on a biological cell classification problem and it is shown that improved accuracy is obtained when compared to that of the most accurate classifier.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.956
Threshold uncertainty score0.999

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.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.050
GPT teacher head0.265
Teacher spread0.214 · 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

Quick stats

Citations7
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and Data ClassificationFrench-language works237,207