بدائل البحث:
based optimization » whale optimization (توسيع البحث)
codes optimization » codon optimization (توسيع البحث), model optimization (توسيع البحث), convex optimization (توسيع البحث)
binary plot » binary plddt (توسيع البحث), binary depot (توسيع البحث)
binary data » primary data (توسيع البحث), dietary data (توسيع البحث)
plot based » plant based (توسيع البحث)
data codes » data code (توسيع البحث), data models (توسيع البحث), data model (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
codes optimization » codon optimization (توسيع البحث), model optimization (توسيع البحث), convex optimization (توسيع البحث)
binary plot » binary plddt (توسيع البحث), binary depot (توسيع البحث)
binary data » primary data (توسيع البحث), dietary data (توسيع البحث)
plot based » plant based (توسيع البحث)
data codes » data code (توسيع البحث), data models (توسيع البحث), data model (توسيع البحث)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
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). …"
-
14
-
15
-
16
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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
17
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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
18
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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
19
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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
20
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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"