One advantage of our algorithm is that it is not binary in nature. by Yong Kuk Kim (13955214)

Several loop patterns found in binary code. by Alba Pedro-Zapater (8600382)

Histograms of various water quality parameters, including pH, Hardness, Solids, Chloramines, Sulfate, Organic Carbon, Trihalomethanes, Turbidity, and a binary portability check. by Amal H. Alharbi (21755906)

Hyperparameters of the LSTM Model. by Ahmed M. Elshewey (21463867)

“…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …”

The AD-PSO-Guided WOA LSTM framework. by Ahmed M. Elshewey (21463867)

“…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …”

Prediction results of individual models. by Ahmed M. Elshewey (21463867)

“…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …”

Classification performance after optimization. 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 optimization 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. …”

Wilcoxon test results for optimization. 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. …”

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. …”

Sample image for illustration. by Indhumathi S. (19173013)

“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Comparison analysis of computation time. by Indhumathi S. (19173013)

“…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. by Indhumathi S. (19173013)

“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Precision recall curve. by Indhumathi S. (19173013)

“…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. by Indhumathi S. (19173013)

“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”