MétaCan
Menu
Back to cohort
Record W2171206798 · doi:10.1109/icmla.2009.37

Discretization Techniques and Genetic Algorithm for Learning the Classification Method PROAFTN

2009· article· en· W2171206798 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
TopicData Mining Algorithms and Applications
Canadian institutionsSaint John Regional HospitalUniversity of New Brunswick
Fundersnot available
KeywordsDiscretizationComputer scienceOne-class classificationStatistical classificationArtificial intelligenceMachine learningGenetic algorithmClass (philosophy)AlgorithmMulticlass classificationData classificationData miningPattern recognition (psychology)MathematicsSupport vector machine

Abstract

fetched live from OpenAlex

This paper introduces new techniques for learning the classification method PROAFTN from data. PROAFTN is a multi-criteria classification method and belongs to the class of supervised learning algorithms. To use PROAFTN for classification, some parameters must be obtained for this purpose. Therefore, an automatic method to extract these parameters from data with minimum classification errors is required. Here, discretization techniques and genetic algorithms are proposed for establishing these parameters and then building the classification model. Based on the obtained results, the newly proposed approach outperforms widely used classification methods.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.958
Threshold uncertainty score0.192

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.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.021
GPT teacher head0.312
Teacher spread0.290 · 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

Citations4
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207