Posterior probability support vector machines for unbalanced data.
This paper proposes a complete framework of posterior probability support vector machines (PPSVMs) for weighted training samples using modified concepts of risks, linear separability, margin, and optimal hyperplane. Within this framework, a new optimization problem for unbalanced classification problems is formulated and a new concept of support vectors established. Furthermore, a soft PPSVM with an interpretable parameter v is obtained which is similar to the v-SVM developed by Schölkopf et al., and an empirical method for determining the posterior probability is proposed as a new approach to determine v. The main advantage of an PPSVM classifier lies in that fact that it is closer to the Bayes optimal without knowing the distributions. To validate the proposed method, two synthetic classification examples are used to illustrate the logical correctness of PPSVMs and their relationship to regular SVMs and Bayesian methods. Several other classification experiments are conducted to demonstrate that the performance of PPSVMs is better than regular SVMs in some cases. Compared with fuzzy support vector machines (FSVMs), the proposed PPSVM is a natural and an analytical extension of regular SVMs based on the statistical learning theory.
Tao
Qing
Q
Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, Beijing 100080, P.R. China. qing.tao@mail.ia.ac.cn
Wu
Gao-Wei
GW
Wang
Fei-Yue
FY
Wang
Jue
J
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D016208:Databases, Factual; D016247:Information Storage and Retrieval / Q000379:methods*; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*