Search alternatives:
estimation algorithm » optimization algorithms (Expand Search), maximization algorithm (Expand Search), detection algorithm (Expand Search)
guided optimization » based optimization (Expand Search), model optimization (Expand Search)
case estimation » based estimation (Expand Search), pose estimation (Expand Search), age estimation (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
based case » base case (Expand Search), based cancer (Expand Search)
estimation algorithm » optimization algorithms (Expand Search), maximization algorithm (Expand Search), detection algorithm (Expand Search)
guided optimization » based optimization (Expand Search), model optimization (Expand Search)
case estimation » based estimation (Expand Search), pose estimation (Expand Search), age estimation (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
based case » base case (Expand Search), based cancer (Expand Search)
-
1
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. …”
-
2
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. …”
-
3
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. …”
-
4
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. …”
-
5
-
6
-
7
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. …”
-
8
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. …”
-
9
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. …”
-
10
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. …”
-
11
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. …”
-
12
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. …”
-
13
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. …”
-
14
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. …”
-
15
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. …”
-
16
Bayesian variable selection in distributed lag models: a focus on binary quantile and count data regressions
Published 2025“…Extra parameters introduced through the DLM framework may require calibration for the MCMC algorithm, but this will not be the case in DLM-based analyses often seen in pollution exposure literature. …”
-
17
Comparison of penalized logistic regression models for rare event case
Published 2022“…<p>The occurrence rate of the event of interest might be quite small (rare) in some cases, although sample size is large enough for Binary Logistic Regression (LR) model. …”
-
18
Table 1_Provider fidelity in tuberculosis screening practices among adolescents and adults living with HIV in public health facilities in Tanzania: a cross-sectional evaluation.doc...
Published 2025“…Modified Poisson regression with robust variance was used to estimate prevalence ratios (PRs) to determine factors associated with two binary outcomes: (1) consistent TB screening over 12-month period, and (2) correct utilization of the screening tool. …”
-
19
Table 2_Provider fidelity in tuberculosis screening practices among adolescents and adults living with HIV in public health facilities in Tanzania: a cross-sectional evaluation.doc...
Published 2025“…Modified Poisson regression with robust variance was used to estimate prevalence ratios (PRs) to determine factors associated with two binary outcomes: (1) consistent TB screening over 12-month period, and (2) correct utilization of the screening tool. …”
-
20