بدائل البحث:
based optimization » whale optimization (توسيع البحث)
binary risk » primary risk (توسيع البحث), dietary risk (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
binary risk » primary risk (توسيع البحث), dietary risk (توسيع البحث)
-
21
Testing results for classifying AD, MCI and NC.
منشور في 2024"…The study introduced a scheme for enhancing images to improve the quality of the datasets. Specifically, an image enhancement algorithm based on histogram equalization and bilateral filtering techniques was deployed to reduce noise and enhance the quality of the images. …"
-
22
Summary of existing CNN models.
منشور في 2024"…The study introduced a scheme for enhancing images to improve the quality of the datasets. Specifically, an image enhancement algorithm based on histogram equalization and bilateral filtering techniques was deployed to reduce noise and enhance the quality of the images. …"
-
23
Multicategory Angle-Based Learning for Estimating Optimal Dynamic Treatment Regimes With Censored Data
منشور في 2021"…In this article, we develop a novel angle-based approach to search the optimal DTR under a multicategory treatment framework for survival data. …"
-
24
Flowchart scheme of the ML-based model.
منشور في 2024"…<b>I)</b> Testing data consisting of 20% of the entire dataset. <b>J)</b> Optimization of hyperparameter tuning. <b>K)</b> Algorithm selection from all models. …"
-
25
-
26
Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf
منشور في 2020"…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. …"
-
27
-
28
Sample image for illustration.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
29
-
30
Quadratic polynomial in 2D image plane.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
31
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). …"
-
32
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). …"
-
33
Presentation_1_Modified GAN Augmentation Algorithms for the MRI-Classification of Myocardial Scar Tissue in Ischemic Cardiomyopathy.PPTX
منشور في 2021"…Currently, there are no optimized deep-learning algorithms for the automated classification of scarred vs. normal myocardium. …"
-
34
Table_1_An efficient decision support system for leukemia identification utilizing nature-inspired deep feature optimization.pdf
منشور في 2024"…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. …"
-
35
Comparison analysis of computation time.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
36
Process flow diagram of CBFD.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
37
Precision recall curve.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
38
-
39
Supplementary file 1_Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery.docx
منشور في 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). …"
-
40
Predictive Analysis of Mushroom Toxicity Based Exclusively on Their Natural Habitat.
منشور في 2025"…Model evaluation was based on accuracy metrics and qualitative analysis of the confusion matrix.. …"