Abstract

The aim of this work is to present a new training algorithm for SVMs based on the pattern selection strategy called Error Dependent Repetition (EDR). With EDR, the presentation frequency of a pattern depends on its error: patterns with larger errors are selected more frequently and patterns with smaller error (or learned) are presented with minor frequency. Using a simple iterative process based on gradient ascent, SVM-EDR can solve the dual problem without any assumption about support vectors or the Karush-Kuhn-Tucker (KKT) conditions.

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.