يعرض 1 - 20 نتائج من 24 نتيجة بحث عن '(( binary plot based optimization algorithm ) OR ( binary data codes optimization algorithm ))', وقت الاستعلام: 1.42s تنقيح النتائج
  1. 1

    S1 Data - حسب Haoqiang Liu (193675)

    منشور في 2021
  2. 2
  3. 3

    SHAP bar plot. حسب Meng Cao (105914)

    منشور في 2025
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13

    Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish) حسب Daniel Pérez Palau (11097348)

    منشور في 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. 14
  15. 15
  16. 16

    Sample image for illustration. حسب Indhumathi S. (19173013)

    منشور في 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. 17

    Comparison analysis of computation time. حسب Indhumathi S. (19173013)

    منشور في 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. 18

    Process flow diagram of CBFD. حسب Indhumathi S. (19173013)

    منشور في 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. 19

    Precision recall curve. حسب Indhumathi S. (19173013)

    منشور في 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. 20

    Quadratic polynomial in 2D image plane. حسب Indhumathi S. (19173013)

    منشور في 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). …"