Nearest-neighbour classifiers are simple and effective, but their performance and inference cost depend strongly on the size and quality of the reference (design) set. This work studies an evolutionary prototype selection strategy for k-nearest neighbour (k-NN) classification, where a genetic algorithm (GA) evolves compact, class-balanced prototype banks from the design partition and the selected prototypes are then used by a 1-NN classifier. Individuals encode fixed numbers of prototype indices per class, and fitness is defined as the number of correctly classified test samples. We evaluate the approach across five scenarios: two synthetic Gaussian benchmarks (2D, with different overlap levels), a synthetic 3D “three moons” dataset, and three real datasets (Breast Cancer Wisconsin, Wine, and a reduced MNIST setting using 8 × 8 digit images). For each scenario, results are aggregated over repeated runs with different random seeds and compared against standard 1-NN and 3-NN baselines that use all design samples as neighbours. The experimental evidence shows that GA-selected prototype banks can match ceiling performance in highly separable cases and provide consistent gains in noisier or more redundant settings, while reducing the neighbour set size by orders of magnitude. These results support the hypothesis that evolutionary, class-balanced prototype selection improves k-NN generalization and efficiency without requiring changes to the underlying distance metric or classifier structure. The results show that the proposed method is well aligned with application scenarios in which memory or latency budgets specify a hard upper bound on the number of prototypes that can be stored or consulted. In such cases, a simple single-objective algorithm like the proposed approach is a natural choice, and the results reported here provide a baseline against which more complex methods can be fairly compared.
Nearest-neighbor classifiers are accurate and easy to deploy, but their memory footprint and inference time grow with the size of the reference set. This paper studies an evolutionary prototype selection strategy for k-nearest neighbor (K-NN) classification aimed at extreme, class-balancedreduction. A compact genetic algorithm (GA) evolves a fixed number of prototype indices per class drawn from a disjoint design partition; the selected prototypes are then used by a 1-NN classifier, with fitness defined as the number of correctly classified test instances. To address concerns about generality and baseline strength, we evaluate an experimental suite including synthetic 2D Gaussians ( and ) and a 3D three-moons geometry, as well as public benchmarks spanning binary and multi-class settings and higher-dimensional data (Breast Cancer Wisconsin, Wine, Reduced MNIST/Digits 8 × 8, Forest CoverType with seven classes, and a 10D five-class spiral benchmark). We compare against K-NN baselines with using all design samples, and include GA operator ablations (GA1/GA2/GA3). Each scenario is repeated over 30 independent runs, reporting mean ± std, min/max, per-run distributions, win/tie/loss counts, and non-parametric significance tests (paired Wilcoxon with Holm correction; Friedman where applicable). Across datasets, the GA-selected prototype banks—often orders of magnitude smaller than the full design set—match or improve accuracy, with frequent statistically supported wins against strong K-NN baselines, and in the hardest cases provide substantial compression with no loss relative to the best baseline. These results establish a reproducible baseline for extreme, class-balanced prototype reduction suitable for memory- and latency-constrained deployments and for fair comparison against more elaborate prototype selection methods.