2020
DOI: 10.1155/2020/6858541
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Multi-Swarm Differential Learning Quantum Bird Swarm Algorithm and Its Application in Random Forest Classification Model

Abstract: Bird swarm algorithm is one of the swarm intelligence algorithms proposed recently. However, the original bird swarm algorithm has some drawbacks, such as easy to fall into local optimum and slow convergence speed. To overcome these short-comings, a dynamic multi-swarm differential learning quantum bird swarm algorithm which combines three hybrid strategies was established. First, establishing a dynamic multi-swarm bird swarm algorithm and the differential evolution strategy was adopted to enhance the randomne… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 53 publications
(71 reference statements)
0
8
0
Order By: Relevance
“…Based on the ID3 algorithm, the C4.5 algorithm is proposed [ 26 ]. Several improved algorithms are proposed later to meet the needs of processing large-scale data sets, such as the Supervised Learning In Quest (SLIQ) algorithm and the Scalable Parallelizable Induction of Classification Tree (SPRINT) algorithm [ 27 ]. Among the above algorithms, the ID3 algorithm is the representative of the decision tree algorithm, and most decision tree algorithms are improved on its basis.…”
Section: Methodsmentioning
confidence: 99%
“…Based on the ID3 algorithm, the C4.5 algorithm is proposed [ 26 ]. Several improved algorithms are proposed later to meet the needs of processing large-scale data sets, such as the Supervised Learning In Quest (SLIQ) algorithm and the Scalable Parallelizable Induction of Classification Tree (SPRINT) algorithm [ 27 ]. Among the above algorithms, the ID3 algorithm is the representative of the decision tree algorithm, and most decision tree algorithms are improved on its basis.…”
Section: Methodsmentioning
confidence: 99%
“…Rule 2 is formulated mathematically as follows: where C and S are 2 positive numbers; the previous is named as the cognitive accelerated co-efficient, and the final is named as the social accelerated co-efficient. At this point, p i , j represents the i th bird optimum preceding place and g j signifies the optimum previous swarm place [ 20 ].…”
Section: Proposed Modelmentioning
confidence: 99%
“…the-Art Algorithm. To further verify the performance of the ICSO algorithm, DMSDL-QBSA which is a state-of-the-art algorithm proposed in the literature [18] is also used to compare with the ICSO algorithm in this section. In order to make the experimental comparison fairer and more reasonable, the parameter settings of the ICSO algorithm are the same as those of DMSDL-QBSA, that is, the population size is set to 30, and the maximum number of iterations is set to 100000.…”
Section: Experimental Comparison Between Icso and A State-of-mentioning
confidence: 99%
“…Therefore, it has a wide range of applications [ 15 , 16 ]. At present, it has been applied in optimization calculation [ 17 , 18 ], workshop scheduling [ 19 , 20 ], image engineering [ 21 ], network structure optimization [ 22 ], vehicle routing problem [ 23 ], control of teleoperating systems, and other fields [ 24 ].…”
Section: Introductionmentioning
confidence: 99%