يعرض 1 - 20 نتائج من 25 نتيجة بحث عن '(((( implementing svm algorithm ) OR ( elemental per algorithm ))) OR ( neural coding algorithm ))', وقت الاستعلام: 0.14s تنقيح النتائج
  1. 1

    A Fast and Robust Gas Recognition Algorithm Based on Hybrid Convolutional and Recurrent Neural Network حسب Xiaofang Pan (1895950)

    منشور في 2019
    "…The reported accuracy dramatically outperforms the previous algorithms, including gradient tree boosting (GTB), random forest (RF), support vector machine (SVM), k-nearest neighbor (KNN), and linear discriminant analysis (LDA). …"
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    PSYCHOLOGICAL EMOTION RECOGNITION OF STUDENTS USING MACHINE LEARNING BASED CHATBOT حسب Khalil Assayed, Suha

    منشور في 2023
    "…The result shows that the accuracy performance of SVM algorithm is better than Naïve Bayes algorithm, but the speed is extremely slow compared to Naive Bayes model. …"
    احصل على النص الكامل
    احصل على النص الكامل
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13

    Correlation Clustering with Overlaps حسب Fakhereldine, Amin

    منشور في 2020
    "…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  14. 14
  15. 15
  16. 16

    A Clinically Interpretable Approach for Early Detection of Autism Using Machine Learning With Explainable AI حسب Oishi Jyoti (21593819)

    منشور في 2025
    "…The paper uses naive Bayes, Support Vector Machine (SVM), and Random Forest (RF) as classifiers after careful investigation. …"
  17. 17

    PSYCHOLOGICAL EMOTION RECOGNITION OF STUDENTS USING MACHINE LEARNING BASED CHATBOT حسب Khalil Assayed, Suha

    منشور في 2023
    "…The result shows that the accuracy performance of SVM algorithm is better than Naïve Bayes algorithm, but the speed is extremely slow compared to Naive Bayes model. …"
    احصل على النص الكامل
  18. 18
  19. 19

    On the complexity of multi-parameterized cluster editing حسب Abu-Khzam, Faisal

    منشور في 2017
    "…In other words, Cluster Editing can be solved efficiently when the number of false positives/negatives per single data element is expected to be small compared to the minimum cluster size. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  20. 20