de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Breaking SVM Complexity with Cross-Training

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons83791

Bakir,  GH
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons84311

Weston,  J
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bakir, G., Bottou, L., & Weston, J. (2005). Breaking SVM Complexity with Cross-Training. Advances in Neural Information Processing Systems, 81-88.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-D519-4
Abstract
We propose an algorithm for selectively removing examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler82). The procedure creates a separable distribution of training examples with minimal impact on the decision boundary position. It breaks the linear dependency between the number of SVs and the number of training examples, and sharply reduces the complexity of SVMs during both the training and prediction stages.