بدائل البحث:
joint optimization » policy optimization (توسيع البحث), wolf optimization (توسيع البحث), codon optimization (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
binary data » primary data (توسيع البحث), dietary data (توسيع البحث)
data joint » data point (توسيع البحث), data points (توسيع البحث)
joint optimization » policy optimization (توسيع البحث), wolf optimization (توسيع البحث), codon optimization (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
binary data » primary data (توسيع البحث), dietary data (توسيع البحث)
data joint » data point (توسيع البحث), data points (توسيع البحث)
-
1
-
2
The Pseudo-Code of the IRBMO Algorithm.
منشور في 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.
منشور في 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.
منشور في 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
<i>hi</i>PRS algorithm process flow.
منشور في 2023"…From this dataset we can compute the MI between each interaction and the outcome and <b>(D)</b> obtain a ranked list (<i>I</i><sub><i>δ</i></sub>) based on this metric. <b>(E)</b> Starting from the interaction at the top of <i>I</i><sub><i>δ</i></sub>, <i>hi</i>PRS constructs <i>I</i><sub><i>K</i></sub>, selecting <i>K</i> (where <i>K</i> is user-specified) terms through the greedy optimization of the ratio between MI (<i>relevance</i>) and a suitable measure of similarity for interactions (<i>redundancy)</i> (cf. …"
-
6
-
7
Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes
منشور في 2022"…Introduction: Increasingly, logistic regression methods for genetic association studies of binary phenotypes must be able to accommodate data sparsity, which arises from unbalanced case-control ratios and/or rare genetic variants. …"
-
8
Pseudo Code of RBMO.
منشور في 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
P-value on CEC-2017(Dim = 30).
منشور في 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
Memory storage behavior.
منشور في 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
Elite search behavior.
منشور في 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
Description of the datasets.
منشور في 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 shaped transfer functions.
منشور في 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
S- and V-Type transfer function diagrams.
منشور في 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
Collaborative hunting behavior.
منشور في 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
Friedman average rank sum test results.
منشور في 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. …"
-
17
IRBMO vs. variant comparison adaptation data.
منشور في 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. …"
-
18
Variable Selection with Multiply-Imputed Datasets: Choosing Between Stacked and Grouped Methods
منشور في 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>. …"