摘要
针对标准的近似支持向量机(PSVM)没有考虑样本分布不平衡的问题,提出了一种新的PSVM算法—BPS-VM;根据训练样本数量的不平衡对正负样本集分别分配了不同的惩罚因子,并将原始优化问题中的惩罚因子由数值变更为一个对角阵,最后推导出了线性和非线性BPSVM的决策函数。实验结果表明,BPSVM的性能优于PSVM,与SVM方法相比效率更高。
For the problem of unbalanced data classification is not discussed in the standard Proximal Support Vector Machines, a new PSVM algorithm is presented, namely BPSVM. The different penalty factors are assigned to the positive and negative training sets according to the unbalanced population, and the penalty values are transformed into a diagonal rnatrim Finally the decision functions for the linear and nonlinear PSVM are obtained. The experimental results show that the generalization of BPSVM could be better than PSVM, and comparable to SVM with higher efficiency.
出处
《计算机科学》
CSCD
北大核心
2007年第5期174-176,共3页
Computer Science
基金
国防预研基金项目资助(No.51407030103DZ0117)