Abstract

Support vector machine is a kind of generalized linear classifier that classifies data in a supervised learning manner, and its decision boundary is the maximum margin hyperplane for solving learning samples. It is used to solve the problem of binary classification. For multi-classification problems, a combination method of multiple binary classifiers is usually used to solve, but such methods are prone to generate inseparable regions of data. Therefore, on the basis of constructing a multi-class problem directly, using the pinball loss function, and introducing the structural information of different classes in the data and the role of different samples, a new support vector machine algorithm Pin-SFSimMSVM for solving multi-classification problems is proposed. It not only retains the advantages of avoiding the existence of inseparable regions and fast calculation speed of multiple types of data, but also is insensitive to noise and resampling data, and has greatly improved the accuracy. The effectiveness of the proposed algorithm is verified by experimenting on UCI standard data sets and comparing with some multi-classification algorithms.

Full Text
Paper version not known

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.