Copositive Optimization Relaxation for Semi-supervised Support Vector Machines

摘要：

　　Given a training set of labeled data and a working set of unlabeled data, semi-supervised support vector machines (S3VMs) are based on applying the margin maximization principle to both labeled and unlabeled data. S3VMs are formulated as a mixed integer programming (MIP) problem.In this paper, we present a copositive optimization (CO) relaxation for the MIP problem associated with S3VMs.

关键词： Approximation algorithm Copositive cone Mixed integer programming Semisupervised support vector machines Semidefinite optimization

作者: Y.Q.Bai Y.Chen L.M.Sun

作者单位: Department of Mathematics,Shanghai University, Shanghai, 200444, P.R. China

会议类型: 国际会议

会议名称: 第8届国际最优化方法及应用大会

会议地点: 上海

会议语种:英文

页码: 10-10

在线出版日期: 2010-12-10（万方平台首次上网日期，不代表论文的发表时间）