期刊文献+

一种求解分类问题的新算法(英文)

A New Algorithm for Classification Problems
下载PDF
导出
摘要 本文提出了基于支持向量回归机(SVR)的一种新分类算法.它和标准的支持向量机(SVM)不同:标准的支持向量机(SVM)采用固定的模度量间隔且最优化问题与参数有关.本文中我们可以用任意模度量间隔,得到的最优化问题是无参数的线性规划问题,避免了参数选择.数值试验表明了该算法的有效性. 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.
出处 《运筹学学报》 CSCD 北大核心 2008年第2期41-48,共8页 Operations Research Transactions
基金 the Key Project of the National Natural Science Foundation of China(No.10631070) the National Natural Science Foundation of China(60573158)
关键词 运筹学 线性规划 支持向量机 无参数化 Operations research, linear programming, support vector machines, norm, parameterless
  • 相关文献

参考文献1

二级参考文献4

  • 1Cristianini N, Shawe-Tayor J. An introduction to support vector machines and other kernel-based learning methods[ M]. Cambridge: Cambridge University Press,2000.
  • 2Vapnik V.Statistical learning theory[ M] .New York:John Wiley & Sons, 1998.
  • 3Vapnik V, Chapelle o. Bounds on error expectation for support vector machines [ J ]. Neural Computation, 2000, 12 (9):928-931.
  • 4Blake C L, Merz C J. UCI repository of machine learning databases[M]. California: California Irvine, 1998.

共引文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部