Online Support Vector Machine Based on Convex Hull Vertices Selection

被引:65
|
作者
Wang, Di [1 ]
Qiao, Hong [2 ]
Zhang, Bo [3 ,4 ]
Wang, Min [2 ]
机构
[1] Wenzhou Univ, Coll Math & Informat Sci, Wenzhou 325035, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China
[3] Chinese Acad Sci, LSEC, Beijing 100190, Peoples R China
[4] Chinese Acad Sci, Inst Appl Math, AMSS, Beijing 100190, Peoples R China
关键词
Kernel; machine learning; online classifier; samples selection; support vector machine; DECOMPOSITION METHODS; TRAINING ALGORITHM; SMO ALGORITHM; SVM; MODEL; CONVERGENCE;
D O I
10.1109/TNNLS.2013.2238556
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The support vector machine (SVM) method, as a promising classification technique, has been widely used in various fields due to its high efficiency. However, SVM cannot effectively solve online classification problems since, when a new sample is misclassified, the classifier has to be retrained with all training samples plus the new sample, which is time consuming. According to the geometric characteristics of SVM, in this paper we propose an online SVM classifier called VS-OSVM, which is based on convex hull vertices selection within each class. The VS-OSVM algorithm has two steps: 1) the samples selection process, in which a small number of skeleton samples constituting an approximate convex hull in each class of the current training samples are selected and 2) the online updating process, in which the classifier is updated with newly arriving samples and the selected skeleton samples. From the theoretical point of view, the first d + 1 (d is the dimension of the input samples) selected samples are proved to be vertices of the convex hull. This guarantees that the selected samples in our approach keep the greatest amount of information of the convex hull. From the application point of view, the new algorithm can update the classifier without reducing its classification performance. Experimental results on benchmark data sets have shown the validity and effectiveness of the VS-OSVM algorithm.
引用
收藏
页码:593 / 609
页数:17
相关论文
共 50 条
  • [21] Finding Convex Hull Vertices in Metric Space
    Zhong, Jinhong
    Tang, Ke
    Qin, A. K.
    PROCEEDINGS OF THE 2014 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2014, : 1587 - 1592
  • [22] Support vector machine tree based on feature selection
    Xu, Qinzhen
    Pei, Wenjiang
    Yang, Luxi
    He, Zhenya
    NEURAL INFORMATION PROCESSING, PT 1, PROCEEDINGS, 2006, 4232 : 856 - 863
  • [23] Base vector selection for support vector machine
    Li, Qing
    ADVANCES IN NATURAL COMPUTATION, PT 1, 2006, 4221 : 175 - 184
  • [24] Multiplane Convex Proximal Support Vector Machine
    Geng, Chuanxing
    Chen, Songcan
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, 34 (08) : 4918 - 4931
  • [25] Multi-instance Support Vector Machine Based on Convex Combination
    Yang, Zhi-Xia
    Deng, Naiyang
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 481 - +
  • [26] Online Support Vector Machine: A Survey
    Zhou, Xujun
    Zhang, Xianxia
    Wang, Bing
    HARMONY SEARCH ALGORITHM, 2016, 382 : 269 - 278
  • [27] An Online Algorithm for Support Vector Machine Based on Subgradient Projection
    Liu, Hua
    Sun, Zonghai
    CONTROL ENGINEERING AND APPLIED INFORMATICS, 2011, 13 (03): : 18 - 24
  • [28] Credit evaluation of online auctions based on support vector machine
    Zhu Chen
    Song Ming
    Tang Shoulian
    PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON INNOVATION & MANAGEMENT, VOLS I AND II, 2007, : 1800 - 1804
  • [29] Online Support Vector Machine Based on Minimum Euclidean Distance
    Dahiya, Kalpana
    Chauhan, Vinod Kumar
    Sharma, Anuj
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON COMPUTER VISION AND IMAGE PROCESSING, CVIP 2016, VOL 1, 2017, 459 : 89 - 99
  • [30] STUDY ON SELECTION OF LOGISTICS SUPPLIER BASED ON SUPPORT VECTOR MACHINE
    Tang, Xu-Li
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 1231 - 1235