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

Hyperparameters of the LSTM Model. by Ahmed M. Elshewey (21463867)

“…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …”

The AD-PSO-Guided WOA LSTM framework. by Ahmed M. Elshewey (21463867)

“…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …”

Prediction results of individual models. by Ahmed M. Elshewey (21463867)

“…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …”

Sample image for illustration. by 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. …”

tUbenet Foundation Model Weights by Natalie Holroyd (7099391)

Quadratic polynomial in 2D image plane. by 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. by 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. by 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. by 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. …”

Steps in the extraction of 14 coordinates from the CT slices for the curved MPR. by Linus Woitke (22783534)

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

Fig 12 - by Nisha Yadav (366131)

DataSheet_1_Multi-Parametric MRI-Based Radiomics Models for Predicting Molecular Subtype and Androgen Receptor Expression in Breast Cancer.docx by Yuhong Huang (115702)

“…We applied several feature selection strategies including the least absolute shrinkage and selection operator (LASSO), and recursive feature elimination (RFE), the maximum relevance minimum redundancy (mRMR), Boruta and Pearson correlation analysis, to select the most optimal features. We then built 120 diagnostic models using distinct classification algorithms and feature sets divided by MRI sequences and selection strategies to predict molecular subtype and AR expression of breast cancer in the testing dataset of leave-one-out cross-validation (LOOCV). …”

Image 1_A multimodal AI-driven framework for cardiovascular screening and risk assessment in diverse athletic populations: innovations in sports cardiology.png by Minjin Guo (22751300)