Showing 1 - 20 results of 31 for search '(( binary based prognostic identification algorithm ) OR ( binary d based optimization algorithm ))', query time: 0.49s Refine Results
  1. 1
  2. 2
  3. 3

    A new fast filtering algorithm for a 3D point cloud based on RGB-D information by Chaochuan Jia (7256237)

    Published 2019
    “…This method aligns the color image to the depth image, and the color mapping image is converted to an HSV image. Then, the optimal segmentation threshold of the V image that is calculated by using the Otsu algorithm is applied to segment the color mapping image into a binary image, which is used to extract the valid point cloud from the original point cloud with outliers. …”
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

    <i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

    Published 2023
    “…From this dataset we can compute the MI between each interaction and the outcome and <b>(D)</b> obtain a ranked list (<i>I</i><sub><i>δ</i></sub>) based on this metric. …”
  12. 12

    Design and implementation of the Multiple Criteria Decision Making (MCDM) algorithm for predicting the severity of COVID-19. by Jiaqing Luo (10975030)

    Published 2021
    “…EVAL1: The correlation between input features <i>x</i>∈<i>X</i> and output features y∈<i>Y</i>, <i>R</i>[<i>x,y</i>] or <i>R</i>[<i>y,x</i>]; EVAL2: The correlation between input features <i>x</i>∈<i>X</i> and labeled features v∈<i>L</i>, <i>R</i>[<i>x,v</i>] or <i>R</i>[<i>v,x</i>]; Subset: The optimal input feature subset. (D). The MCDM algorithm-Stage 4. …”
  13. 13
  14. 14
  15. 15

    Flowchart scheme of the ML-based model. by Noshaba Qasmi (20405009)

    Published 2024
    “…<b>I)</b> Testing data consisting of 20% of the entire dataset. <b>J)</b> Optimization of hyperparameter tuning. <b>K)</b> Algorithm selection from all models. …”
  16. 16
  17. 17

    Bayesian sequential design for sensitivity experiments with hybrid responses by Yuxia Liu (1779592)

    Published 2023
    “…To deal with the problem of complex computation involved in searching for optimal designs, fast algorithms are presented using two strategies to approximate the optimal criterion, denoted as SI-optimal design and Bayesian D-optimal design, respectively. …”
  18. 18
  19. 19
  20. 20