The DOI matches its Crossref record; 92 of the 92 references it cites were found in a registry or an index.
Towards augmented kernel extreme learning models for bankruptcy prediction: Algorithmic behavior and comprehensive analysis
Abstract
Abstract Bankruptcy prediction is a crucial application in financial fields to aid in accurate decision making for business enterprises. Many models may stagnate to low-accuracy results due to the uninformed choice of parameters. This paper presents a forward-thinking bankruptcy prediction model based on kernel extreme learning machine (KELM), which proposes a new efficient version of a fruit fly optimization (FOA) algorithm called LSEOFOA, to evolve and harmonize the penalty and the kernel parameter in KELM. The upgraded version of FOA is conceptualized based on three reorganizations. The first attempt is to include Levy's flight for improving exploration inclinations, and the second is slime mould-based process for avoiding premature convergence and enhancing the stability of the exploration and exploitation patterns. As the last modification, we utilized the elite opposition-based learning for accelerating the convergence. The algorithmic trends of this optimizer are verified, and then, it is verified on a bankruptcy prediction module. Therefore, to further demonstrate the superiority of the LSEOFOA method, comparison studies are performed using the conventional FOA and other variants of FOA and a set of advanced algorithms including EBOwithCMAR. Experimental results for every optimization task demonstrate that LSEOFOA can provide a high-performance and self-assured tradeoff between exploration and exploitation. Also, the developed KELM classifier is utilized for bankruptcy prediction, and its optimal parameters set are revealed by the proposed FOA. The effectiveness of the LSEOFOA-KELM model is rigorously evaluated using a financial dataset and comparison with KELM-based models with other competitive optimizers such as LSHADE-RSP. Overall research findings show that the proposed model is superior in terms of classification accuracy, Matthews correlation coefficient, sensitivity, and specificity. Towards more evolutionary and efficient prediction models, the proposed LSEOFOA-KELM prediction model can be regarded as a promising warning tool for financial decision making, with successful performance in bankruptcy prediction.
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
Extreme learning machine: Theory and applications
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2006) · Neurocomputing · doi:10.1016/j.neucom.2005.12.126 · Cited by 13,285
Harris hawks optimization: Algorithm and applications
Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & Chen, H. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.02.028 · Cited by 6,324
Self-citationExtreme Learning Machine for Regression and Multiclass Classification
Huang, G.-B., Zhou, H., Ding, X., & Zhang, R. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2168604 · Cited by 5,550
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
Slime mould algorithm: A new method for stochastic optimization
Li, S., Chen, H., Wang, M., Heidari, A. A., & Mirjalili, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.03.055 · Cited by 3,036
Self-citationA new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example
Pan, W.-T. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.07.001 · Cited by 1,543
Automatically Designing CNN Architectures Using the Genetic Algorithm for Image Classification
Sun, Y., Xue, B., Zhang, M., Yen, G. G., & Lv, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2983860 · Cited by 870
Evolving Deep Convolutional Neural Networks for Image Classification
Sun, Y., Xue, B., Zhang, M., & Yen, G. G. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2916183 · Cited by 775
2018 IEEE Congress on Evolutionary Computation (CEC)
(2018) · doi:10.1109/cec40672.2018 · Cited by 555
Cited by
Yang, Y., Chen, H., Heidari, A. A., & Gandomi, A. H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114864 · Cited by 1,062
Self-citationThe Colony Predation Algorithm
Tu, J., Chen, H., Wang, M., & Gandomi, A. H. (2021) · Journal of Bionic Engineering · doi:10.1007/s42235-021-0050-y · Cited by 571
Self-citationKianfar, E. (2021) · Journal of Nanobiotechnology · doi:10.1186/s12951-021-00896-3 · Cited by 471
Saber, A., Sakr, M., Abo-Seida, O. M., Keshk, A., & Chen, H. (2021) · IEEE Access · doi:10.1109/access.2021.3079204 · Cited by 419
Self-citationMagnetic Nanoparticles in Targeted Drug Delivery: a Review
kianfar, E. (2021) · Journal of Superconductivity and Novel Magnetism · doi:10.1007/s10948-021-05932-9 · Cited by 280
Metadata
- Authors
- Zhang, Y., Liu, R., Heidari, A. A., Wang, X., Chen, Y., Wang, M., & Chen, H.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2021-03
- Volume
- 430
- Pages
- 185-212
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W3094221378
- Cited by
- 261
- References
- 92
- FWCI
- 21.69
- 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.