节点文献

支持向量机多类分类算法的分析与设计

The Analysis and Design for the Algorithms of Multiclass Classification Based on SVM

【作者】 马波

【导师】 王正群;

【作者基本信息】 扬州大学 , 控制理论与控制工程, 2008, 硕士

【摘要】 支持向量机是上世纪九十年代提出的一种基于小样本的新的统计学习方法。支持向量机是机器学习领域若干标准技术的集成者,它集成了最大超平面、Mercer核、凸二次规划、稀疏解和松弛变量等多项技术,在若干挑战性的应用中,获得了较好的性能。由于其具有全局最优、结构简单、推广能力强等优点,近几年得到了广泛的研究并广泛应用于模式识别等领域。但是支持向量机最初是针对两类分类提出来的,如何将两类分类方法扩展到多类别分类是支持向量机研究的重点内容之一。本文从支持向量机的基本理论出发,针对分类问题着重讨论了以下几个方面的内容:(1)支持向量机二分类算法的研究,对目前存在的多种支持向量机模型进行了研究分析,比较了他们的性能与应用的范围。(2)支持向量机多类分类算法的研究,首先总结了目前存在的基于支持向量机的多类分类方法,包括“一对多”方法、“一对一”方法、一次性求解的方法、决策有向无环图方法、基于二叉树的支持向量机多类分类方法和其它几种方法,比较了他们的优缺点以及性能。同时本章中针对多类分类方法中的1-a-r(one- against-rest)方法存在由于训练样本之间的不均衡将对精度产生影响,不可识别区域等不足,提出了利用边界近邻最小二乘支持向量机来解决多类分类问题。有效地解决了上述问题,实验结果表明该方法的有效性。(3)基于原型超平面支持向量机的研究。介绍了原型超平面支持向量机的产生,并针对其分类规则在某些情形会导致较差的分类结果,提出了在利用基于广义特征的最接近支持向量机(GEPSVM)产生一个主原型超平面的基础上,再利用主原型超平面及它类样本的信息构造一个次原型超平面,形成一个由主次原型超平面共同决策的最接近支持向量机。该方法不仅简单且易于实现,还具有较GEPSVM更优的分类性能。在UCI数据集上实验验证了它的有效性。(4)将基于主次原型超平面最接近支持向量机分类器与主分量分析结合,应用于人脸识别过程,并与传统的最近邻分类器比较,实验证明了其效果优于传统的最近邻分类规则。

【Abstract】 Support vector machine (SVM) is a statistic learning method based on less samples proposed in recent years. Support vector machine is very specific class of algorithms characterized by the use of the maximal margin hyper-plane the theory of kernels, the absence of local minima, the convex optimization the sparseness of the solution, Mercer’s theorem and the capacity control obtained by acting on the margin. A large number of experiments have shown that support vector machine has not only simpler structure, but also better performance, especially its better generalization ability. The support vector machines approach was originally developed to solve binary classification problems. But in many fields, we need to solve multi-class classification problems. How to effectively extend it for multi-class classification is still an on-going research issue.In this paper, some problems of support vector machines algorithms are analyzed. 1) An overview on a variety of classification algorithms for support vector machines is given. We have carried on in-depth analysis to the many kinds of support vector machines algorithms that existed at present, and compared their performance and range of application. 2) SVM for mufti-class problems is discussed. Several methods have been proposed including "one-against-all", "one-against-one", DAGSVM, Classification method of mufti-class SVM based on binary tree, and so on. And their pluses and minuses and performances are compared. To overcome the support vector machine based on 1-a-r (one–against-rest) method have the accuracy influence of sample imbalance and existing reject area a new support vector machine based on boundary nearest methods was proposed, and acquire very good results. 3) In this part GEPSVM was discussed. First the produce of GEPSVM was introduced. To overcome the result in some case is bad, a new proximal support vector machine based on primary and secondary prototypal hyperplanes is proposed. First, produce the primary prototypal hyperplanes by GEPSVM, than, produce the secondary prototypal hyperplanes using primary prototypal hyperplanes and the information of other class. This method not only simple and easy to realization, but also improves the classification accuracy of GEPSVM, which has been validated on real UCI datasets.4) Proximal support vector machine based on primary and secondary prototypal hyperplanes combining with PCA is applied in face recognition. Compared with traditional classification method, this method improves the classification accuracy.

  • 【网络出版投稿人】 扬州大学
  • 【网络出版年期】2009年 03期
节点文献中: 

本文链接的文献网络图示:

本文的引文网络