Abstract
As a useful classification method, generalized eigenvalue proximal support vector machine (GEPSVM) is recently studied extensively. However, it may suffer from the sensitivity to outliers, since the L2-norm is used as a measure distance. In this paper, based on the robustness of the L1-norm, we propose an improved robust L1-norm nonparallel proximal SVM with an arbitrary Lp-norm regularization (LpNPSVM), where $p>0$ . Compared with GEPSVM, the LpNPSVM is more robust to outliers and noise. A simple but effective iterative technique is introduced to solve the LpNPSVM, and its convergence guarantee is also given when $0 . Experimental results on different types of contaminated data sets show the effectiveness of LpNPSVM. At last, we investigate our LpNPSVM on a real spare parts inspection problem. Computational results demonstrate the effectiveness of the proposed method over the GEPSVM on all the noise data.
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.