A Comparative Study of Neural Architecture Search Methods for Medical Data Classification

Medical datasets can be small or imbalanced, making the selection of suitable neural network architectures challenging. NeuroEvolution of Augmenting Topologies (NEAT) can automate the evolution of network architectures. We tested six NEAT variants: NEAT, FS-NEAT, NEAT-DBM, HyperNEAT, C-NEAT and L-NEAT. This study aims to assess the relative benefits of these variants under a common experimental protocol. We conducted 15 runs of a repeated stratified hold-out on 20 publicly available diverse medical datasets. All algorithms had a common configuration, common implementation, nominal budget and no hyperparameter tuning. Tuning was omitted; hence, no algorithm benefited from a greater tuning effort. We chose test macro F1 as the main metric, and the Friedman test and Holm procedure for statistical analysis. Macro F1 was selected to give equal weight to all classes across datasets with different class distributions. L-NEAT, NEAT-DBM and NEAT had the best average ranks; however, they did not differ significantly among themselves. In contrast, HyperNEAT was significantly worse than NEAT, NEAT-DBM, L-NEAT and C-NEAT. FS-NEAT was significantly worse than L-NEAT, NEAT-DBM and NEAT. C-NEAT was significantly worse than L-NEAT. In the sensitivity analysis, five of the eight significant differences remained stable, whereas the NEAT–FS-NEAT, C-NEAT–L-NEAT and C-NEAT–HyperNEAT differences were sensitive to the removal of one dataset from each pair with overlapping data. L-NEAT was considerably slower than NEAT and NEAT-DBM without a significant difference in macro F1. When computational resources are limited, NEAT and NEAT-DBM might be a reasonable alternative to L-NEAT.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-11-19
DOI
https://doi.org/10.3390/app162211468
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Comparative Study of Neural Architecture Search Methods for Medical Data Classification

Wojciech Książek, Przemyslaw Plata, Szymon Salamon
Applied Sciences
Evolutionary Algorithms and Applications
article

A Comparative Study of Neural Architecture Search Methods for Medical Data Classification

Wojciech Książek, Przemyslaw Plata, Szymon Salamon
article en

Abstract

Medical datasets can be small or imbalanced, making the selection of suitable neural network architectures challenging. NeuroEvolution of Augmenting Topologies (NEAT) can automate the evolution of network architectures. We tested six NEAT variants: NEAT, FS-NEAT, NEAT-DBM, HyperNEAT, C-NEAT and L-NEAT. This study aims to assess the relative benefits of these variants under a common experimental protocol. We conducted 15 runs of a repeated stratified hold-out on 20 publicly available diverse medical datasets. All algorithms had a common configuration, common implementation, nominal budget and no hyperparameter tuning. Tuning was omitted; hence, no algorithm benefited from a greater tuning effort. We chose test macro F1 as the main metric, and the Friedman test and Holm procedure for statistical analysis. Macro F1 was selected to give equal weight to all classes across datasets with different class distributions. L-NEAT, NEAT-DBM and NEAT had the best average ranks; however, they did not differ significantly among themselves. In contrast, HyperNEAT was significantly worse than NEAT, NEAT-DBM, L-NEAT and C-NEAT. FS-NEAT was significantly worse than L-NEAT, NEAT-DBM and NEAT. C-NEAT was significantly worse than L-NEAT. In the sensitivity analysis, five of the eight significant differences remained stable, whereas the NEAT–FS-NEAT, C-NEAT–L-NEAT and C-NEAT–HyperNEAT differences were sensitive to the removal of one dataset from each pair with overlapping data. L-NEAT was considerably slower than NEAT and NEAT-DBM without a significant difference in macro F1. When computational resources are limited, NEAT and NEAT-DBM might be a reasonable alternative to L-NEAT.

Applied SciencesVol. 16(22)
Cracow University of Technology (PL)
Evolutionary Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon