Triplet Matching for Estimating Causal Effects With Three Treatment Arms: A Comparative Study of Mortality by Trauma Center Level by Giovanni Nattino (561797)

“…We fill the gap by developing an iterative matching algorithm for the three-group setting. Our algorithm outperforms the nearest neighbor algorithm and is shown to produce matched samples with total distance no larger than twice the optimal distance. …”

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

“…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>_<i>δ</i>) based on this metric. <b>(E)</b> Starting from the interaction at the top of <i>I</i>_<i>δ</i>, <i>hi</i>PRS constructs <i>I</i>_<i>K</i>, selecting <i>K</i> (where <i>K</i> is user-specified) terms through the greedy optimization of the ratio between MI (<i>relevance</i>) and a suitable measure of similarity for interactions (<i>redundancy)</i> (cf. …”

Analysis and design of algorithms for the manufacturing process of integrated circuits by Sonia Fleytas (16856403)

“…The (approximate) solution proposals of state-of-the-art methods include rule-based approaches, genetic algorithms, and reinforcement learning. …”

Supplementary Material 8 by Nishitha R Kumar (19750617)

“…</li><li><b>XGboost: </b>An optimized gradient boosting algorithm that efficiently handles large genomic datasets, commonly used for high-accuracy predictions in <i>E. coli</i> classification.…”