Search alternatives:
derived optimization » driven optimization (Expand Search), required optimization (Expand Search), design optimization (Expand Search)
field optimization » lead optimization (Expand Search), guided optimization (Expand Search), linear optimization (Expand Search)
data derived » data driven (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 field » pulsed field (Expand Search)
derived optimization » driven optimization (Expand Search), required optimization (Expand Search), design optimization (Expand Search)
field optimization » lead optimization (Expand Search), guided optimization (Expand Search), linear optimization (Expand Search)
data derived » data driven (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 field » pulsed field (Expand Search)
-
1
-
2
-
3
-
4
The Pseudo-Code of the IRBMO Algorithm.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. The experiments are based on 12 medical datasets, and the results show that IRBMO achieves optimal overall performance in key metrics such as fitness value, classification accuracy and specificity. …”
-
5
Parameter settings of the comparison algorithms.
Published 2024“…<div><p>Feature selection is an important solution for dealing with high-dimensional data in the fields of machine learning and data mining. 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. …”
-
6
Datasets and their properties.
Published 2023“…<div><p>Feature selection problem represents the field of study that requires approximate algorithms to identify discriminative and optimally combined features. …”
-
7
Parameter settings.
Published 2023“…<div><p>Feature selection problem represents the field of study that requires approximate algorithms to identify discriminative and optimally combined features. …”
-
8
<i>hi</i>PRS algorithm process flow.
Published 2023“…<b>(C)</b> The whole training data is then scanned, searching for these sequences and deriving a re-encoded dataset where interaction terms are binary features (i.e., 1 if sequence <i>i</i> is observed in <i>j</i>-th patient genotype, 0 otherwise). …”
-
9
IRBMO vs. meta-heuristic algorithms boxplot.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. The experiments are based on 12 medical datasets, and the results show that IRBMO achieves optimal overall performance in key metrics such as fitness value, classification accuracy and specificity. …”
-
10
IRBMO vs. feature selection algorithm boxplot.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. The experiments are based on 12 medical datasets, and the results show that IRBMO achieves optimal overall performance in key metrics such as fitness value, classification accuracy and specificity. …”
-
11
Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes
Published 2022“…Our estimate of m is the maximizer of a marginal likelihood obtained by integrating the latent log-ORs out of the joint distribution of the parameters and observed data. We consider two approximate approaches to maximizing the marginal likelihood: (i) a Monte Carlo EM algorithm (MCEM) and (ii) a Laplace approximation (LA) to each integral, followed by derivative-free optimization of the approximation. …”
-
12
-
13
-
14
-
15
-
16
-
17
-
18
-
19
-
20