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

“…<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. …”

Dataset 1: Zip file containing the figures of the presented methods and results in jpeg files by Suchismita Behera (22027316)

“…<p dir="ltr">Figures represented here illustrates the <b>metaheuristic-based band selection framework</b> for hyperspectral image classification using <b>Binary Jaya Algorithm enhanced with a mutation operator</b> to improve population diversity and avoid premature convergence. …”

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

“…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. …”

Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment by Jianfang Cao (1881379)

“…<div><p>An image classification algorithm based on adaptive feature weight updating is proposed to address the low classification accuracy of the current single-feature classification algorithms and simple multifeature fusion algorithms. …”

Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization by Sandeep Jagonda Patil (22048337)

“…To tackle these challenges, this paper proposes the Blockchain Based Trusted Distributed Routing Scheme for MANET using Latent Encoder Coupled Generative Adversarial Network Optimized with Binary Emperor Penguin Optimizer (LEGAN-BEPO-BCMANET). …”

Dataset 2: Zip file containing the Tables of the presented method and results by Suchismita Behera (22027316)

Parameter settings of the comparison algorithms. by Ying Li (38224)

“…In this paper, we present an improved mountain gazelle optimizer (IMGO) based on the newly proposed mountain gazelle optimizer (MGO) and design a binary version of IMGO (BIMGO) to solve the feature selection problem for medical data. …”

A* Path-Finding Algorithm to Determine Cell Connections by Max Weng (22327159)

“…Pixel paths were classified using a z-score brightness threshold of 1.21, optimized for noise reduction and accuracy. The A* algorithm then evaluated connectivity by minimizing Euclidean distance and heuristic cost between cells. …”

Calibration curves for the test set of four models. by Meng Cao (105914)

Subjects:

SHAP bar plot. by Meng Cao (105914)

Subjects:

ROC curves for the test set of four models. by Meng Cao (105914)

Subjects:

Display of the web prediction interface. by Meng Cao (105914)

Subjects:

Sample screening flowchart. by Meng Cao (105914)

Subjects:

Descriptive statistics for variables. by Meng Cao (105914)

Subjects:

SHAP summary plot. by Meng Cao (105914)

Subjects:

Performance metrics of the models on the training and test set. by Meng Cao (105914)

Subjects:

Identification and quantitation of clinically relevant microbes in patient samples: Comparison of three k-mer based classifiers for speed, accuracy, and sensitivity by 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. …”

Testing algorithm for modified 2-tiered approaches to Lyme disease diagnosis. by Richard Porwancher (11413931)

Data_Sheet_1_Prediction of Mental Health in Medical Workers During COVID-19 Based on Machine Learning.ZIP by Xiaofeng Wang (119575)

“…In this study, we propose a novel prediction model based on optimization algorithm and neural network, which can select and rank the most important factors that affect mental health of medical workers. …”

<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. …”