Search alternatives:
process optimization » robust optimization (Expand Search), model optimization (Expand Search), policy optimization (Expand Search)
based optimization » whale optimization (Expand Search), bayesian optimization (Expand Search)
phase process » whole process (Expand Search)
binary phase » final phase (Expand Search), binary mask (Expand Search)
process optimization » robust optimization (Expand Search), model optimization (Expand Search), policy optimization (Expand Search)
based optimization » whale optimization (Expand Search), bayesian optimization (Expand Search)
phase process » whole process (Expand Search)
binary phase » final phase (Expand Search), binary mask (Expand Search)
-
1
-
2
-
3
-
4
A* Path-Finding Algorithm to Determine Cell Connections
Published 2025“…Pixel paths were classified using a z-score brightness threshold of 1.21, optimized for noise reduction and accuracy. The A* algorithm then evaluated connectivity by minimizing Euclidean distance and heuristic cost between cells. …”
-
5
-
6
Classification performance after optimization.
Published 2025“…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. …”
-
7
ANOVA test for optimization results.
Published 2025“…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. …”
-
8
Wilcoxon test results for optimization.
Published 2025“…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. …”
-
9
Dataset 1: Zip file containing the figures of the presented methods and results in jpeg files
Published 2025“…<p dir="ltr">Figures represented here illustrates the <b>metaheuristic-based band selection framework</b> for hyperspectral image classification using <b>Binary Jaya Algorithm enhanced with a mutation operator</b> to improve population diversity and avoid premature convergence. …”
-
10
Wilcoxon test results for feature selection.
Published 2025“…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. …”
-
11
Feature selection metrics and their definitions.
Published 2025“…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. …”
-
12
Statistical summary of all models.
Published 2025“…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. …”
-
13
Feature selection results.
Published 2025“…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. …”
-
14
ANOVA test for feature selection.
Published 2025“…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. …”
-
15
Classification performance of ML and DL models.
Published 2025“…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. …”
-
16
-
17
Flowchart scheme of the ML-based model.
Published 2024“…<b>I)</b> Testing data consisting of 20% of the entire dataset. <b>J)</b> Optimization of hyperparameter tuning. <b>K)</b> Algorithm selection from all models. …”
-
18
Steps in the extraction of 14 coordinates from the CT slices for the curved MPR.
Published 2025“…Protruding paths are then eliminated using graph-based optimization algorithms, as demonstrated in f). …”
-
19
Supplementary file 1_Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery.docx
Published 2025“…</p>Methods<p>Thirteen supervised classification algorithms were comparatively evaluated, encompassing traditional spectral/statistical classifiers—Maximum Likelihood, Mahalanobis Distance, Minimum Distance, Parallelepiped, Spectral Angle Mapper (SAM), Spectral Information Divergence (SID), and Binary Encoding—and machine learning algorithms including Decision Tree (DT), K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Random Forest (RF), and Artificial Neural Network (ANN). …”