Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Greedy Selection"”.

  1. Bayesian random forests for high-dimensional classification and regression with complete and incomplete microarray data

    … for data prediction, interpretation and variable selection purposes. The wide acceptance can be attributed to its robustness to high dimensionality problem. However, when the high-dimensional data is a sparse one, RF procedures are inefficient. Thus, this thesis aims at improving the efficiency of …

    uthm Repository record for Bayesian random forests for high-dimensional classification and regression with complete and incomplete microarray data (opens in a new tab)

  2. High quality functional coverage based trace signal selection for post-silicon validation

    … remaining signal values. Existing methods use a greedy selection process to converge to a locally optimal selection; this kind of method suffers from severe diminishing restoration ratio effect as more trace signals are selected. In addition, all of the previous publications have been focused on …

    uiuc Repository record for High quality functional coverage based trace signal selection for post-silicon validation (opens in a new tab)

  3. Focused active inference

    … representing a gap in the existing observation selection literature. The interposition of nuisances between observations and relevant latent states necessitates the derivation of nonlocal information measures. This thesis presents propagation algorithms for nonlocal mutual information (MI) on …

    mit Repository record for Focused active inference (opens in a new tab)

  4. Leveraging Machine Learning and Causal Inference for Loan Default Prediction

    … validation, the modeling pipelines (feature selection + prediction) were evaluated for accuracy, precision, recall, and F1-score to determine their effectiveness in predicting loan defaults.</p> <p>Among the models tested, Naive Bayes overall demonstrated the best performance (F1-score), …

    embry-riddle Repository record for Leveraging Machine Learning and Causal Inference for Loan Default Prediction (opens in a new tab)

  5. Scalable Multi-Agent Systems in Restricted Environments

    … relation from combinatorics which utilizes the greedy selection algorithm and a matroid condition to create an efficient planner that maintains a fixed performance ratio when compared to the optimal path. We then introduce a motivating example of autonomously assisted search and rescues using …

    vt Repository record for Scalable Multi-Agent Systems in Restricted Environments (opens in a new tab)

  6. Efficient 𝐻₂-Based Parametric Model Reduction via Greedy Search

    … 𝐻-infinity approximations, we develop a greedy algorithm for efficiently modeling large-scale parametric dynamical systems in an 𝐻₂-sense. We demonstrate the effectiveness of this greedy search on a fluid problem, a mechanics problem, and a thermal problem. We also investigate Bayesian …

    vt Repository record for Efficient 𝐻₂-Based Parametric Model Reduction via Greedy Search (opens in a new tab)