Improving data splitting for classification applications in spectrochemical analyses employing a random-mutation Kennard-Stone algorithm approach

• Published in: Bioinformatics (Oxford, England) Vol. 35; no. 24; pp. 5257 - 5263
• Main Authors: Morais, Camilo L M, Santos, Marfran C D, Lima, Kássio M G, Martin, Francis L
• Format: Journal Article
• Language: English
• Published: England Oxford University Press 15.12.2019
• Subjects: Algorithms; Discriminant Analysis; Mutation; Original Papers; Principal Component Analysis
• ISSN: 1367-4803; 1367-4811; 1367-4811
• DOI: 10.1093/bioinformatics/btz421

Data splitting is a fundamental step for building classification models with spectral data, especially in biomedical applications. This approach is performed following pre-processing and prior to model construction, and consists of dividing the samples into at least training and test sets; herein, the training set is used for model construction and the test set for model validation. Some of the most-used methodologies for data splitting are the random selection (RS) and the Kennard-Stone (KS) algorithms; here, the former works based on a random splitting process and the latter is based on the calculation of the Euclidian distance between the samples. We propose an algorithm called the Morais-Lima-Martin (MLM) algorithm, as an alternative method to improve data splitting in classification models. MLM is a modification of KS algorithm by adding a random-mutation factor. RS, KS and MLM performance are compared in simulated and six real-world biospectroscopic applications using principal component analysis linear discriminant analysis (PCA-LDA). MLM generated a better predictive performance in comparison with RS and KS algorithms, in particular regarding sensitivity and specificity values. Classification is found to be more well-equilibrated using MLM. RS showed the poorest predictive response, followed by KS which showed good accuracy towards prediction, but relatively unbalanced sensitivities and specificities. These findings demonstrate the potential of this new MLM algorithm as a sample selection method for classification applications in comparison with other regular methods often applied in this type of data. MLM algorithm is freely available for MATLAB at https://doi.org/10.6084/m9.figshare.7393517.v1.