Flowchart of software workflow. by Gavrielle R. Untracht (11820311)

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

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

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

“…Protruding paths are then eliminated using graph-based optimization algorithms, as demonstrated in f). …”

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

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

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

Table_1_An efficient decision support system for leukemia identification utilizing nature-inspired deep feature optimization.pdf by Muhammad Awais (263096)

“…To optimize feature selection, a customized binary Grey Wolf Algorithm is utilized, achieving an impressive 80% reduction in feature size while preserving key discriminative information. …”

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

Symmetry test result. by Jiyong Moon (16819302)

DataSheet_1_Exploring deep learning radiomics for classifying osteoporotic vertebral fractures in X-ray images.docx by Jun Zhang (48506)

“…Utilizing the binary “One-vs-Rest” strategy, the model based on the RadImageNet dataset demonstrated superior efficacy in predicting Class 0, achieving an AUC of 0.969 and accuracy of 0.863. …”

Supplementary file 1_Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery.docx by Veera Narayana Balabathina (22518524)

“…</p>Methods<p>Thirteen supervised classification algorithms were comparatively evaluated, encompassing traditional spectral/statistical classifiers—Maximum Likelihood, Mahalanobis Distance, Minimum Distance, Parallelepiped, Spectral Angle Mapper (SAM), Spectral Information Divergence (SID), and Binary Encoding—and machine learning algorithms including Decision Tree (DT), K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Random Forest (RF), and Artificial Neural Network (ANN). …”

Fig 12 - by Nisha Yadav (366131)

PathOlOgics_RBCs Python Scripts.zip by Ahmed Elsafty (16943883)

“…</p><p dir="ltr">To assess the consistency, diversity, and complexity of the processed data, the Uniform Manifold Approximation and Projection (UMAP) technique was employed to investigate the structural relationships among the various classes (see PathOlOgics_script_3; UMAP visualizations). …”

Flowchart of the entire pipeline. by Andreas Denger (12111159)

DataSheet_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx by Massaine Bandeira e Sousa (7866242)

“…Cooking data were classified into binary and multiclass variables (CT4C and CT6C). …”

Variable Selection with Multiply-Imputed Datasets: Choosing Between Stacked and Grouped Methods by Jiacong Du (12035845)

“…Building on existing work, we (i) derive and implement efficient cyclic coordinate descent and majorization-minimization optimization algorithms for continuous and binary outcome data, (ii) incorporate adaptive shrinkage penalties, (iii) compare these methods through simulation, and (iv) develop an R package <i>miselect</i>. …”

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

Flow diagram of the automatic animal detection and background reconstruction. by David Tadres (9120564)

“…(E) The threshold value is calculated based on the histogram: it is the mean of the image subtracted by 4 (optimal value defined by trial and error). …”