An improved incremental training algorithm for support vector machines using active query

Shouxian Cheng, Frank Y. Shih

Research output: Contribution to journalArticlepeer-review

53 Scopus citations

Abstract

In this paper, we present an improved incremental training algorithm for support vector machines (SVMs). Instead of selecting training samples randomly, we divide them into groups and apply the k-means clustering algorithm to collect the initial set of training samples. In active query, we assign a weight to each sample according to its confidence factor and its distance to the separating hyperplane. The confidence factor is calculated from the error upper bound of the SVM to indicate the closeness of the current hyperplane to the optimal hyperplane. A criterion is developed to eliminate non-informative training samples incrementally. Experimental results show our algorithm works successfully on artificial and real data, and is superior to the existing methods.

Original languageEnglish (US)
Pages (from-to)964-971
Number of pages8
JournalPattern Recognition
Volume40
Issue number3
DOIs
StatePublished - Mar 2007

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Keywords

  • Active learning
  • Clustering algorithm
  • Incremental training
  • Pattern classification
  • Support vector machine

Fingerprint

Dive into the research topics of 'An improved incremental training algorithm for support vector machines using active query'. Together they form a unique fingerprint.

Cite this