| 一种求解分类问题的新算法 |
| |
| 引用本文： | 秦如新,陈静,邓乃扬.一种求解分类问题的新算法[J].运筹学学报,2008,12(2):41-48. |
| |
| 作者姓名： | 秦如新 陈静 邓乃扬 |
| |
| 作者单位： | 中国农业大学理学院,北京,100083 |
| |
| 基金项目： | 国家自然科学基金
,
国家自然科学基金 |
| |
| 摘 要： | 本文提出了基于支持向量回归机(SVR)的一种新分类算法.它和标准的支持向量机(SVM)不同:标准的支持向量机(SVM)采用固定的模度量间隔且最优化问题与参数有关.本文中我们可以用任意模度量间隔,得到的最优化问题是无参数的线性规划问题,避免了参数选择.数值试验表明了该算法的有效性.
|
| 关 键 词： | 运筹学 线性规划 支持向量机 模 无参数化 Operations research linear programming support vector machines norm parameterless 求解 分类问题 算法 Problems Classification experiments show validity optimization problem linear programming measure paper margin fixed norm parameters different form standard Support vector machine |
A New Algorithm for Classification Problems |
| |
| Qin Ruxin,Chen Jing,Deng Naiyang.A New Algorithm for Classification Problems[J].OR Transactions,2008,12(2):41-48. |
| |
| Authors: | Qin Ruxin Chen Jing Deng Naiyang |
| |
| Abstract: | A new algorithm to solve classification problems is obtained based on the support vector regression (SVR). It is different form the standard Support vector machine (SVM): The margin is measured by fixed norm and the optimization problems depend on the parameters in the standard SVM. In this paper, we can measure the margin by arbitrary norm, and the deduced optimization problem is a linear programming without parameters. Preliminary experiments also show the validity of our new algorithm. |
| |
| Keywords: | Operations research linear programming support vector machines norm parameterless |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
