Search alternatives:
field optimization » lead optimization (Expand Search), guided optimization (Expand Search), linear optimization (Expand Search)
led optimization » lead optimization (Expand Search), yet optimization (Expand Search), based optimization (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data field » data file (Expand Search), dark field (Expand Search)
field optimization » lead optimization (Expand Search), guided optimization (Expand Search), linear optimization (Expand Search)
led optimization » lead optimization (Expand Search), yet optimization (Expand Search), based optimization (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data field » data file (Expand Search), dark field (Expand Search)
-
21
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. …”
-
22
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. …”
-
23
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. …”
-
24
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. …”
-
25
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. …”
-
26
S- and V-Type transfer function diagrams.
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. …”
-
27
Collaborative hunting 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. …”
-
28
Friedman average rank sum test results.
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. …”
-
29
Presentation_1_Modified GAN Augmentation Algorithms for the MRI-Classification of Myocardial Scar Tissue in Ischemic Cardiomyopathy.PPTX
Published 2021“…Currently, there are no optimized deep-learning algorithms for the automated classification of scarred vs. normal myocardium. …”
-
30
Thesis-RAMIS-Figs_Slides
Published 2024“…In this direction, the option of estimating the statistics of the model directly from the training image (performing a refined pattern search instead of simulating data) is a very promising.<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”
-
31
-
32
Table_1_An efficient decision support system for leukemia identification utilizing nature-inspired deep feature optimization.pdf
Published 2024“…Next, a hybrid feature extraction approach is presented leveraging transfer learning from selected deep neural network models, InceptionV3 and DenseNet201, to extract comprehensive feature sets. To optimize feature selection, a customized binary Grey Wolf Algorithm is utilized, achieving an impressive 80% reduction in feature size while preserving key discriminative information. …”
-
33
-
34
Supplementary file 1_Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery.docx
Published 2025“…</p>Methods<p>Thirteen supervised classification algorithms were comparatively evaluated, encompassing traditional spectral/statistical classifiers—Maximum Likelihood, Mahalanobis Distance, Minimum Distance, Parallelepiped, Spectral Angle Mapper (SAM), Spectral Information Divergence (SID), and Binary Encoding—and machine learning algorithms including Decision Tree (DT), K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Random Forest (RF), and Artificial Neural Network (ANN). …”
-
35
-
36
Fortran & C++: design fractal-type optical diffractive element
Published 2022“…</p> <p>(4) export geometry/optics raw data and figures for binary DOE devices.</p> <p><br></p> <p>[Wolfram Mathematica code "square_triangle_DOE.nb"]:</p> <p>read the optimized binary DOE document (after Fortran & C++ code) to calculate its diffractive fields for comparison.…”
-
37
Machine Learning-Ready Dataset for Cytotoxicity Prediction of Metal Oxide Nanoparticles
Published 2025“…</p><p dir="ltr"><b>Applications and Model Compatibility:</b></p><p dir="ltr">The dataset is optimized for use in supervised learning workflows and has been tested with algorithms such as:</p><p dir="ltr">Gradient Boosting Machines (GBM),</p><p dir="ltr">Support Vector Machines (SVM-RBF),</p><p dir="ltr">Random Forests, and</p><p dir="ltr">Principal Component Analysis (PCA) for feature reduction.…”