بدائل البحث:
processes identification » progression identification (توسيع البحث), protein identification (توسيع البحث), proteomic identification (توسيع البحث)
identification algorithm » classification algorithm (توسيع البحث), detection algorithm (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
based processes » care processes (توسيع البحث)
binary based » library based (توسيع البحث), linac based (توسيع البحث), binary mask (توسيع البحث)
binary 2 » binary _ (توسيع البحث), binary b (توسيع البحث)
2 based » _ based (توسيع البحث), 1 based (توسيع البحث), ai based (توسيع البحث)
processes identification » progression identification (توسيع البحث), protein identification (توسيع البحث), proteomic identification (توسيع البحث)
identification algorithm » classification algorithm (توسيع البحث), detection algorithm (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
based processes » care processes (توسيع البحث)
binary based » library based (توسيع البحث), linac based (توسيع البحث), binary mask (توسيع البحث)
binary 2 » binary _ (توسيع البحث), binary b (توسيع البحث)
2 based » _ based (توسيع البحث), 1 based (توسيع البحث), ai based (توسيع البحث)
-
101
Quadratic polynomial in 2D image plane.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
102
-
103
Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish)
منشور في 2024"…</li></ul><p dir="ltr"><b>File Structure</b></p><p dir="ltr">The code generates and saves:</p><ul><li>Weights of the trained model (.h5)</li><li>Configured tokenizer</li><li>Training history in CSV</li><li>Requirements file</li></ul><p dir="ltr"><b>Important Notes</b></p><ul><li>The model excludes category 2 during training</li><li>Implements transfer learning from a pre-trained model for binary hate detection</li><li>Includes early stopping callbacks to prevent overfitting</li><li>Uses class weighting to handle category imbalances</li></ul><p dir="ltr">The process of creating this algorithm is explained in the technical report located at: Blanco-Valencia, X., De Gregorio-Vicente, O., Ruiz Iniesta, A., & Said-Hung, E. (2025). …"
-
104
-
105
Sugarcane stem nodes based on the maximum value points of the vertical projection function
منشور في 2021"…Then, the S component image is binarized by the Otsu method, the hole of the binary image is filled by morphology closing algorithm, and the sugarcane and the background are initially separated by the horizontal projection map of the binary image. …"
-
106
Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf
منشور في 2020"…Here, we propose a solution to address the limitation of identifiable motor activities by using combined MIs (i.e., MIs involving 2 or more body parts at the same time). And we propose two new multilabel uses of the Common Spatial Pattern (CSP) algorithm to optimize the signal-to-noise ratio, namely MC2CMI and MC2SMI approaches. …"
-
107
GSE96058 information.
منشور في 2024"…Subsequently, feature selection was conducted using ANOVA and binary Particle Swarm Optimization (PSO). During the analysis phase, the discriminative power of the selected features was evaluated using machine learning classification algorithms. …"
-
108
The performance of classifiers.
منشور في 2024"…Subsequently, feature selection was conducted using ANOVA and binary Particle Swarm Optimization (PSO). During the analysis phase, the discriminative power of the selected features was evaluated using machine learning classification algorithms. …"
-
109
-
110
Bayesian sequential design for sensitivity experiments with hybrid responses
منشور في 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. …"
-
111
Psoas muscle CT radiomics-based machine learning models to predict response to infliximab in patients with Crohn’s disease
منشور في 2025"…<i>Z</i> score standardization and independent sample <i>t</i> test were applied to identify optimal predictive features, which were then utilized in seven ML algorithms for training and validation. …"
-
112
DataSheet_1_Multi-Parametric MRI-Based Radiomics Models for Predicting Molecular Subtype and Androgen Receptor Expression in Breast Cancer.docx
منشور في 2021"…We applied several feature selection strategies including the least absolute shrinkage and selection operator (LASSO), and recursive feature elimination (RFE), the maximum relevance minimum redundancy (mRMR), Boruta and Pearson correlation analysis, to select the most optimal features. We then built 120 diagnostic models using distinct classification algorithms and feature sets divided by MRI sequences and selection strategies to predict molecular subtype and AR expression of breast cancer in the testing dataset of leave-one-out cross-validation (LOOCV). …"
-
113
Steps in the extraction of 14 coordinates from the CT slices for the curved MPR.
منشور في 2025"…Protruding paths are then eliminated using graph-based optimization algorithms, as demonstrated in f). …"
-
114
Active Learning Accelerated Discovery of Stable Iridium Oxide Polymorphs for the Oxygen Evolution Reaction
منشور في 2020"…Herein, we report a readily generalizable active-learning (AL) accelerated algorithm for identification of electrochemically stable iridium oxide polymorphs of IrO<sub>2</sub> and IrO<sub>3</sub>. …"
-
115
-
116
-
117
Sample image for illustration.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
118
Comparison analysis of computation time.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
119
Process flow diagram of CBFD.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
120
Precision recall curve.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"