Improving bagging performance through multi-algorithm ensembles

Kuo Wei Hsu, Jaideep Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Bagging establishes a committee of classifiers first and then aggregates their outcomes through majority voting. Bagging has attracted considerable research interest and been applied in various application domains. Its advantages include an increased capability of handling small data sets, less sensitivity to noise or outliers, and a parallel structure for efficient implementations. However, it has been found to be less accurate than some other ensemble methods. In this paper, we propose an approach that improves bagging through the employment of multiple classification algorithms in ensembles. Our approach preserves the parallel structure of bagging and improves the accuracy of bagging. As a result, it unlocks the power and expands the user base of bagging.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages471-482
Number of pages12
Volume7104 LNAI
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event15th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2011 - Shenzhen
Duration: 24 May 201127 May 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7104 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other15th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2011
CityShenzhen
Period24/5/1127/5/11

Fingerprint

Bagging
Ensemble
Classifiers
Majority Voting
Ensemble Methods
Classification Algorithm
Efficient Implementation
Expand
Outlier
Classifier

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Hsu, K. W., & Srivastava, J. (2012). Improving bagging performance through multi-algorithm ensembles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7104 LNAI, pp. 471-482). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7104 LNAI). https://doi.org/10.1007/978-3-642-28320-8_40

Improving bagging performance through multi-algorithm ensembles. / Hsu, Kuo Wei; Srivastava, Jaideep.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7104 LNAI 2012. p. 471-482 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7104 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hsu, KW & Srivastava, J 2012, Improving bagging performance through multi-algorithm ensembles. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7104 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7104 LNAI, pp. 471-482, 15th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2011, Shenzhen, 24/5/11. https://doi.org/10.1007/978-3-642-28320-8_40
Hsu KW, Srivastava J. Improving bagging performance through multi-algorithm ensembles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7104 LNAI. 2012. p. 471-482. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-28320-8_40
Hsu, Kuo Wei ; Srivastava, Jaideep. / Improving bagging performance through multi-algorithm ensembles. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7104 LNAI 2012. pp. 471-482 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9d90e680a67b4df2b564d6dac6f0a666,
title = "Improving bagging performance through multi-algorithm ensembles",
abstract = "Bagging establishes a committee of classifiers first and then aggregates their outcomes through majority voting. Bagging has attracted considerable research interest and been applied in various application domains. Its advantages include an increased capability of handling small data sets, less sensitivity to noise or outliers, and a parallel structure for efficient implementations. However, it has been found to be less accurate than some other ensemble methods. In this paper, we propose an approach that improves bagging through the employment of multiple classification algorithms in ensembles. Our approach preserves the parallel structure of bagging and improves the accuracy of bagging. As a result, it unlocks the power and expands the user base of bagging.",
author = "Hsu, {Kuo Wei} and Jaideep Srivastava",
year = "2012",
doi = "10.1007/978-3-642-28320-8_40",
language = "English",
isbn = "9783642283192",
volume = "7104 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "471--482",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Improving bagging performance through multi-algorithm ensembles

AU - Hsu, Kuo Wei

AU - Srivastava, Jaideep

PY - 2012

Y1 - 2012

N2 - Bagging establishes a committee of classifiers first and then aggregates their outcomes through majority voting. Bagging has attracted considerable research interest and been applied in various application domains. Its advantages include an increased capability of handling small data sets, less sensitivity to noise or outliers, and a parallel structure for efficient implementations. However, it has been found to be less accurate than some other ensemble methods. In this paper, we propose an approach that improves bagging through the employment of multiple classification algorithms in ensembles. Our approach preserves the parallel structure of bagging and improves the accuracy of bagging. As a result, it unlocks the power and expands the user base of bagging.

AB - Bagging establishes a committee of classifiers first and then aggregates their outcomes through majority voting. Bagging has attracted considerable research interest and been applied in various application domains. Its advantages include an increased capability of handling small data sets, less sensitivity to noise or outliers, and a parallel structure for efficient implementations. However, it has been found to be less accurate than some other ensemble methods. In this paper, we propose an approach that improves bagging through the employment of multiple classification algorithms in ensembles. Our approach preserves the parallel structure of bagging and improves the accuracy of bagging. As a result, it unlocks the power and expands the user base of bagging.

UR - http://www.scopus.com/inward/record.url?scp=84857737007&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84857737007&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-28320-8_40

DO - 10.1007/978-3-642-28320-8_40

M3 - Conference contribution

AN - SCOPUS:84857737007

SN - 9783642283192

VL - 7104 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 471

EP - 482

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -