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

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

Density distribution plot of performance metrics for various feature selection algorithms: bOcOA, bPSO, bGWO, bFA, bGA, and bWAO. by 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... by 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... by 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... by Olaide N. Oyelade (14047002)

Fig 4 - by Olaide N. Oyelade (14047002)

Fig 7 - by Olaide N. Oyelade (14047002)

MCLP_quantum_annealer_V0.5 by Anonymous Anonymous (4854526)

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. 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. 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. 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. 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. 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. 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. 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. 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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”

Data_Sheet_1_Alzheimer’s Disease Diagnosis and Biomarker Analysis Using Resting-State Functional MRI Functional Brain Network With Multi-Measures Features and Hippocampal Subfield... by Uttam Khatri (12689072)

“…Finally, we implemented and compared the different feature selection algorithms to integrate the structural features, brain networks, and voxel features to optimize the diagnostic identifications of AD using support vector machine (SVM) classifiers. …”

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

“…Data sources included peer-reviewed publications and reputable open-access repositories such as the NanoPharos database. …”