MétaCan
Menu
Back to cohort

GAM Oversampling and GMM Based Resampling Algorithm for Classification of Imbalanced Sensitive Credit Data Sets

2025· article· W4416873441 on OpenAlexaff
M Rithani, R Subhash, R S SyamDev

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicImbalanced Data Classification Techniques
Canadian institutionsHorizon College and Seminary
Fundersnot available
KeywordsOversamplingUndersamplingResamplingRobustness (evolution)Jackknife resamplingBoosting (machine learning)Class (philosophy)Pattern recognition (psychology)

Abstract

fetched live from OpenAlex

Class imbalance remains a significant challenge in many datasets, whereby one class has considerably fewer samples than another, making it difficult to analyze and conduct research based on that dataset. It deals with resampling methodologies, especially oversampling and undersampling techniques, which are used to even out the class labels for imbalanced datasets. In particular, we introduce a new hybrid resampling technique based on Generative Adversarial Model Oversampling (GAMO) and Gaussian Mixture Model (GMM)-based grouping. The hybrid method is tested against standard approaches like SMOTE. This method gives not just higher accuracy in resampling data but also accounts for the protection of sensitive data, leaving vulnerabilities that are usually found in conventional methods. In this work, we demonstrate experimentally that our GAMOGMM hybrid approach can improve the representativeness and robustness of numerical datasets, which in turn strengthens the performance of deep learning models in impactful 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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.076
GPT teacher head0.355
Teacher spread0.278 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicImbalanced Data Classification TechniquesFrench-language works237,207