MétaCan
Menu
Back to cohort
Record W2009371048 · doi:10.1109/tevc.2013.2252852

Guest Editorial: Special Issue on Understanding Complex Evolutionary Systems

2013· editorial· en· W2009371048 on OpenAlexaff
Daniel Ashlock, Graham Kendall, Siang Yew Chong

Bibliographic record

VenueIEEE Transactions on Evolutionary Computation · 2013
Typeeditorial
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsComputer scienceEvolutionary computationJudgementEvolutionary algorithmSet (abstract data type)Simple (philosophy)Data scienceArtificial intelligenceSelection (genetic algorithm)Quality (philosophy)Range (aeronautics)Management scienceTheoretical computer scienceMachine learningEpistemology

Abstract

fetched live from OpenAlex

Evolutionary computation research frequently relies on the analysis of the time, and know solutions or measures of the quality of solutions found as metrics for comparing different selection schemes, representations, and operators. While these are important tools, more nuanced tools are helpful even when trying to understand relatively simple evolutionary optimizers, and can be critical when coevolution or multicriteria optimization is being performed. The range of useful tools is broad, including theorems, visualizations, new metrics, and novel analysis techniques. This Special Issue presents six papers that include all of these. The purpose of this Special Issue is to expand our tool set for understanding the behavior of complex evolutionary systems. In the judgement of this writer, it is a good beginning, giving many examples, surveying known techniques, presenting new techniques, and giving many possible next steps. A brief summary of each article is provided.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.011
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Editorial · Consensus signal: Editorial
Teacher disagreement score0.025
Threshold uncertainty score0.084

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.011
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0030.001
Science and technology studies0.0020.001
Scholarly communication0.0060.004
Open science0.0020.001
Research integrity0.0060.010
Insufficient payload (model declined to judge)0.0250.014

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.028
GPT teacher head0.270
Teacher spread0.242 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreEditorial

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
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Evolutionary ComputationSame topicEvolutionary Algorithms and ApplicationsFrench-language works237,207