摘要
对训练样本规模为m的标准支持向量机(Support Vector Machine,SVM)进行训练,时间复杂度为O(m3),空间复杂度为O(m2)。文章研究将其转换成等价的最小包含球(Minimum Enclosing Ball,MEB)形式,使用核心集向量机(Core Vector Machine,CVM)高效获得近似最优解。CVM的优点是时间复杂度与训练样本规模m呈线性关系,空间复杂度与m无关。实验证明,CVM可以对大规模数据集进行高效的分类。
According to the training set size m,standard SVM training has O(m3) time and O(m2) space complexities.In this paper,CVM algorithm is discussed.It transforms the kernel method into equivalent MEB problems,and gets the approximately optimal solutions efficiently by core set.CVM has a time complexity that is liner in m and a space complexity that is independent of m.The result shows that CVM algorithm can handle much larger data sets than existing scale up methods.
出处
《无锡职业技术学院学报》
2012年第4期73-76,共4页
Journal of Wuxi Institute of Technology
关键词
核向量机
支持向量机
最小包含球
核函数
Core Vector Machine(CVM)
Support Vector Machine(SVM)
Minimum Enclosing Ball(MEB)
kernel function