Abstract
AbstractThe introduction of support vector regression (SVR) and least square support vector machines (LS‐SVM) methods for regression purposes in the field of chemometrics has provided advantageous alternatives to the existing linear and nonlinear multivariate calibration (MVC) approaches. Relevance vector machines (RVMs) claim the advantages attributed to all the SVM‐based methods over many other regression methods. Additionally, it also exhibits advantages over the standard SVM‐based ones since: it is not necessary to estimate the error/margin trade‐off parameter C and the insensitivity parameter ε in regression tasks, it is applicable to arbitrary basis functions, the algorithm gives probability estimates seamlessly and offer, additionally, excellent sparseness capabilities, which can result in a simple and robust model for the estimation of different properties. This paper presents the use of RVMs as a nonlinear MVC method capable of dealing with ill‐posed problems. To study its behavior, three different chemometric benchmark datasets are considered, including both linear and non‐linear solutions. RVM was compared with other calibration approaches reported in the literature. Although RVM performance is comparable with the best results obtained by LS‐SVM, the final model achieved is sparser, so the prediction process is faster. Taking into account the other advantages attributed to RVMs, it can be concluded that this technique can be seen as a very promising option to solve nonlinear problems in MVC. Copyright © 2008 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.