Diversified SVM Ensembles for Large Data Sets
Abstract
Recently, the core vector machine (CVM) has shown significant speedups on classification and regression problems with massive data sets. Its performance is also almost as accurate as other state-of-the-art SVM implementations. By incorporating the orthogonality constraints to diversify the CVM ensembles, this turns out to speed up the maximum margin discriminant analysis (MMDA) algorithm. Extensive comparisons with the MMDA ensemble along with bagging on a number of large data sets show that the proposed diversified CVM ensemble can improve classification performance, and is also faster than the original MMDA algorithm by more than an order of magnitude.
Cite
Text
Tsang et al. "Diversified SVM Ensembles for Large Data Sets." European Conference on Machine Learning, 2006. doi:10.1007/11871842_81Markdown
[Tsang et al. "Diversified SVM Ensembles for Large Data Sets." European Conference on Machine Learning, 2006.](https://mlanthology.org/ecmlpkdd/2006/tsang2006ecml-diversified/) doi:10.1007/11871842_81BibTeX
@inproceedings{tsang2006ecml-diversified,
title = {{Diversified SVM Ensembles for Large Data Sets}},
author = {Tsang, Ivor W. and Kocsor, András and Kwok, James T.},
booktitle = {European Conference on Machine Learning},
year = {2006},
pages = {792-800},
doi = {10.1007/11871842_81},
url = {https://mlanthology.org/ecmlpkdd/2006/tsang2006ecml-diversified/}
}