Diversified SVM ensembles for large data sets

Ivor W. Tsang*, Andras Kocsor, James T. Kwok

*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

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.

Original languageEnglish
Title of host publicationMachine Learning
Subtitle of host publicationECML 2006 - 17th European Conference on Machine Learning, Proceedings
PublisherSpringer Verlag
Pages792-800
Number of pages9
ISBN (Print)354045375X, 9783540453758
DOIs
Publication statusPublished - 2006
Event17th European Conference on Machine Learning, ECML 2006 - Berlin, Germany
Duration: 18 Sept 200622 Sept 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4212 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th European Conference on Machine Learning, ECML 2006
Country/TerritoryGermany
CityBerlin
Period18/09/0622/09/06

Fingerprint

Dive into the research topics of 'Diversified SVM ensembles for large data sets'. Together they form a unique fingerprint.

Cite this