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 |
| 关键词 | support vector machines decomposition methods convergence statistical learning theory pattern recognition |
| ISSN号 | 0031-3203 |
| DOI | 10.1016/j.patcog.2006.12.024 |
| 英文摘要 | 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. |
| WOS研究方向 | Computer Science ; Engineering |
| 语种 | 英语 |
| WOS记录号 | WOS:000246932200015 |
| 出版者 | PERGAMON-ELSEVIER SCIENCE LTD |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/4515]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。