Abstract

ABSTRACT The multiple birth support vector machine (MBSVM) typically utilizes a hinge loss function, which is susceptible to noise sensitivity and instability during resampling. To overcome these issues, we introduce two models: linear and nonlinear MBSVM models, both utilizing a pinball loss function. The main goal of these models is to improve the classification performance and noise resilience of the Pin-MBSVM by optimizing the maximum quantile distance. Additionally, to decrease the computation time for these models, we provide an in-depth discussion of a fast algorithm based on the successive overrelaxation (SOR) iteration method. In experiments, we test the Pin-MBSVM algorithm using both UCI datasets and synthetic datasets, comparing its performance with OVO-TWSVM, OVA-TWSVM and MBSVM. The results show that our methods successfully reduce the noise sensitivity and resampling instability found in traditional MBSVM while preserving the model’s computational efficiency. Finally, the effectiveness of our model was validated using the Friedman test and Bonferroni–Dunn test.

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.