Abstract

Laser‐induced breakdown spectroscopy (LIBS) is currently being used onboard the Mars Science Laboratory rover Curiosity to predict elemental abundances in dust, rocks, and soils using a partial least squares regression model developed by the ChemCam team. Accuracy of that model is constrained by the number of samples needed in the calibration, which grows exponentially with the dimensionality of the data, a phenomenon known as the curse of dimensionality. LIBS data are very high dimensional, and the number of ground‐truth samples (i.e., standards) recorded with the ChemCam before departing for Mars was small compared with the dimensionality, so strategies to optimize prediction accuracy are needed. In this study, we first use an existing machine learning algorithm, locally linear embedding (LLE), to combat the curse of dimensionality by embedding the data into a low‐dimensional manifold subspace before regressing. LLE constructs its embedding by maintaining local neighborhood distances and discarding large global geodesic distances between samples, in an attempt to preserve the underlying geometric structure of the data. We also introduce a novel supervised version, LLE for regression (LLER), which takes into account the known chemical composition of the training data when embedding. LLER is shown to outperform traditional LLE when predicting most major elements. We show the effectiveness of both algorithms using three different LIBS datasets recorded under Mars‐like conditions. Copyright © 2015 John Wiley & Sons, Ltd.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.