The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Enhancing Learning Efficiency of Brain Storm Optimization via Orthogonal Learning Design
Abstract
In brain storm optimization (BSO), the convergent operation utilizes a clustering strategy to group the population into multiple clusters, and the divergent operation uses this cluster information to generate new individuals. However, this mechanism is inefficient to regulate the exploration and exploitation search. This article first analyzes the main factors that influence the performance of BSO and then proposes an orthogonal learning framework to improve its learning mechanism. In this framework, two orthogonal design (OD) engines (i.e., exploration OD engine and exploitation OD engine) are introduced to discover and utilize useful search experiences for performance improvements. In addition, a pool of auxiliary transmission vectors with different features is maintained and their biases are also balanced by the OD decision mechanism. Finally, the proposed algorithm is verified on a set of benchmarks and is adopted to resolve the quantitative association rule mining problem considering the support, confidence, comprehensibility, and netconf. The experimental results show that the proposed approach is very powerful in optimizing complex functions. It not only outperforms previous versions of the BSO algorithm but also outperforms several famous OD-based algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
Alcalá‐Fdez, J., Fernández, A., Luengo, J., Derrac, J., García, S., Sánchez, L., & Herrera, F. (2011) · Repositorio de la Universidad de Oviedo (RUO) · Cited by 2,730
Hidden Order: How Adaptation Builds Complexity
Malina, R. F., & Holland, J. H. (1996) · Leonardo · doi:10.2307/1576256 · Cited by 2,488
Inspiration for optimization from social insect behaviour
Bonabeau, E., Dorigo, M., & Theraulaz, G. (2000) · Nature · doi:10.1038/35017500 · Cited by 912
Hidden Order: How Adaptation Builds Complexity.
Koza, J. R. (1995) · Artificial Life · doi:10.1162/artl.1995.2.3.333 · Cited by 779
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
Self-citationNumber-theoretic Methods in Statistics
Fang, K.-T., & Wang, Y. (1994) · Springer eBooks · doi:10.1007/978-1-4899-3095-8 · Cited by 638
Number-Theoretic Methods in Statistics.
Ripley, B. D., Fang, K.-T., & Wang, Y. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983421 · Cited by 621
Awad, N. H., Ali, M. Z., & Suganthan, P. N. (2017) · 2017 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969336 · Cited by 473
Single objective real-parameter optimization: Algorithm jSO
Brest, J., Maucec, M. S., & Boskovic, B. (2017) · 2017 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969456 · Cited by 446
A Novel Artificial Bee Colony Algorithm Based on Modified Search Equation and Orthogonal Learning
Gao, W.-F., Liu, S.-Y., & Huang, L.-L. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2222373 · Cited by 397
An orthogonal genetic algorithm for multimedia multicast routing
Zhang, Q., & Leung, Y.-W. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.752920 · Cited by 269
OPSO: Orthogonal Particle Swarm Optimization and Its Application to Task Assignment Problems
Ho, S.-Y., Lin, H.-S., Liauh, W.-H., & Ho, S.-J. (2008) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2007.914796 · Cited by 251
Enhancing the search ability of differential evolution through orthogonal crossover
Wang, Y., Cai, Z., & Zhang, Q. (2012) · Information Sciences · doi:10.1016/j.ins.2011.09.001 · Cited by 246
Kumar, A., Misra, R. K., & Singh, D. (2017) · 2017 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969524 · Cited by 241
Brain storm optimization algorithm: a review
Cheng, S., Qin, Q., Chen, J., & Shi, Y. (2016) · Artificial Intelligence Review · doi:10.1007/s10462-016-9471-0 · Cited by 232
Self-citationAn Optimization Algorithm Based on Brainstorming Process
Shi, Y. (2011) · International Journal of Swarm Intelligence Research · doi:10.4018/ijsir.2011100103 · Cited by 224
Self-citationAn Optimization Algorithm Based on Brainstorming Process
Shi, Y. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-2479-5.ch008 · Cited by 179
Self-citationA modified brain storm optimization
Zhan, Z., Zhang, J., Shi, Y., & Liu, H. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256594 · Cited by 158
Self-citationGlobal-best brain storm optimization algorithm
El-Abd, M. (2017) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2017.05.001 · Cited by 109
Martín, D., Suárez, A. R., Alcalá‐Fdez, J., & Herrera, F. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2285016 · Cited by 100
Ma, L., Wang, X., Huang, M., Lin, Z., Tian, L., & Chen, H. (2017) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2017.2723483 · Cited by 98
Self-citationXiong, G., Shi, D., & Duan, X. (2013) · Computers & Operations Research · doi:10.1016/j.cor.2013.07.021 · Cited by 59
Multiple strategies based orthogonal design particle swarm optimizer for numerical optimization
Qin, Q., Cheng, S., Zhang, Q., Wei, Y., & Shi, Y. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2015.02.008 · Cited by 55
Self-citationBrain storm optimization algorithm with re-initialized ideas and adaptive step size
El-Abd, M. (2016) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2016.7744125 · Cited by 31
A Brain Storm Optimization With Multi-Information Interactions for Global Optimization Problems
Li, C., Song, Z., Fan, J., Cheng, Q., & Liu, P. X. (2018) · IEEE Access · doi:10.1109/access.2018.2821118 · Cited by 29
A Vector Grouping Learning Brain Storm Optimization Algorithm for Global Optimization Problems
Li, C., Hu, D., Song, Z., Feng, Y., Luo, Z., Fan, J., & Liu, P. X. (2018) · IEEE Access · doi:10.1109/access.2018.2884862 · Cited by 12
Chaotic predator-prey brain storm optimization for continuous optimization problems
Qiu, H., Duan, H., Zhou, Z., Xiao-gang, H., & Shi, Y. (2017) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci.2017.8280821 · Cited by 5
Self-citationBrain Storm Optimization Algorithms: More Questions than Answers
Cheng, S., Lu, H., Lei, X., & Shi, Y. (2019) · Adaptation, learning, and optimization · doi:10.1007/978-3-030-15070-9_1 · Cited by 5
Self-citation
Cited by
Human Activity Recognition Data Analysis: History, Evolutions, and New Trends
Ariza-Colpas, P. P., Vicario, E., Oviedo-Carrascal, A. I., Butt Aziz, S., Piñeres-Melo, M. A., Quintero-Linero, A., & Patara, F. (2022) · Sensors · doi:10.3390/s22093401 · Cited by 52
Metadata
- Authors
- Ma, L., Cheng, S., & Shi, Y.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Published
- 2021-11
- Volume
- 51
- Issue
- 11
- Pages
- 6723-6742
- ISSN
- 2168-2216 (ISSN-L)
- 2168-2232
- OpenAlex
- W3000881061
- Cited by
- 307
- References
- 33
- FWCI
- 21.03
- 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.