【摘要】 由于标准支持向量机模型是一个二次规划问题,随着数据规模的增大,求解算法过程会越来越复杂.在K-SVCR算法结构的基础上,构造了严格凸的二次规划新模型,该模型的主要特点是可以将其一阶最优化条件转化为变分不等式问题,利用Fischer-Burmeister(FB)函数将互补问题转化为光滑方程组;建立光滑快速牛顿算法求解,并证明了该算法所产生的序列是全局收敛;利用标准数据集测试提出算法的有效性,在训练正确率和运行时间上与K-SVCR算法相比都有较好的表现,实验结果表明该算法可行且有效.更多还原

【Abstract】 Since the standard support vector machine model is a quadratic programming, the algorithm process will be more and more complicated with the increasing size of the data. In this article,a new model of a strictly convex quadratic programming is constructed which is based on the K-SVCR algorithm. The main feature of the present model is that it can transform the first-order optimality conditions into the variational inequality problems, and turn complementary problems into smooth equations by the use of the Fischer-Burmeister(FB) function. A more smooth and faster Newton algorithm is established. And this article expounds that the generated sequence by the algorithm is global convergent. After testing a standard data set, the efficiency of the algorithm was proposed. The algorithm has better performance on the training accuracy and run-time compared with the K-SVCR algorithm. The results of this experiment indicate that this algorithm was feasible and efficient.更多还原