A simple decomposition algorithm for support vector machines with polynomial-time convergence

CASIA OpenIR > 09年以前成果

	A simple decomposition algorithm for support vector machines with polynomial-time convergence
	Qiao, Hong; Wang, Yan-Guo ; Zhang, Bo
发表期刊	PATTERN RECOGNITION
	2007-09-01
卷号	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
引用统计	被引频次：6[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.