MétaCan
Menu
Back to cohort
Record W2170004572 · doi:10.1109/cec.2006.1688373

A Genetic Binary Particle Swarm Optimization Model

2006· article· en· W2170004572 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsParticle swarm optimizationMulti-swarm optimizationSwarm behaviourComputer scienceBinary numberPopulationMathematical optimizationGenetic algorithmMetaheuristicAlgorithmArtificial intelligenceMathematicsMachine learning

Abstract

fetched live from OpenAlex

In this paper, a Genetic Binary Particle Swarm Optimization (GBPSO) model is proposed, and its performance is compared with the regular binary Particle Swarm Optimizer (PSO), introduced by Kennedy and Eberhart. In the original model, the size of the swarm was fixed. In our model, we introduce birth and death operations in order to make the population very dynamic. Since birth and mortality rates change naturally with time, our model allows oscillations in the size of the population. Compared to the original PSO model, and Genetic Algorithms, our strategy proposes a more natural simulation of the social behavior of intelligent animals. The experimental results show that compared to original PSO, our GBPSO model can reach broader domains in the search space and converge faster in very high dimensional and complex environments.

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.105
Threshold uncertainty score0.358

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.021
GPT teacher head0.262
Teacher spread0.240 · 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