Showing 461 - 480 results of 954 for search '(( algorithm python function ) OR ( ((algorithm python) OR (algorithm both)) function ))*', query time: 0.29s Refine Results
  1. 461

    Feature selection results. by Amal H. Alharbi (21755906)

    Published 2025
    “…We applied this hybrid strategy to a Radial Basis Function Network (RBFN), and validated its performance improvements through extensive experiments, including ANOVA and Wilcoxon tests for both feature selection and optimization phases. …”
  2. 462

    ANOVA test for feature selection. by Amal H. Alharbi (21755906)

    Published 2025
    “…We applied this hybrid strategy to a Radial Basis Function Network (RBFN), and validated its performance improvements through extensive experiments, including ANOVA and Wilcoxon tests for both feature selection and optimization phases. …”
  3. 463

    Wilcoxon test results for optimization. by Amal H. Alharbi (21755906)

    Published 2025
    “…We applied this hybrid strategy to a Radial Basis Function Network (RBFN), and validated its performance improvements through extensive experiments, including ANOVA and Wilcoxon tests for both feature selection and optimization phases. …”
  4. 464

    Classification performance of ML and DL models. by Amal H. Alharbi (21755906)

    Published 2025
    “…We applied this hybrid strategy to a Radial Basis Function Network (RBFN), and validated its performance improvements through extensive experiments, including ANOVA and Wilcoxon tests for both feature selection and optimization phases. …”
  5. 465

    Skipping frames and interpolating skeletons with a spline achieves similar accuracy and faster computational time. by Weheliye H. Weheliye (22022140)

    Published 2025
    “…(C) Computation time per input frame for the different models as a function of worm number. Tierpsy only uses CPU computation while Omnipose uses GPU and CPU because we use Tierpsy’s skeletonization algorithm to convert segmented regions to skeletons. …”
  6. 466

    PhyCysID: Plant Cystatin Protein Prediction by an Artificial Intelligence Approach by Sadaf Aqil (22183571)

    Published 2025
    “…As a case study, a curated dataset of phytocystatin sequences from the UniProt database was used to evaluate the algorithm’s performance. The PhyCysID web server enables rapid classification of both individual and batch-submitted sequences in less than 15 s, providing high-throughput analysis for an accurate identification of phytocystatin class and function. …”
  7. 467

    PhyCysID: Plant Cystatin Protein Prediction by an Artificial Intelligence Approach by Sadaf Aqil (22183571)

    Published 2025
    “…As a case study, a curated dataset of phytocystatin sequences from the UniProt database was used to evaluate the algorithm’s performance. The PhyCysID web server enables rapid classification of both individual and batch-submitted sequences in less than 15 s, providing high-throughput analysis for an accurate identification of phytocystatin class and function. …”
  8. 468

    PhyCysID: Plant Cystatin Protein Prediction by an Artificial Intelligence Approach by Sadaf Aqil (22183571)

    Published 2025
    “…As a case study, a curated dataset of phytocystatin sequences from the UniProt database was used to evaluate the algorithm’s performance. The PhyCysID web server enables rapid classification of both individual and batch-submitted sequences in less than 15 s, providing high-throughput analysis for an accurate identification of phytocystatin class and function. …”
  9. 469

    PhyCysID: Plant Cystatin Protein Prediction by an Artificial Intelligence Approach by Sadaf Aqil (22183571)

    Published 2025
    “…As a case study, a curated dataset of phytocystatin sequences from the UniProt database was used to evaluate the algorithm’s performance. The PhyCysID web server enables rapid classification of both individual and batch-submitted sequences in less than 15 s, providing high-throughput analysis for an accurate identification of phytocystatin class and function. …”
  10. 470

    Structure and parameters of pipeline network. by Huichao Guo (14515171)

    Published 2025
    “…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
  11. 471

    Experimental parameter combinations. by Huichao Guo (14515171)

    Published 2025
    “…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
  12. 472

    Experimental results. by Huichao Guo (14515171)

    Published 2025
    “…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
  13. 473

    Data sources for figures and tables. by Huichao Guo (14515171)

    Published 2025
    “…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
  14. 474

    Fault events. by Huichao Guo (14515171)

    Published 2025
    “…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
  15. 475
  16. 476
  17. 477
  18. 478
  19. 479
  20. 480

    TNP-TMA BC biomarker panels. by Robert T. Heussner (21989911)

    Published 2025
    “…Existing computational methods overlook both cell population heterogeneity across modalities and spatial information, which are critical for effectively completing this task. …”