A Random Sampling Technique for Training Support Vector Machines
Abstract
Random sampling techniques have been developed for combinatorial optimization problems. In this note, we report an application of one of these techniques for training support vector machines (more precisely, primal-form maximal-margin classifiers) that solve two-group classification problems by using hyperplane classifiers. Through this research, we are aiming (I) to design efficient and theoretically guaranteed support vector machine training algorithms, and (II) to develop systematic and efficient methods for finding “outliers”, i.e., examples having an inherent error.
Cite
Text
Balcázar et al. "A Random Sampling Technique for Training Support Vector Machines." International Conference on Algorithmic Learning Theory, 2001. doi:10.1007/3-540-45583-3_11Markdown
[Balcázar et al. "A Random Sampling Technique for Training Support Vector Machines." International Conference on Algorithmic Learning Theory, 2001.](https://mlanthology.org/alt/2001/balcazar2001alt-random/) doi:10.1007/3-540-45583-3_11BibTeX
@inproceedings{balcazar2001alt-random,
title = {{A Random Sampling Technique for Training Support Vector Machines}},
author = {Balcázar, José L. and Dai, Yang and Watanabe, Osamu},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2001},
pages = {119-134},
doi = {10.1007/3-540-45583-3_11},
url = {https://mlanthology.org/alt/2001/balcazar2001alt-random/}
}