RESUMEN
Although commercially available software provides options for automatic peak detection, visual inspection and manual corrections are often needed. Peak detection algorithms commonly employed require carefully written rules and thresholds to increase true positive rates and decrease false positive rates. In this study, a deep learning model, specifically, a convolutional neural network (CNN), was implemented to perform automatic peak detection in reversed-phase liquid chromatography (RPLC). The model inputs a whole chromatogram and outputs predicted locations, probabilities, and areas of the peaks. The obtained results on a simulated validation set demonstrated that the model performed well (ROC-AUC of 0.996), and comparably or better than a derivative-based approach using the Savitzky-Golay algorithm for detecting peaks on experimental chromatograms (8.6% increase in true positives). In addition, predicted peak probabilities (typically between 0.5 and 1.0 for true positives) gave an indication of how confident the CNN model was in the peaks detected. The CNN model was trained entirely on simulated chromatograms (a training set of 1,000,000 chromatograms), and thus no effort had to be put into collecting and labeling chromatograms. A potential major drawback of this approach, namely training a CNN model on simulated chromatograms, is the risk of not capturing the actual "chromatogram space" well enough that is needed to perform accurate peak detection in real chromatograms.
Asunto(s)
Cromatografía de Fase Inversa , Redes Neurales de la Computación , Algoritmos , Programas InformáticosRESUMEN
Enhancement of chromatograms, such as the reduction of baseline noise and baseline drift, is often essential to accurately detect and quantify analytes in a mixture. Current methods have been well studied and adopted for decades and have assisted researchers in obtaining reliable results. However, these methods rely on relatively simple statistics of the data (chromatograms) which in some cases result in significant information loss and inaccuracies. In this study, a deep one-dimensional convolutional autoencoder was developed that simultaneously removes baseline noise and baseline drift with minimal information loss, for a large number and great variety of chromatograms. To enable the autoencoder to denoise a chromatogram to be almost, or completely, noise-free, it was trained on data obtained from an implemented chromatogram simulator that generated 190.000 representative simulated chromatograms. The trained autoencoder was then tested and compared to some of the most widely used and well-established denoising methods on testing datasets of tens of thousands of simulated chromatograms; and then further tested and verified on real chromatograms. The results show that the developed autoencoder can successfully remove baseline noise and baseline drift simultaneously with minimal information loss; outperforming methods like Savitzky-Golay smoothing, Gaussian smoothing and wavelet smoothing for baseline noise reduction (root mean squared error of 1.094 mAU compared to 2.074 mAU, 2.394 mAU and 2.199 mAU) and Savitkzy-Golay smoothing combined with asymmetric least-squares or polynomial fitting for baseline noise and baseline drift reduction (root mean absolute error of 1.171 mAU compared to 3.397 mAU and 4.923 mAU). Evidence is presented that autoencoders can be utilized to enhance and correct chromatograms and consequently improve and alleviate downstream data analysis, with the drawback of needing a carefully implemented simulator, that generates realistic chromatograms, to train the autoencoder.
Asunto(s)
Cromatografía/métodos , Algoritmos , Humanos , Análisis de los Mínimos Cuadrados , Redes Neurales de la ComputaciónRESUMEN
An important challenge in chromatography is the development of adequate separation methods. Accurate retention models can significantly simplify and expedite the development of adequate separation methods for complex mixtures. The purpose of this study was to introduce reinforcement learning to chromatographic method development, by training a double deep Q-learning algorithm to select optimal isocratic scouting runs to generate accurate retention models. These scouting runs were fit to the Neue-Kuss retention model, which was then used to predict retention factors both under isocratic and gradient conditions. The quality of these predictions was compared to experimental data points, by computing a mean relative percentage error (MRPE) between the predicted and actual retention factors. By providing the reinforcement learning algorithm with a reward whenever the scouting runs led to accurate retention models and a penalty when the analysis time of a selected scouting run was too high (> 1h); it was hypothesized that the reinforcement learning algorithm should by time learn to select good scouting runs for compounds displaying a variety of characteristics. The reinforcement learning algorithm developed in this work was first trained on simulated data, and then evaluated on experimental data for 57 small molecules - each run at 10 different fractions of organic modifier (0.05 to 0.90) and four different linear gradients. The results showed that the MRPE of these retention models (3.77% for isocratic runs and 1.93% for gradient runs), mostly obtained via 3 isocratic scouting runs for each compound, were comparable in performance to retention models obtained by fitting the Neue-Kuss model to all (10) available isocratic datapoints (3.26% for isocratic runs and 4.97% for gradient runs) and retention models obtained via a "chromatographer's selection" of three scouting runs (3.86% for isocratic runs and 6.66% for gradient runs). It was therefore concluded that the reinforcement learning algorithm learned to select optimal scouting runs for retention modeling, by selecting 3 (out of 10) isocratic scouting runs per compound, that were informative enough to successfully capture the retention behavior of each compound.