Search alternatives:
bayesian optimization » based optimization (Expand Search)
selection algorithm » detection algorithm (Expand Search), detection algorithms (Expand Search)
process selection » process reflection (Expand Search)
binary complex » ternary complex (Expand Search), snare complex (Expand Search)
a bayesian » _ bayesian (Expand Search)
binary a » binary _ (Expand Search), binary b (Expand Search), hilary a (Expand Search)
bayesian optimization » based optimization (Expand Search)
selection algorithm » detection algorithm (Expand Search), detection algorithms (Expand Search)
process selection » process reflection (Expand Search)
binary complex » ternary complex (Expand Search), snare complex (Expand Search)
a bayesian » _ bayesian (Expand Search)
binary a » binary _ (Expand Search), binary b (Expand Search), hilary a (Expand Search)
-
21
Wilcoxon test results for optimization.
Published 2025“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”
-
22
Classification performance of ML and DL models.
Published 2025“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”
-
23
-
24
-
25
PathOlOgics_RBCs Python Scripts.zip
Published 2023“…The optimal number that produced the most favourable results in the preliminary differentiation was determined to be 5, which was subsequently selected and utilized for this measurement.</p><p dir="ltr">To assess the consistency, diversity, and complexity of the processed data, the Uniform Manifold Approximation and Projection (UMAP) technique was employed to investigate the structural relationships among the various classes (see PathOlOgics_script_3; UMAP visualizations). …”
-
26
Schematic overview of SINATRA Pro: A novel framework for discovering biophysical signatures that differentiate classes of proteins.
Published 2022“…<p><b>(A)</b> The SINATRA Pro algorithm requires the following inputs: <i>(i)</i> (<i>x</i>, <i>y</i>, <i>z</i>)-coordinates corresponding to the structural position of each atom in every protein; <i>(ii)</i> <b>y</b>, a binary vector denoting protein class or phenotype (e.g., mutant versus wild-type); <i>(iii)</i> <i>r</i>, the cutoff distance for simplicial construction (i.e., constructing the mesh representation for every protein); <i>(iv)</i> <i>c</i>, the number of cones of directions; <i>(v)</i> <i>d</i>, the number of directions within each cone; <i>(vi)</i> <i>θ</i>, the cap radius used to generate directions in a cone; and <i>(vii)</i> <i>l</i>, the number of sublevel sets (i.e., filtration steps) used to compute the differential Euler characteristic (DEC) curve along a given direction. …”
-
27
Advanced constraint programming formulations for additive manufacturing machine scheduling problems
Published 2024“…<p>In comparison with traditional subtractive manufacturing techniques, additive manufacturing (AM) enables fabricating complex parts through a layer-by-layer process. AM makes it possible to produce one-piece and lightweight functional products, which are traditionally made from several parts. …”
-
28
DataSheet_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx
Published 2024“…Despite the increased complexity associated with binary classification, it remained more efficient, offering higher classification accuracy for samples and facilitating the selection of the most relevant time or variables, such as cooking time ≤ 30 minutes. …”
-
29
Table_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx
Published 2024“…Despite the increased complexity associated with binary classification, it remained more efficient, offering higher classification accuracy for samples and facilitating the selection of the most relevant time or variables, such as cooking time ≤ 30 minutes. …”