Sample reduction for SVMs via data structure analysis

  • Defeng Wang*
  • , Daniel S. Yeung
  • , Eric C.C. Tsang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents a new sample reduction algorithm, Sample Reduction by Data Structure Analysis (SR-DSA), for SVMs to improve their scalability. SR-DSA utilizes data structure information in determining which data points are not useful in learning the separating plane and could be removed. As this algorithm is performed before SVMs training, it avoids the problem suffered by most sample reduction methods whose choices of samples heavily depend on repeatedly training of SVMs. Experiments on both synthetic and real world datasets have shown that SR-DSA is capable of reducing the number of samples as well as the time for SVMs training while maintaining high testing accuracy.

Original languageEnglish
Title of host publication2007 IEEE International Conference on System of Systems Engineering, SOSE
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 IEEE International Conference on System of Systems Engineering, SOSE - San Antonio, TX, United States
Duration: 16 Apr 200718 Apr 2007

Publication series

Name2007 IEEE International Conference on System of Systems Engineering, SOSE

Conference

Conference2007 IEEE International Conference on System of Systems Engineering, SOSE
Country/TerritoryUnited States
CitySan Antonio, TX
Period16/04/0718/04/07

Keywords

  • Hierarchical clustering
  • Mahalanobis distance
  • Sample reduction
  • Support Vector Machines (SVMs)

Fingerprint

Dive into the research topics of 'Sample reduction for SVMs via data structure analysis'. Together they form a unique fingerprint.

Cite this