Search alternatives:
task optimization » based optimization (Expand Search), phase optimization (Expand Search), path optimization (Expand Search)
over optimization » other optimization (Expand Search), convex optimization (Expand Search), model optimization (Expand Search)
values over » values per (Expand Search)
image task » imagery tasks (Expand Search)
task optimization » based optimization (Expand Search), phase optimization (Expand Search), path optimization (Expand Search)
over optimization » other optimization (Expand Search), convex optimization (Expand Search), model optimization (Expand Search)
values over » values per (Expand Search)
image task » imagery tasks (Expand Search)
-
1
Datasets and their properties.
Published 2023“…In addition, we designed nested transfer (NT) functions and investigated the influence of the function on the level-1 optimizer. The binary Ebola optimization search algorithm (BEOSA) is applied for the level-1 mutation, while the simulated annealing (SA) and firefly (FFA) algorithms are investigated for the level-2 optimizer. …”
-
2
Parameter settings.
Published 2023“…In addition, we designed nested transfer (NT) functions and investigated the influence of the function on the level-1 optimizer. The binary Ebola optimization search algorithm (BEOSA) is applied for the level-1 mutation, while the simulated annealing (SA) and firefly (FFA) algorithms are investigated for the level-2 optimizer. …”
-
3
Sample image for illustration.
Published 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. …”
-
4
Quadratic polynomial in 2D image plane.
Published 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. …”
-
5
Comparison analysis of computation time.
Published 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. …”
-
6
Process flow diagram of CBFD.
Published 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. …”
-
7
Precision recall curve.
Published 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. …”
-
8
-
9
-
10
Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish)
Published 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). …”
-
11
Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf
Published 2020“…In this way, for each binary problem, the CSP algorithm produces features to determine if the specific body part is engaged in the task or not. …”
-
12
Thesis-RAMIS-Figs_Slides
Published 2024“…In the context of facies recovery using simulations, the task of optimal sampling is formalized and addressed using a maximum information extraction criterion. …”
-
13
Seed mix selection model
Published 2022“…For each data set, we initialized a starting population of plant species equal to the desired number of plant species in the mix. The genetic algorithm then operated over 1000 iterations, applying crossover and mutation processes to optimize bee richness. …”
-
14
DataSheet_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx
Published 2024“…The accuracy of the optimal scenario for classifying samples with a cooking time of 30 minutes reached RCal2 = 0.86 and RVal2 = 0.84, with a Kappa value of 0.53. …”
-
15
Table_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx
Published 2024“…The accuracy of the optimal scenario for classifying samples with a cooking time of 30 minutes reached RCal2 = 0.86 and RVal2 = 0.84, with a Kappa value of 0.53. …”
-
16
Table 1_Creating an interactive database for nasopharyngeal carcinoma management: applying machine learning to evaluate metastasis and survival.docx
Published 2024“…</p>Methods<p>We retrieved over 8,000 NPC patient samples with associated clinical information from the Surveillance, Epidemiology, and End Results (SEER) database. …”
-
17
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.…”