CASIA OpenIR  > 09年以前成果
A simple decomposition algorithm for support vector machines with polynomial-time convergence
Qiao, Hong; Wang, Yan-Guo; Zhang, Bo
2007-09-01
发表期刊PATTERN RECOGNITION
卷号40期号:9页码:2543-2549
文章类型Article
摘要Support vector machines (SVMs) are a new and important toot in data classification. Recently much attention has been devoted to large scale data classifications where decomposition methods for SVMs play an important role.
 
So far. several decomposition algorithms for SVMs have been proposed and applied in practice. The algorithms proposed recently and based on rate certifying pair/set provide very attractive features compared with many other decomposition algorithms. They converge not only with finite termination but also in polynomial time. However, it is difficult to reach a good balance between low computational cost and fast convergence.
 
In this paper, we propose a new simple decomposition algorithm based on a new philosophy on working set selection. It has been proven that the working set selected by the new algorithm is a rate certifying set. Further, compared with the existing algorithms based on rate certifying pair/set, our algorithm provides a very good feature in combination of lower computational complexity and faster convergence. (c) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
关键词Support Vector Machines Decomposition Methods Convergence Statistical Learning Theory Pattern Recognition
WOS标题词Science & Technology ; Technology
关键词[WOS]SMO ALGORITHM
收录类别SCI
语种英语
WOS研究方向Computer Science ; Engineering
WOS类目Computer Science, Artificial Intelligence ; Engineering, Electrical & Electronic
WOS记录号WOS:000246932200015
引用统计
被引频次:5[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/9449
专题09年以前成果
通讯作者Zhang, Bo
作者单位1.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
2.Chinese Acad Sci, Inst Automat, Beijing 100080, Peoples R China
3.Coventry Univ, Dept Math Sci, Coventry CV1 5FB, W Midlands, England
推荐引用方式
GB/T 7714
Qiao, Hong,Wang, Yan-Guo,Zhang, Bo. A simple decomposition algorithm for support vector machines with polynomial-time convergence[J]. PATTERN RECOGNITION,2007,40(9):2543-2549.
APA Qiao, Hong,Wang, Yan-Guo,&Zhang, Bo.(2007).A simple decomposition algorithm for support vector machines with polynomial-time convergence.PATTERN RECOGNITION,40(9),2543-2549.
MLA Qiao, Hong,et al."A simple decomposition algorithm for support vector machines with polynomial-time convergence".PATTERN RECOGNITION 40.9(2007):2543-2549.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Qiao, Hong]的文章
[Wang, Yan-Guo]的文章
[Zhang, Bo]的文章
百度学术
百度学术中相似的文章
[Qiao, Hong]的文章
[Wang, Yan-Guo]的文章
[Zhang, Bo]的文章
必应学术
必应学术中相似的文章
[Qiao, Hong]的文章
[Wang, Yan-Guo]的文章
[Zhang, Bo]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。