Box plots with swarm overlays for six feature selection algorithms, annotated with mean and standard deviation values. حسب Doaa Sami Khafaga (21463870)

Line plots showing performance trends for six evaluation metrics across CNN combined with different bio-inspired optimization algorithms. حسب Doaa Sami Khafaga (21463870)

Density distribution plot of performance metrics for various feature selection algorithms: bOcOA, bPSO, bGWO, bFA, bGA, and bWAO. حسب Doaa Sami Khafaga (21463870)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some high-dimensional datasets usi... حسب Olaide N. Oyelade (14047002)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some medium-sized dimensional data... حسب Olaide N. Oyelade (14047002)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some small-sized dimensional datas... حسب Olaide N. Oyelade (14047002)

Fig 4 - حسب Olaide N. Oyelade (14047002)

Fig 7 - حسب Olaide N. Oyelade (14047002)

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

"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"

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

"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"

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

"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"

Precision recall curve. حسب Indhumathi S. (19173013)

"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"

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

"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"

PathOlOgics_RBCs Python Scripts.zip حسب Ahmed Elsafty (16943883)

"…</p><p dir="ltr">In terms of classification, a second algorithm was developed and employed to preliminary sort or group the individual cells (after excluding the overlapping cells manually) into different categories using five geometric measurements applied to the extracted contour from each binary image mask (see PathOlOgics_script_2; preliminary shape measurements). …"

Machine Learning-Ready Dataset for Cytotoxicity Prediction of Metal Oxide Nanoparticles حسب Soham Savarkar (21811825)

"…</p><p dir="ltr"><b>Applications and Model Compatibility:</b></p><p dir="ltr">The dataset is optimized for use in supervised learning workflows and has been tested with algorithms such as:</p><p dir="ltr">Gradient Boosting Machines (GBM),</p><p dir="ltr">Support Vector Machines (SVM-RBF),</p><p dir="ltr">Random Forests, and</p><p dir="ltr">Principal Component Analysis (PCA) for feature reduction.…"