MétaCan
Menu
Back to cohort
Record W1835894572 · doi:10.1109/ccece.2002.1013043

Enhancing the particle swarm optimizer via proper parameters selection

2003· article· en· W1835894572 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 institutionsDalhousie University
Fundersnot available
KeywordsParticle swarm optimizationRange (aeronautics)Mathematical optimizationSelection (genetic algorithm)Swarm intelligenceComputer scienceSwarm behaviourMulti-swarm optimizationProcess (computing)MetaheuristicAlgorithmMathematicsArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

Unlike many other computational intelligence techniques, the particle swarm optimizer (PSO) has few parameters to tune. However, properly chosen values for these parameters can positively affect the accuracy of the obtained results as well as the time consumed during the search process. Many parameters have been added to the originally developed PSO to modify or to improve the performance of the technique but yet, the swarm size, number of iterations and individuals flying velocities are still the most dominant parameters. The paper examines the PSO's parameters, describes their characteristics and provides guidelines for determining values for these parameters. A quick statistical experiment is used to fine-tune these parameters for the class of constrained optimization problem considered. The results show that the particle swarm optimizer is quite robust and provides good solution for reasonable choice of the values of the parameters within fairly wide range.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.318
Threshold uncertainty score0.420

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.026
GPT teacher head0.268
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