MétaCan
Menu
Back to cohort
Record W2772539238 · doi:10.1109/smc.2017.8122931

Improving firefly algorithm performance using fuzzy logic

2017· article· en· W2772539238 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 Regina
Fundersnot available
KeywordsFirefly algorithmBenchmark (surveying)Fuzzy logicFirefly protocolMathematical optimizationComputer scienceSet (abstract data type)AlgorithmMathematicsArtificial intelligenceParticle swarm optimization

Abstract

fetched live from OpenAlex

Exploration and exploitation are two strategies used to search the problem space in Evolutionary Algorithms (EAs). To significantly increase the performance of these optimization techniques in terms of the solution optimality is to strike the right balance between exploration and exploitation. Firefly is one of the most favored EAs. In this study, we introduce an entire fuzzy system to tune dynamically the firefly parameters in order to keep the exploration and exploitation in balance in each of the searching steps. A serious concern of EAs is to be stuck in local optimum solutions. The proposed fuzzy controller helps the firefly algorithm to converge to the optimal solution and escape from local optimums. To evaluate the efficiency of the fuzzy-based firefly algorithm, we conduct experiments on a set of high dimensional benchmark functions. The goal here is to compare the new firefly method with the standard firefly and well-known nature-inspired optimization algorithms. The results of the experiments show the superiority of the proposed Fuzzy firefly algorithm over the standard one.

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 categoriesScholarly communication
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.995
Threshold uncertainty score1.000

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.0010.000
Scholarly communication0.0010.001
Open science0.0020.001
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.065
GPT teacher head0.328
Teacher spread0.262 · 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