首页 | 本学科首页   官方微博 | 高级检索  
     

一种改进的最小二乘支持向量机及其应用
引用本文:余艳芳,高大启.一种改进的最小二乘支持向量机及其应用[J].计算机工程与科学,2006,28(2):69-71.
作者姓名:余艳芳  高大启
作者单位:华东理工大学计算机科学与工程系,上海,200237
基金项目:中国科学院资助项目;上海市重点项目
摘    要:为了克服传统支持向量机训练速度慢、计算资源需求大等缺点,本文应用最小二乘支持向量机算法来解决分类问题。同时,本文指出了决策导向循环图算法的缺陷,采用自适应导向循环图思想来实现多类问题的分类。为了提高样本的学习速度,本文还将序贯最小优化算法与最小二乘支持向量机相结合,最终形成了ADAGLSSVM算法。考虑到最小二
乘支持向量机算法失去了支持向量的稀疏性,本文对支持向量作了修剪。实验结果表明,修剪后,分类器的识别精度和识别速度都得到了提高。

关 键 词:最小二乘支持向量机  序贯最小优化  自适应导向循环图
文章编号:1007-130X(2006)02-0069-03
修稿时间:2004年4月20日

An Improved Least Squares Support Vector Machine and Its Applications
YU Yan-fang,GAO Da-qi.An Improved Least Squares Support Vector Machine and Its Applications[J].Computer Engineering & Science,2006,28(2):69-71.
Authors:YU Yan-fang  GAO Da-qi
Abstract:Conventional support vector machines(SVMs) have the demerits of low training speed and high computational requirements.To overcome the shortcomings,this paper applies the least squares support vector machine(LSSVM) to the issue of pattern classification.Meanwhile,this paper briefly points out the limitations of the decision directed acyclic graph(DDAG) algorithm,and uses the adaptive directed acyclic graph(ADAG) algorithm for solving multiclass problems.In order to enhance the learning speed of samples,this paper introduces sequential minimal optimization(SMO) to LSSVM,and finally constructs the ADAGLSSVM algorithm.Owing to the lacking sparsity in the LSSVM algorithm,support vectors are pruned in the experiment to improve the accuracy and speed of classifiers.Experimental result shows that the performance of classifiers is improved after pruning.
Keywords:least squares support vector machine  sequential minimal optimization  adaptive directed acyclic graph  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与科学》浏览原始摘要信息
点击此处可从《计算机工程与科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号