Abstract
A fast and simple method is proposed to build low complexity radial basis function (RBF) classifiers. It is based on the approximation of the decision rule of a support vector machine by an RBF network, and integrates the dynamic decay adjustment algorithm with selective pruning and standard least squares techniques. Experimental results on several benchmark data sets, concerning both binary and multi-class problems, show the effectiveness of the proposed method.
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.