Support Vector Machine Classifier via $L_{0/1}$ Soft-Margin Loss
نویسندگان
چکیده
منابع مشابه
Support Vector Machine Soft Margin Classifiers: Error Analysis
The purpose of this paper is to provide a PAC error analysis for the q-norm soft margin classifier, a support vector machine classification algorithm. It consists of two parts: regularization error and sample error. While many techniques are available for treating the sample error, much less is known for the regularization error and the corresponding approximation error for reproducing kernel H...
متن کاملFault diagnosis in a distillation column using a support vector machine based classifier
Fault diagnosis has always been an essential aspect of control system design. This is necessary due to the growing demand for increased performance and safety of industrial systems is discussed. Support vector machine classifier is a new technique based on statistical learning theory and is designed to reduce structural bias. Support vector machine classification in many applications in v...
متن کاملInduction Machine Fault Detection Using Support Vector Machine Based Classifier
Industrial motors are subject to various faults which, if unnoticed, can lead to motor failure. The necessity of incipient fault detection can be justified by safety and economical reasons. The technology of artificial neural networks has been successfully used to solve the motor fault detection problem. This paper develops inexpensive, reliable, and noninvasive NN based fault detection scheme ...
متن کاملSoft Margin Support Vector Classification as Buffered Probability Minimization
In this paper, we show that the popular C-SVM, soft-margin support vector classifier is equivalent to minimization of Buffered Probability of Exceedance (bPOE) by introducing a new SVM formulation, called the EC-SVM, which is derived as a bPOE minimization problem. Since it is derived from a simple bPOE minimization problem, the EC-SVM is simple to interpret with a meaningful free parameter, op...
متن کاملRamp loss linear programming support vector machine
The ramp loss is a robust but non-convex loss for classification. Compared with other non-convex losses, a local minimum of the ramp loss can be effectively found. The effectiveness of local search comes from the piecewise linearity of the ramp loss. Motivated by the fact that the `1-penalty is piecewise linear as well, the `1-penalty is applied for the ramp loss, resulting in a ramp loss linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2021
ISSN: 0162-8828,2160-9292,1939-3539
DOI: 10.1109/tpami.2021.3092177