IRBMO vs. feature selection algorithm boxplot. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Wilcoxon test results for feature selection. by Amal H. Alharbi (21755906)

“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”

Feature selection metrics and their definitions. by Amal H. Alharbi (21755906)

“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”

Statistical summary of all models. by Amal H. Alharbi (21755906)

“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”

Feature selection results. by Amal H. Alharbi (21755906)

“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”

ANOVA test for feature selection. by Amal H. Alharbi (21755906)

“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”

Classification performance of ML and DL models. by Amal H. Alharbi (21755906)

“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”

Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization by Sandeep Jagonda Patil (22048337)

“…The performance of the proposed LEGAN-BEPO-BCMANET technique attains 29.786%, 19.25%, 22.93%, 27.21%, 31.02%, 26.91%, and 25.61% greater throughput, compared to existing methods like Blockchain-based BATMAN protocol utilizing MANET with an ensemble algorithm (BATMAN-MANET), Block chain-based trusted distributed routing scheme with optimized dropout ensemble extreme learning neural network in MANET (DEELNN-MANET), A secured trusted routing utilizing structure of a new directed acyclic graph-blockchain in MANET internet of things environment (DAG-MANET), An Optimized Link State Routing Protocol with Blockchain Framework for Efficient Video-Packet Transmission and Security over MANET (OLSRP-MANET), Auto-metric Graph Neural Network based Blockchain Technology for Protected Dynamic Optimum Routing in MANET (AGNN-MANET) and Data security-based routing in MANETs under key management process (DSR-MANET) respectively.…”

Random forest model performs better than support vector machine algorithms and when it primarily uses spontaneous photopic ERG of 60-s duration in humans. by Ramsés Noguez Imm (6658637)

Pseudo Code of RBMO. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

P-value on CEC-2017(Dim = 30). by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Memory storage behavior. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Elite search behavior. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Description of the datasets. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

S and V shaped transfer functions. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

S- and V-Type transfer function diagrams. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Collaborative hunting behavior. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Friedman average rank sum test results. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

IRBMO vs. variant comparison adaptation data. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Parameter settings. by Yang Cao (53545)

“…<div><p>Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. …”