CASIA OpenIR  > 09年以前成果
A simple decomposition algorithm for support vector machines with polynomial-time convergence
Qiao, Hong; Wang, Yan-Guo; Zhang, Bo
Source PublicationPATTERN RECOGNITION
2007-09-01
Volume40Issue:9Pages:2543-2549
SubtypeArticle
AbstractSupport 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.
KeywordSupport Vector Machines Decomposition Methods Convergence Statistical Learning Theory Pattern Recognition
WOS HeadingsScience & Technology ; Technology
WOS KeywordSMO ALGORITHM
Indexed BySCI
Language英语
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Artificial Intelligence ; Engineering, Electrical & Electronic
WOS IDWOS:000246932200015
Citation statistics
Document Type期刊论文
Identifierhttp://ir.ia.ac.cn/handle/173211/9449
Collection09年以前成果
Corresponding AuthorZhang, Bo
Affiliation1.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
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Qiao, Hong]'s Articles
[Wang, Yan-Guo]'s Articles
[Zhang, Bo]'s Articles
Baidu academic
Similar articles in Baidu academic
[Qiao, Hong]'s Articles
[Wang, Yan-Guo]'s Articles
[Zhang, Bo]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Qiao, Hong]'s Articles
[Wang, Yan-Guo]'s Articles
[Zhang, Bo]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.