Search alternatives:
bayesian optimization » based optimization (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
data bayesian » a bayesian (Expand Search), art bayesian (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
step model » system model (Expand Search)
bayesian optimization » based optimization (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
data bayesian » a bayesian (Expand Search), art bayesian (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
step model » system model (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
Optimized Bayesian regularization-back propagation neural network using data-driven intrusion detection system in Internet of Things
Published 2025“…This research presents Data-Driven Intrusion Detection System in Internet of Things utilizing Optimized Bayesian Regularization-Back Propagation Neural Network (DIDS-BRBPNN-BBWOA-IoT) to overcome these issues. …”
-
9
-
10
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. …”
-
11
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. …”
-
12
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. …”
-
13
Bayesian sequential design for sensitivity experiments with hybrid responses
Published 2023“…To deal with the problem of complex computation involved in searching for optimal designs, fast algorithms are presented using two strategies to approximate the optimal criterion, denoted as SI-optimal design and Bayesian D-optimal design, respectively. …”
-
14
Hierarchical clustering to infer a binary tree with <i>K</i> = 4 sampled populations.
Published 2023“…After <i>K</i> − 2 = 2 steps, the resulting tree is binary and the algorithm stops.…”
-
15
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. …”
-
16
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. …”
-
17
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. …”
-
18
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. …”
-
19
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. …”
-
20
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. …”