This paper is concerned with the robust feasibility for a class of support vector machine problems with uncertain data.Firstly,a robust counterpart problem of the uncertain support vector machine problem is introduced in terms of robust op-timization.Then,a reformulation of the robust counterpart problem of the uncertain support vector machine problem is given.Finally,by using this reformulation and the so-called epigraphical set,an exact formula for the radius of robust feasibility of the uncertain support vector machine problem is obtained.
关键词
支持向量机问题/鲁棒优化/鲁棒可行性
Key words
Support vector machine problem/robust optimization/robust feasibility
维普
万方数据