Search alternatives:
design optimization » bayesian optimization (Expand Search)
other optimization » after optimization (Expand Search), step optimization (Expand Search), convex optimization (Expand Search)
binary plot » binary plddt (Expand Search), binary depot (Expand Search)
plot design » block design (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data other » data over (Expand Search)
design optimization » bayesian optimization (Expand Search)
other optimization » after optimization (Expand Search), step optimization (Expand Search), convex optimization (Expand Search)
binary plot » binary plddt (Expand Search), binary depot (Expand Search)
plot design » block design (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data other » data over (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
-
14
DataSheet_1_Raman Spectroscopic Differentiation of Streptococcus pneumoniae From Other Streptococci Using Laboratory Strains and Clinical Isolates.pdf
Published 2022“…Optimized models were used to identify S. pneumoniae from other streptococci in an independent, previously unknown data set of 28 patient isolates. …”
-
15
-
16
-
17
-
18
Design and implementation of the Multiple Criteria Decision Making (MCDM) algorithm for predicting the severity of COVID-19.
Published 2021“…<p>(A). The MCDM algorithm-Stage 1. Preprocessing, this stage is the process of refining the collected raw data to eliminate noise, including correlation analysis and feature selection based on P values. …”
-
19
-
20
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. …”