MétaCan
Menu
Back to cohort
Record W3123641332 · doi:10.4018/jdsst.2013040103

A Concurrent Modelling to Generate Alternatives Approach Using the Firefly Algorithm

2013· article· en· W3123641332 on OpenAlex
Raha Imanirad, Xin‐She Yang, Julian Scott Yeomans

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

VenueInternational Journal of Decision Support System Technology · 2013
Typearticle
Languageen
FieldDecision Sciences
TopicComplex Systems and Decision Making
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceFirefly algorithmImplementationMathematical optimizationFirefly protocolAlgorithmMathematics

Abstract

fetched live from OpenAlex

Real world” decision-making applications generally contain multifaceted performance requirements riddled with incongruent performance specifications. There are invariably unmodelled elements, not apparent during model construction, which can greatly impact the acceptability of the model’s solutions. Consequently, it is preferable to generate numerous alternatives that provide dissimilar approaches to the problem. These alternatives should possess near-optimal objective measures with respect to all known objective(s), but be maximally different from each other in terms of their decision variables. This maximally different solution creation approach is referred to as modelling-to-generate-alternatives (MGA). This study demonstrates how the Firefly Algorithm can concurrently create multiple solution alternatives that both satisfy required system performance criteria and yet are maximally different in their decision spaces. This new approach is computationally efficient, since it permits the concurrent generation of multiple, good solution alternatives in a single computational run rather than the multiple implementations required in previous MGA procedures.

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.005
metaresearch head score (Gemma)0.001
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.888
Threshold uncertainty score0.978

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0030.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0050.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.159
GPT teacher head0.415
Teacher spread0.257 · 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