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-ofthe-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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Tsang, I. W., Kocsor, A., & Kwok, J. T. (2006). Diversified SVM ensembles for large data sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4212 LNAI, pp. 792–800). Springer Verlag. https://doi.org/10.1007/11871842_81
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.