Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale. حسب Tehnan I. A. Mohamed (16846175)

The Pseudo-Code of the IRBMO Algorithm. حسب 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. meta-heuristic algorithms boxplot. حسب 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. feature selection algorithm boxplot. حسب 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. …"

Pseudo Code of RBMO. حسب 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). حسب 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. حسب 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. حسب 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. حسب 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. حسب 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. حسب 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. حسب 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. حسب 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. حسب 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. …"

Sample image for illustration. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Quadratic polynomial in 2D image plane. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Optimal Timings Codebook.xlsx حسب Emma Spillane (11249121)

Optimal Time Intervals of Breech Births Dataset حسب Emma Spillane (11249121)

Comparison analysis of computation time. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Process flow diagram of CBFD. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"