Corpus ID: 6463323

Pruning Adaptive Boosting *** Icml-97 Final Draft ***

  title={Pruning Adaptive Boosting *** Icml-97 Final Draft ***},
  author={Thomas G. Dietterich},
The boosting algorithm AdaBoost de veloped by Freund and Schapire has ex hibited outstanding performance on sev eral benchmark problems when using C as the weak algorithm to be boosted Like other ensemble learning approaches AdaBoost constructs a composite hy pothesis by voting many individual hy potheses In practice the large amount of memory required to store these hypotheses can make ensemble methods hard to deploy in applications This paper shows that by selecting a subset of the hypotheses… Expand
Towards an optimally pruned classifier ensemble
Accu-Prune (AP) algorithm is presented, a majority voting ensemble that uses accuracy ordering and reduced error pruning approach to identify an optimal ensemble from a given pool of classifiers, to quantify the quality differential between two arbitrary ensembles. Expand
Structural diversity for decision tree ensemble learning
The TMD (tree matching diversity) measure for decision trees is proposed and empirically evaluated performances of selective ensemble approaches with decision forests by incorporating different diversity measures to validate that by considering structural and behavioral diversities together, stronger ensembles can be constructed. Expand
Diversity controlled rotating machinery fault detection
Research is presented on the application of classifier ensembles built with Bagging for the detection of rotating machinery faults and it was found that there is a relationship between classification accuracy and the diversity measures. Expand
Real-time equipment condition assessment for a class-imbalanced dataset based on heterogeneous ensemble learning
Prognostics and health management (PHM) is beneficial for daily operation and maintenance [21]. PHM covers condition assessment, fault diagnosis, remaining useful life (RUL) prediction, maintenanceExpand


Bagging, Boosting, and C4.5
Results of applying Breiman's bagging and Freund and Schapire's boosting to a system that learns decision trees and testing on a representative collection of datasets show boosting shows the greater benefit. Expand
Experiments with a New Boosting Algorithm
This paper describes experiments carried out to assess how well AdaBoost with and without pseudo-loss, performs on real learning problems and compared boosting to Breiman's "bagging" method when used to aggregate various classifiers. Expand
Bagging predictors
Tests on real and simulated data sets using classification and regression trees and subset selection in linear regression show that bagging can give substantial gains in accuracy. Expand
A decision-theoretic generalization of on-line learning and an application to boosting
The model studied can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting, and the multiplicative weightupdate Littlestone Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems. Expand
Bias, Variance , And Arcing Classifiers
This work explores two arcing algorithms, compares them to each other and to bagging, and tries to understand how arcing works, which is more sucessful than bagging in variance reduction. Expand
Converting English text to speech: a machine learning approach
A set of machine learning methods for automatically constructing letter-to-sound rules by analyzing a dictionary of words and their pronunciations are presented, showing that error-correcting output codes provide a domain-independent, algorithm-independent approach to multiclass learning problems. Expand
Projection Pursuit Regression
Abstract A new method for nonparametric multiple regression is presented. The procedure models the regression surface as a sum of general smooth functions of linear combinations of the predictorExpand
Discrete Multivariate Analysis: Theory and Practice
Discrete Multivariate Analysis is a comprehensive text and general reference on the analysis of discrete multivariate data, particularly in the form of multidimensional tables, and contains a wealth of material on important topics. Expand
Elements of Information Theory
The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment. Expand