Abstract
We present in this work a new Sparse Hybrid Classifier, by using reduced remaining subset (RRS) with least squares support vector machine (LS-SVM). RRS is a sample selection technique based on a modified nearest neighbor rule. It is used in order to choose the best samples to represent each class of a given database. After that, LS-SVM uses the samples selected by RRS as support vectors to find the decision surface between the classes, by solving a system of linear equations. This hybrid classifier is considered as a sparse one because it is able to detect support vectors, what is not possible when using LS-SVM separately. Some experiments are presented to compare the proposed approach with two existent methods that also aim to impose sparseness in LS-SVMs, called LS 2-SVM and Ada-Pinv.
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.
