The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
A Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design
Abstract
An evolutionary recurrent network which automates the design of recurrent neural/fuzzy networks using a new evolutionary learning algorithm is proposed in this paper. This new evolutionary learning algorithm is based on a hybrid of genetic algorithm (GA) and particle swarm optimization (PSO), and is thus called HGAPSO. In HGAPSO, individuals in a new generation are created, not only by crossover and mutation operation as in GA, but also by PSO. The concept of elite strategy is adopted in HGAPSO, where the upper-half of the best-performing individuals in a population are regarded as elites. However, instead of being reproduced directly to the next generation, these elites are first enhanced. The group constituted by the elites is regarded as a swarm, and each elite corresponds to a particle within it. In this regard, the elites are enhanced by PSO, an operation which mimics the maturing phenomenon in nature. These enhanced elites constitute half of the population in the new generation, whereas the other half is generated by performing crossover and mutation operation on these enhanced elites. HGAPSO is applied to recurrent neural/fuzzy network design as follows. For recurrent neural network, a fully connected recurrent neural network is designed and applied to a temporal sequence production problem. For recurrent fuzzy network design, a Takagi-Sugeno-Kang-type recurrent fuzzy network is designed and applied to dynamic plant control. The performance of HGAPSO is compared to both GA and PSO in these recurrent networks design problems, demonstrating its superiority.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 1×
“Recently, a new evolutionary computation technique, the particle swarm optimization (PSO), is proposed [ 13 ], [14].”
MethodGenetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
del Valle, Y., Venayagamoorthy, G. K., Mohagheghi, S., Hernandez, J.-C., & Harley, R. G. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.896686 · Cited by 2,277
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Gad, A. G. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09694-4 · Cited by 1,869
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
“One straightforward idea is to combine PSO with different evolutionary algorithms, such as genetic algorithms [26], differential evolution [27], and ant colony optimization [28], [29].”
MethodA social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
Orthogonal Learning Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Shi, Y.-H. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2052054 · Cited by 725
Gao, S., Zhou, M., Wang, Y., Cheng, J., Yachi, H., & Wang, J. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2846646 · Cited by 698
Civicioglu, P., & Besdok, E. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-011-9276-0 · Cited by 669
Analysis of the Publications on the Applications of Particle Swarm Optimisation
Poli, R. (2008) · Journal of Artificial Evolution and Applications · doi:10.1155/2008/685175 · Cited by 651
Particle Swarm Optimization With an Aging Leader and Challengers
Chen, W.-N., Zhang, J., Lin, Y., Chen, N., Zhan, Z.-H., Chung, H. S.-H., Li, Y., & Shi, Y.-H. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2173577 · Cited by 635
Metaheuristic design of feedforward neural networks: A review of two decades of research
Ojha, V. K., Abraham, A., & Snášel, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.013 · Cited by 606
Genetic Learning Particle Swarm Optimization
Gong, Y.-J., Li, J.-J., Zhou, Y., Li, Y., Chung, H. S.-H., Shi, Y.-H., & Zhang, J. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2475174 · Cited by 563
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
Banks, A., Vincent, J., & Anyakoha, C. (2008) · Natural Computing · doi:10.1007/s11047-007-9050-z · Cited by 472
A hybrid genetic algorithm and bacterial foraging approach for global optimization
Kim, D. H., Abraham, A., & Cho, J. H. (2007) · Information Sciences · doi:10.1016/j.ins.2007.04.002 · Cited by 469
Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application
Houssein, E. H., Gad, A. G., Hussain, K., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100868 · Cited by 466
RetractedWang, M., Chen, H., Yang, B., Zhao, X., Hu, L., Cai, Z., Huang, H., & Tong, C. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.04.060 · Cited by 450
Accurate, Robust, and Flexible Real-time Hand Tracking
Sharp, T., Keskin, C., Robertson, D., Taylor, J., Shotton, J., Kim, D., Rhemann, C., Leichter, I., Vinnikov, A., Wei, Y., et al. (2015) · Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems · doi:10.1145/2702123.2702179 · Cited by 431
Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems
Sun, C., Jin, Y., Cheng, R., Ding, J., & Zeng, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2675628 · Cited by 425
Particle Swarm Optimization and Intelligence: Advances and Applications
Parsopoulos, K. E., & Vrahatis, M. N. (2010) · doi:10.13140/2.1.3681.1206 · Cited by 371
A particle swarm optimization algorithm for mixed-variable optimization problems
Wang, F., Zhang, H., & Zhou, A. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100808 · Cited by 321
Firefly algorithm with neighborhood attraction
Wang, H., Wang, W., Zhou, X., Sun, H., Zhao, J., Yu, X., & Cui, Z. (2017) · Information Sciences · doi:10.1016/j.ins.2016.12.024 · Cited by 315
Particle Swarm Optimisation: A Historical Review Up to the Current Developments
Freitas, D., Lopes, L. G., & Morgado-Dias, F. (2020) · Entropy · doi:10.3390/e22030362 · Cited by 310
An efficient optimization approach for designing machine learning models based on genetic algorithm
Hamdia, K. M., Zhuang, X., & Rabczuk, T. (2021) · Neural Computing and Applications · doi:10.1007/s00521-020-05035-x · Cited by 301
A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm
Zeng, N., Wang, Z., Liu, W., Zhang, H., Hone, K., & Liu, X. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3029748 · Cited by 269
Particle swarm optimization: Hybridization perspectives and experimental illustrations
Thangaraj, R., Pant, M., Abraham, A., & Bouvry, P. (2011) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.12.053 · Cited by 264
Recent advances in neuro-fuzzy system: A survey
Shihabudheen, K. V., & Pillai, G. N. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.04.014 · Cited by 261
Hybrid Particle Swarm Optimization With Wavelet Mutation and Its Industrial Applications
Ling, S. H., Iu, H. H. C., Chan, K. Y., Lam, H. K., Yeung, B. C. W., & Leung, F. H. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.921005 · Cited by 259
Metadata
- Authors
- Juang, C.-F.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 2004-04
- Volume
- 34
- Issue
- 2
- Pages
- 997-1006
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2164531580
- Cited by
- 964
- References
- 43
- FWCI
- 34.91
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.