بدائل البحث:
design optimization » bayesian optimization (توسيع البحث)
model optimization » codon optimization (توسيع البحث), global optimization (توسيع البحث), based optimization (توسيع البحث)
binary value » binary values (توسيع البحث), boundary value (توسيع البحث)
value design » game design (توسيع البحث), case design (توسيع البحث), glue designs (توسيع البحث)
binary based » library based (توسيع البحث), linac based (توسيع البحث), binary mask (توسيع البحث)
design optimization » bayesian optimization (توسيع البحث)
model optimization » codon optimization (توسيع البحث), global optimization (توسيع البحث), based optimization (توسيع البحث)
binary value » binary values (توسيع البحث), boundary value (توسيع البحث)
value design » game design (توسيع البحث), case design (توسيع البحث), glue designs (توسيع البحث)
binary based » library based (توسيع البحث), linac based (توسيع البحث), binary mask (توسيع البحث)
-
101
Large-scale dataset comparative analysis using the number of features selected.
منشور في 2023الموضوعات: -
102
-
103
-
104
-
105
-
106
-
107
Small-scale dataset comparative analysis using the number of features selected.
منشور في 2023الموضوعات: -
108
-
109
-
110
-
111
Parameter settings of the comparison algorithms.
منشور في 2024"…In this paper, we present an improved mountain gazelle optimizer (IMGO) based on the newly proposed mountain gazelle optimizer (MGO) and design a binary version of IMGO (BIMGO) to solve the feature selection problem for medical data. …"
-
112
-
113
ROC curve for binary classification.
منشور في 2024"…The model further showed superior results on binary classification compared with existing methods. …"
-
114
Confusion matrix for binary classification.
منشور في 2024"…The model further showed superior results on binary classification compared with existing methods. …"
-
115
-
116
-
117
-
118
-
119
<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. …"
-
120