MétaCan
Menu
Back to cohort
Record W4391392503 · doi:10.5539/cis.v17n1p1

Expanding the Breadth of Ability in Artificial Intelligence Systems with Decision Trees

2024· article· en· W4391392503 on OpenAlexvenueno aff
Andrew McInnis, Mohammad Alshibli, Ahmad Alzaghal, Samir Hamada

Bibliographic record

VenueComputer and Information Science · 2024
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceArtificial intelligenceDecision treeMachine learning

Abstract

fetched live from OpenAlex

This paper introduces a unique perspective. Rather than focusing on improving the already significant achievements of existing artificial intelligence algorithms, it investigates the potential of merging various algorithms to enhance their overall capabilities. Essential design aspects required for this integration are examined, and a prototype system is developed to demonstrate the practical application of these design principles. This method aims to broaden the range of capabilities accessible to a system, addressing the limitation of the narrow focus prevalent in contemporary artificial intelligence.

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.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: Empirical · Consensus signal: none
Teacher disagreement score0.988
Threshold uncertainty score0.863

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.005
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.025
GPT teacher head0.293
Teacher spread0.267 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueComputer and Information ScienceSame topicData Mining Algorithms and ApplicationsFrench-language works237,207