MétaCan
Menu
Back to cohort
Record W2558678654 · doi:10.1109/cec.2016.7744130

An superior tracking artificial bee colony for global optimization problems

2016· article· en· W2558678654 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
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsUniversity of Manitoba
FundersNational Natural Science Foundation of China
KeywordsArtificial bee colony algorithmBenchmark (surveying)Bees algorithmDimension (graph theory)Convergence (economics)Computer scienceGlobal optimizationMathematical optimizationTracking (education)PopulationOptimization problemArtificial intelligenceMetaheuristicAlgorithmMathematics

Abstract

fetched live from OpenAlex

In order to improve the performance of original artificial bee colony (ABC) algorithm for global optimization problems in terms of solution accuracy and convergence speed, a superior tracking artificial bee colony (STABC) is presented in this paper. In STABC, the updating mechanism for bees is transformed from one-dimension-wise to all-dimension-wise. In addition, this strategy enables bees always to track the superior individuals in population. Experimental comparisons are conducted on twelve benchmark functions with various properties. Compared with the involved algorithms, experiment results demonstrate the remarkable improvement of the proposed algorithm for global optimization problems.

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.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: Methods · Consensus signal: Methods
Teacher disagreement score0.786
Threshold uncertainty score0.399

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.048
GPT teacher head0.326
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