STAR - Sparsity through Automated Rejection

  • Authors:
  • Robert Burbidge;Matthew Trotter;Bernard F. Buxton;Sean B. Holden

  • Affiliations:
  • -;-;-;-

  • Venue:
  • IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Heuristic methods for the rejection of noisy training examples in the support vector machine (SVM) are introduced. Rejection of' training errors, either offline or online, results in a sparser model that is less affected by noisy data. A simple offline heuristic provides sparser models with similar generalization performance to the standard SVM, at the expense of longer training times. An online approximation of this heuristic reduces training time and provides a sparser model than the SVM with a slight decrease in generalization perfprmance.