Survival density particle swarm optimization for neural network training

Hongbo Liu, Bo Li, Xiukun Wang, Ye Ji, Yiyuan Tang

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Scopus citations

Abstract

The Particle Swarm Optimizer (PSO) has previously been used to train neural networks and generally met with success. The advantage of the PSO over many of the other optimization algorithms is its relative simplicity and quick convergence. But those particles collapse so quickly that it exits a potentially dangerous property: stagnation, which state would make it impossible to arrive at the global optimum, even a local optimum. The ecological and physical universal laws enlighten us to improve the PSO algorithm. We introduce a concept, swarm's survival density, into PSO for balancing the gravity and repulsion forces between two particles. A modified algorithm, survival density particle swarm optimization (SDPSO) is proposed for neural network training in this paper. Then it is applied to benchmark function minimization problems and neural network training for benchmark dataset classification problems. The experimental results illustrate its efficiency.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsFuliang Yin, Chengan Guo, Jun Wang
PublisherSpringer-Verlag
Pages332-337
Number of pages6
ISBN (Print)3540228411, 9783540228417
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3173
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint Dive into the research topics of 'Survival density particle swarm optimization for neural network training'. Together they form a unique fingerprint.

Cite this