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 » binary image (Expand Search), final phase (Expand Search)
binary mask » binary image (Expand Search)
mask based » task based (Expand Search), risk based (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 » binary image (Expand Search), final phase (Expand Search)
binary mask » binary image (Expand Search)
mask based » task based (Expand Search), risk based (Expand Search)
-
1
-
2
-
3
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. …”
-
4
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. …”
-
5
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. …”
-
6
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. …”
-
7
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. …”
-
8
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. …”
-
9
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. …”
-
10
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. …”
-
11
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. …”
-
12
A* Path-Finding Algorithm to Determine Cell Connections
Published 2025“…To address this, the research integrates a modified A* pathfinding algorithm with a U-Net convolutional neural network, a custom statistical binary classification method, and a personalized Min-Max connectivity threshold to automate the detection of astrocyte connectivity.…”
-
13
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. …”
-
14
-
15
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). …”