摘要
基于标准支持向量机及其启发,提出并证明支持向量数(率)和边界支持向量数(率)的界,并分别推广到正例类和反例类.在此基础上,证明正例的分类精度依概率小于反例的分类精度.虚拟数据仿真和Benchm ark数据仿真表明本文所提方法的有效性和结论的正确性.*
Based on standard support vector machines (SVMs), the bound of both the support vector number (aaul rate) and boundary support vector number( and rate)is proposed and proved. Then the bounds are extended to positive class and negative class respectively. On the basis of the bounds, it is proved that the positive class yields poorer classification and predictive accuracy than the negative class does. Simulation results of both artificial data sets and benchmark data sets show that the conclusion and method in this paper is true and effective.
出处
《信息与控制》
CSCD
北大核心
2005年第6期703-708,共6页
Information and Control
关键词
不平衡数据
有偏分类器
支持向量机
unbalanced data set
biased classifier
support vector machine (SVM)