Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleArticle metrics
Research Article · Open access · Published 8 June 2015

Genetic Algorithm for Variable and Samples Selection in Multivariate Calibration Problems

Kelton de Souza Santiago1, Anderson Silva Soares1, Telma Woerle de Lima1, Clarimar José Coelho2 & Paulo Henrique Ribeiro Gabriel3

Journal of Computer Science, Volume 11, Issue 4, pp. 621–626 · doi.org/10.3844/jcssp.2015.621.626

7,381 accesses4,668 downloads1 citations (Crossref)Journal metrics
Cite Check for updates

Abstract

One of the main problems of quantitative analytical chemistry is to estimate the concentration of one or more species from the values of certain physicochemical properties of the system of interest. For this it is necessary to construct a calibration model, i.e., to determine the relationship between measured properties and concentrations. The multivariate calibration is one of the most successful combinations of statistical methods to chemical data, both in analytical chemistry and in theoretical chemistry. Among used methods can cite Artificial Neural Networks (ANN), the Nonlinear Partial Least Squares (N-PLS), Principal Components Regression (PCR) and Multiple Linear Regression (MLR). In addition of multivariate calibration methods algorithms of samples selection are used. These algorithms choose a subset of samples to be used in training set covering adequately the space of the samples. In other hand, a large spectrum of a sample is typically measured by modern scanning instruments generating hundreds of variables. Search algorithms have been used to identify variables which contribute useful information about the dependent variable in the model. This paper proposes a Genetic Algorithm based on Double Chromosome (GADC) to do these tasks simultaneously, the sample and variable selection. The obtained results were compared with the well-known algorithms for samples and variable selection Kennard-Stone, Partial Least Square and Successive Projection Algorithm. We showed that the proposed algorithm can obtain better calibrations models in a case study involving the determination of content protein in wheat samples.

Licence and reuse

Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Santiago, K. S., Soares, A. S., de Lima, T. W., Coelho, C. J. & Gabriel, P. H. R. (2015). Genetic Algorithm for Variable and Samples Selection in Multivariate Calibration Problems. Journal of Computer Science, 11(4), 621–626. https://doi.org/10.3844/jcssp.2015.621.626

Licence
CC BY 3.0
Issue
Volume 11, Issue 4
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Genetic Algorithm for Variable and Samples Selection in Multivariate Calibration ProblemsJournal of Computer Science · Volume 11, Issue 4 · pp. 621–626 · CC BY 3.0Download