2015
DOI: 10.1007/s00521-015-1941-9
|View full text |Cite
|
Sign up to set email alerts
|

A modified particle swarm optimization algorithm using Renyi entropy-based clustering

Abstract: An algorithm proposed using Renyi entropy clustering to improve the searching ability of traditional particle swarm optimization (PSO) is introduced in this study. Modified PSO consists of two steps. In the first step, particles in initial population are sorted according to Renyi entropy clustering method, and in the second step, some particles are removed from population and some new particles are added instead of them based on the sorted list. Thus, a reliable new initial population is created. When using so… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 12 publications
(18 reference statements)
0
2
0
Order By: Relevance
“…The Renyi entropy, as an extension of the information entropy, reflects the features of the signal in terms of its time–frequency distribution. 28 Compared to information entropy, Renyi entropy is more sensitive to the subtle signal changes, making it easier to identify small changes in the signal. Therefore, this paper optimizes the PSO algorithm based on the Renyi entropy model, and obtains characteristics information of the particle swarm in the search process.…”
Section: Theoretical Descriptionsmentioning
confidence: 99%
“…The Renyi entropy, as an extension of the information entropy, reflects the features of the signal in terms of its time–frequency distribution. 28 Compared to information entropy, Renyi entropy is more sensitive to the subtle signal changes, making it easier to identify small changes in the signal. Therefore, this paper optimizes the PSO algorithm based on the Renyi entropy model, and obtains characteristics information of the particle swarm in the search process.…”
Section: Theoretical Descriptionsmentioning
confidence: 99%
“…Particle swarm optimisation (PSO) [ 34 ] can use entropy for the simulated set of states (“particles”) (EA-PSO) [ 12 ], and then it may apply cross-entropy in the meta-optimisation of the search space. Various modifications and extensions exist, such as memetic based [ 13 ], niche strategy [ 35 ], or clustering [ 36 ]. The evolutionary approach is used in Hu et al [ 37 ], while Zhang et al [ 38 ] employs direct competition.…”
Section: Related Workmentioning
confidence: 99%
“…Exploring the topological neighborhood of the k-nearest neighbors and employing pattern search are considered to be useful tools to improve the performance of PSO [15]. Cormark [16] proposed a PSO procedure using Renyi entropy clustering, which contains two steps, initialization and particle removal. Bharti and Singh [17] proposed a binary PSO procedure with an opposition-based learning mechanism using chaotic mapping, dynamic inertia weight, and a mutation operator.…”
Section: Introductionmentioning
confidence: 99%