يعرض 1 - 20 نتائج من 2,712 نتيجة بحث عن '(( case modeling algorithm ) OR ((( develop each algorithm ) OR ( element data algorithm ))))', وقت الاستعلام: 0.51s تنقيح النتائج
  1. 1
  2. 2
  3. 3

    Traditional versus algorithmic process. حسب Minerva A. Orellana (21553459)

    منشور في 2025
    "…Effects modification models were used to assess odds of reaching each admissions phase, adjusting for UR status and review process. …"
  4. 4

    Algorithmic versus integrative process. حسب Minerva A. Orellana (21553459)

    منشور في 2025
    "…Effects modification models were used to assess odds of reaching each admissions phase, adjusting for UR status and review process. …"
  5. 5
  6. 6

    The run time for each algorithm in seconds. حسب Edward Antonian (21453161)

    منشور في 2025
    "…The goal of this paper is to examine several extensions to KGR/GPoG, with the aim of generalising them a wider variety of data scenarios. The first extension we consider is the case of graph signals that have only been partially recorded, meaning a subset of their elements is missing at observation time. …"
  7. 7

    Partial dependence plots (A – G) and the resulting clustered feature importance (H) for each feature and trained model. حسب Daniel Walke (21680915)

    منشور في 2025
    "…In H), we hierarchically clustered (Euclidean distance with average linking) the feature importance resulting from the normalized variance in the partial dependence plots for each trained model. Tree-based algorithms (i.e., Decision Tree, Random Forest, XGBoost, and RUSBoost) are grouped together indicating similar underlying mechanisms for the classification. …"
  8. 8
  9. 9

    Data for Figs 3–9. حسب Xiaogang Li (299205)

    منشور في 2024
    الموضوعات:
  10. 10
  11. 11
  12. 12
  13. 13

    Unit impedance of each OD pair. حسب Zhipeng Huang (1759759)

    منشور في 2025
    الموضوعات:
  14. 14
  15. 15

    Model-Based Clustering of Categorical Data Based on the Hamming Distance حسب Raffaele Argiento (647076)

    منشور في 2024
    "…The proposed method exploits the Hamming distance to define a family of probability mass functions to model the data. The elements of this family are then considered as kernels of a finite mixture model with an unknown number of components. …"
  16. 16
  17. 17
  18. 18

    UIQI of the results of each algorithm. حسب Haiyan Zhang (176919)

    منشور في 2025
    "…To address these issues, we have developed the 3D bilateral filtering algorithm with noise level estimation assisted by multi-temporal SAR(3D-NLE-BF). …"
  19. 19

    PSNR of the results of each algorithm. حسب Haiyan Zhang (176919)

    منشور في 2025
    "…To address these issues, we have developed the 3D bilateral filtering algorithm with noise level estimation assisted by multi-temporal SAR(3D-NLE-BF). …"
  20. 20

    Running time of each algorithm. حسب Haiyan Zhang (176919)

    منشور في 2025
    "…To address these issues, we have developed the 3D bilateral filtering algorithm with noise level estimation assisted by multi-temporal SAR(3D-NLE-BF). …"