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

"…We implement the evidence factors method for binary outcomes, which includes a randomization-based testing strategy and a sensitivity analysis for hidden bias in three-group matched designs. …"

Optimal Timings Codebook.xlsx حسب Emma Spillane (11249121)

tUbenet Foundation Model Weights حسب Natalie Holroyd (7099391)

Identification and quantitation of clinically relevant microbes in patient samples: Comparison of three k-mer based classifiers for speed, accuracy, and sensitivity حسب George S. Watts (7962206)

"…We tested the accuracy, sensitivity, and resource requirements of three top metagenomic taxonomic classifiers that use fast k-mer based algorithms: Centrifuge, CLARK, and KrakenUniq. …"

Parameter settings. حسب Yang Cao (53545)

"…<div><p>Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. …"

datasheet1_Graph Neural Networks for Maximum Constraint Satisfaction.pdf حسب Jan Tönshoff (10192709)

Optimal Time Intervals of Breech Births Dataset حسب Emma Spillane (11249121)

Presentation_1_Modified GAN Augmentation Algorithms for the MRI-Classification of Myocardial Scar Tissue in Ischemic Cardiomyopathy.PPTX حسب Umesh C. Sharma (10785063)

"…Currently, there are no optimized deep-learning algorithms for the automated classification of scarred vs. normal myocardium. …"

Table_1_bSRWPSO-FKNN: A boosted PSO with fuzzy K-nearest neighbor classifier for predicting atopic dermatitis disease.docx حسب Yupeng Li (507508)

"…In bSRWPSO-FKNN, the core of which is to optimize the classification performance of FKNN through binary SRWPSO.…"

Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish) حسب Daniel Pérez Palau (11097348)

"…</p><h2>Model Architecture</h2><p dir="ltr">The model is based on <code>pysentimiento/robertuito-base-uncased</code> with the following modifications:</p><ul><li>A dense classification layer was added over the base model</li><li>Uses input IDs and attention masks as inputs</li><li>Generates a multi-class classification with 5 hate categories</li></ul><h2>Dataset</h2><p dir="ltr"><b>HATEMEDIA Dataset</b>: Custom hate speech dataset with categorization by type:</p><ul><li><b>Labels</b>: 5 hate type categories (0-4)</li><li><b>Preprocessing</b>:</li><li>Null values ​​removed from text and labels</li><li>Reindexing and relabeling (original labels are adjusted by subtracting 1)</li><li>Exclusion of category 2 during training</li><li>Conversion of category 5 to category 2</li></ul><h2>Training Process</h2><h3>Configuration</h3><ul><li><b>Batch size</b>: 128</li><li><b>Epoches</b>: 5</li><li><b>Learning rate</b>: 2e-5 with 10% warmup steps</li><li><b>Early stopping</b> with patience=2</li><li><b>Class weights</b>: Balanced to handle class imbalance</li></ul><h3>Custom Metrics</h3><ul><li>Recall for specific classes (focus on class 2)</li><li>Precision for specific classes (focus on class 3)</li><li>F1-score (weighted)</li><li>AUC-PR</li><li>Recall at precision=0.6 (class 3)</li><li>Precision at recall=0.6 (class 2)</li></ul><h2>Evaluation Metrics</h2><p dir="ltr">The model is evaluated using:</p><ul><li>Macro recall, precision, and F1-score</li><li>One-vs-Rest AUC</li><li>Accuracy</li><li>Per-class metrics</li><li>Confusion matrix</li><li>Full classification report</li></ul><h2>Technical Features</h2><h3>Data Preprocessing</h3><ul><li><b>Tokenization</b>: Maximum length of 128 tokens (truncation and padding)</li><li><b>Encoding of labels</b>: One-hot encoding for multi-class classification</li><li><b>Data split</b>: 80% training, 10% validation, 10% testing</li></ul><h3>Optimization</h3><ul><li><b>Optimizer</b>: Adam with linear warmup scheduling</li><li><b>Loss function</b>: Categorical Crossentropy (from_logits=True)</li><li><b>Imbalance handling</b>: Class weights computed automatically</li></ul><h2>Requirements</h2><p dir="ltr">The following Python packages are required:</p><ul><li>TensorFlow</li><li>Transformers</li><li>scikit-learn</li><li>pandas</li><li>datasets</li><li>matplotlib</li><li>seaborn</li><li>numpy</li></ul><h2>Usage</h2><ol><li><b>Data format</b>:</li></ol><ul><li>CSV file or Pandas DataFrame</li><li>Required column name: <code>text</code> (string type)</li><li>Required column name: Data type label (integer type, 0-4) - optional for evaluation</li></ul><ol><li><b>Text preprocessing</b>:</li></ol><ul><li>Automatic tokenization with a maximum length of 128 tokens</li><li>Long texts will be automatically truncated</li><li>Handling of special characters, URLs, and emojis included</li></ul><ol><li><b>Label encoding</b>:</li></ol><ul><li>The model classifies hate speech into 5 categories (0-4)</li><li><code>0</code>: Political hatred: Expressions directed against individuals or groups based on political orientation.…"

Processed dataset to train and test the WGAN-GP_IMOA_DA_Ensemble model حسب Ramya Chinnasamy (21633527)

Sample image for illustration. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Comparison analysis of computation time. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Process flow diagram of CBFD. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Precision recall curve. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Quadratic polynomial in 2D image plane. حسب Indhumathi S. (19173013)

"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"

Spontaneous ERG-based random forest model discriminates control and disease cases in rodent models of obesity and type 1 diabetes and predicts disease evolution in the type 1 diabe... حسب Ramsés Noguez Imm (6658637)

Contextual Dynamic Pricing with Strategic Buyers حسب Pangpang Liu (18886419)

"…<p>Personalized pricing, which involves tailoring prices based on individual characteristics, is commonly used by firms to implement a consumer-specific pricing policy. In this process, buyers can also strategically manipulate their feature data to obtain a lower price, incurring certain manipulation costs. …"

Predictive Analysis of Mushroom Toxicity Based Exclusively on Their Natural Habitat. حسب Enrico Bertozzi (22461709)

"…</p><p dir="ltr">Additionally, an exhaustive hyperparameter search was performed using GridSearchCV to optimize the C, gamma, and kernel parameters (testing 'linear,' 'rbf,' 'poly,' and 'sigmoid'), aiming to find the highest-performing configuration. …"

Thesis-RAMIS-Figs_Slides حسب Felipe Santibañez-Leal (10967991)

"…Importantly, this strategy locates samples adaptively on the transition between facies which improves the performance of conventional \emph{<i>MPS</i>} algorithms. In conclusion, this work shows that preferential sampling can contribute in \emph{<i>MPS</i>} even at very small sampling regimes and, as a corollary, demonstrates that prior models (obtained form a training image) can be used effectively not only to simulate non-sensed variables of the field, but to decide where to measure next.…"