MétaCan
Menu
Back to cohort
Record W2373190274

A New Particle Swarm Optimization Based on Three Evolution Model

2011· article· en· W2373190274 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueMicrocomputer applications · 2011
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsnot available
Fundersnot available
KeywordsParticle swarm optimizationComputer scienceMathematical optimizationMulti-swarm optimizationProcess (computing)PopulationMeta-optimizationAlgorithmMathematics
DOInot available

Abstract

fetched live from OpenAlex

Considering that the standard PSO easily falls into local optimization when it solves the multi-extremum problems,a new PSO algorithm that adopts three different evolution models by stages is proposed.In this algorithm,the evolution process is divided into three stages.The first stage is the cognition only model,while the standard model is in the second stage and the third stage is the social only model.The population diversity is increased by using different models in three stages,so that the possibility of getting local extreme value is reduced.The results of simulation show that the proposed algorithm in the paper has the better optimization performance than the standard PSO when solving the multi-extremum 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.000
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.097
Threshold uncertainty score0.755

Codex and Gemma teacher scores by category

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