MétaCan
Menu
Back to cohort
Record W4298237571 · doi:10.48550/arxiv.1803.03877

On dynamic ensemble selection and data preprocessing for multi-class\n imbalance learning

2018· preprint· W4298237571 on OpenAlexaff
Rafael M. O. Cruz, Robert Sabourin, George D. C. Cavalcanti

Bibliographic record

VenuearXiv (Cornell University) · 2018
Typepreprint
Language
FieldComputer Science
TopicImbalanced Data Classification Techniques
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsPreprocessorEnsemble learningComputer scienceArtificial intelligenceClass (philosophy)Machine learningSelection (genetic algorithm)Data pre-processingData miningBinary numberPattern recognition (psychology)Mathematics

Abstract

fetched live from OpenAlex

Class-imbalance refers to classification problems in which many more\ninstances are available for certain classes than for others. Such imbalanced\ndatasets require special attention because traditional classifiers generally\nfavor the majority class which has a large number of instances. Ensemble of\nclassifiers have been reported to yield promising results. However, the\nmajority of ensemble methods applied too imbalanced learning are static ones.\nMoreover, they only deal with binary imbalanced problems. Hence, this paper\npresents an empirical analysis of dynamic selection techniques and data\npreprocessing methods for dealing with multi-class imbalanced problems. We\nconsidered five variations of preprocessing methods and four dynamic selection\nmethods. Our experiments conducted on 26 multi-class imbalanced problems show\nthat the dynamic ensemble improves the F-measure and the G-mean as compared to\nthe static ensemble. Moreover, data preprocessing plays an important role in\nsuch cases.\n

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 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.001
metaresearch head score (Gemma)0.001
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.876
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0040.004
Research integrity0.0010.001
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.148
GPT teacher head0.272
Teacher spread0.124 · 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 teacher head, not a consensus.

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

Citations0
Published2018
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicImbalanced Data Classification TechniquesFrench-language works237,207