Abstract
The proximal classifier with consistency (PCC) is an improvement of generalized eigenvalue proximal support vector machine (GEPSVM), ensuring consistency ignored in GEPSVM. However, similar to many other machine learning methods, PCC uses only the global information and the eigenvalue problem need to be solved, which can not classify small sample size (SSS) problem effectively. By exploiting both global and local information, we propose a novel binary classifier named locality sensitive proximal classifier with consistency (LSPCC). Our LSPCC determines two proximal hyperplanes by solving two small eigenvalue problems. This makes our LSPCC is able to deal with SSS problem well. Experimental results on several standard small sample size datasets have shown the superiority of our approach.
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.
