Search alternatives:
process optimization » model optimization (Expand Search)
lead optimization » global optimization (Expand Search), swarm optimization (Expand Search), whale optimization (Expand Search)
cycle process » whole process (Expand Search)
binary cycle » lunar cycle (Expand Search)
binary more » binary image (Expand Search)
more lead » modes lead (Expand Search)
process optimization » model optimization (Expand Search)
lead optimization » global optimization (Expand Search), swarm optimization (Expand Search), whale optimization (Expand Search)
cycle process » whole process (Expand Search)
binary cycle » lunar cycle (Expand Search)
binary more » binary image (Expand Search)
more lead » modes lead (Expand Search)
-
1
Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results
Published 2025Subjects: -
2
The Pseudo-Code of the IRBMO Algorithm.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
3
IRBMO vs. meta-heuristic algorithms boxplot.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
4
IRBMO vs. feature selection algorithm boxplot.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
5
Pseudo Code of RBMO.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
6
P-value on CEC-2017(Dim = 30).
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
7
Memory storage behavior.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
8
Elite search behavior.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
9
Description of the datasets.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
10
S and V shaped transfer functions.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
11
S- and V-Type transfer function diagrams.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
12
Collaborative hunting behavior.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
13
Friedman average rank sum test results.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
14
IRBMO vs. variant comparison adaptation data.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
15
-
16
-
17
Variable Selection with Multiply-Imputed Datasets: Choosing Between Stacked and Grouped Methods
Published 2022“…Building on existing work, we (i) derive and implement efficient cyclic coordinate descent and majorization-minimization optimization algorithms for continuous and binary outcome data, (ii) incorporate adaptive shrinkage penalties, (iii) compare these methods through simulation, and (iv) develop an R package <i>miselect</i>. …”
-
18
PathOlOgics_RBCs Python Scripts.zip
Published 2023“…</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). …”
-
19
Supplementary Material 8
Published 2025“…In AMR studies, datasets often contain more susceptible isolates than resistant ones, leading to biased model performance. …”
-
20
Predictive Analysis of Mushroom Toxicity Based Exclusively on Their Natural Habitat.
Published 2025“…<br>The consistency of the results across different kernels demonstrates that the information contained in the habitat, by itself, leads to a very simple optimal decision rule (mostly the prediction of the most frequent class per habitat), which cannot be improved solely by model adjustments. …”