An accelerator for online SVM based on the fixed-size KKT window

被引:7
作者
Guo, Husheng [1 ,2 ]
Zhang, Aijuan [1 ]
Wang, Wenjian [1 ,2 ]
机构
[1] Shanxi Univ, Sch Comp & Informat Technol, Taiyuan 030006, Shanxi, Peoples R China
[2] Shanxi Univ, Key Lab Computat Intelligence & Chinese Informat, Taiyuan 030006, Shanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Online support vector machine; KKT conditions; Window technology; Accelerator; SUPPORT VECTOR MACHINE; ALGORITHM; MODEL;
D O I
10.1016/j.engappai.2020.103637
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Support vector machine (SVM), as a general and useful supervised learning tool, is facing with some challenges such as low learning efficiency, poor generalization performance, noise sensitivity, etc. when it is applied to online learning tasks. To overcome these limitations, an accelerator model based on window technology and the KKT conditions for online SVM learning is proposed in this paper. The proposed model is not an independent online algorithm but may be regarded as an accelerator for other online SVM learning algorithms, and it constructs working set of SVM by a fixed-size window with the samples which violate the KKT conditions. The relationship between Lagrangain multipliers in dual problem of SVM and KKT conditions are analyzed in the case of online learning. On this basis, a fixed-size KKT window can be constructed according to whether the samples violate KKT conditions or not. Then, it takes the samples that violate the KKT conditions as the training window, which not only makes the training samples with the same size each time, but also ensures that all samples are useful for the hyperplane updating (it means that the classifier can be updated more smoothly). Two typical and specific online SVM algorithms are used as baseline, and the corresponding speeding online SVM learning algorithms with "X+accelerator" models are proposed to testing the performance of the proposed accelerator. Comprehensive experiments clearly show that the proposed model can accelerate the online learning process effectively and has good robustness and generalization performance.
引用
收藏
页数:18
相关论文
共 39 条
  • [1] Truncated incremental search
    Aine, Sandip
    Likhachev, Maxim
    [J]. ARTIFICIAL INTELLIGENCE, 2016, 234 : 49 - 77
  • [2] [Anonymous], 2001, ADV NEURAL INFORM PR
  • [3] Robust Object Tracking with Online Multiple Instance Learning
    Babenko, Boris
    Yang, Ming-Hsuan
    Belongie, Serge
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) : 1619 - 1632
  • [4] Bordes A, 2005, LECT NOTES ARTIF INT, V3720, P505, DOI 10.1007/11564096_48
  • [5] Bordes A, 2009, J MACH LEARN RES, V10, P1737
  • [6] Campbell C, 2014, SPRINGER HANDBOOK OF BIO-/NEUROINFORMATICS, P185
  • [7] Fromm T., 2012, 2012 IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI 2012), P490, DOI 10.1109/MFI.2012.6343014
  • [8] Incremental Support Vector Learning for Ordinal Regression
    Gu, Bin
    Sheng, Victor S.
    Tay, Keng Yeow
    Romano, Walter
    Li, Shuo
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2015, 26 (07) : 1403 - 1416
  • [9] Granular support vector machine: a review
    Guo, Husheng
    Wang, Wenjian
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2019, 51 (01) : 19 - 32
  • [10] Support vector machine based on hierarchical and dynamical granulation
    Guo, Husheng
    Wang, Wenjian
    [J]. NEUROCOMPUTING, 2016, 211 : 22 - 33