Abstract
This paper presents an analysis of nonlinear extensions to Partial Least Squares (PLS) using error-based minimization techniques. The analysis revealed that such algorithms are maximizing the accuracy with which the response variables are predicted. Therefore, such algorithms are nonlinear reduced rank regression algorithms rather than nonlinear PLS algorithms
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
