See this document in CiteSeerX!

Using Boosting to Prune Bagging Ensembles  (Make Corrections)  
Gonzalo Martinez-Munoz And Alberto Suarez



  Home/Search   Context   Related

 
View or download:
eps.uam.es/~gonzalo/pu...MarSua05PRL.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  eps.uam.es/~gonzalo/publi...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Boosting is used to determine the order in which classifiers are aggregated in a bagging ensemble. Early stopping in the aggregation of the classifiers in the ordered bagging ensemble allows the identification of subensembles that require less memory for storage, have a faster classification speed and can perform better than the original bagging ensemble. Furthermore, ensemble pruning does not seem to deteriorate the robust performance of bagging in noisy classification tasks. (Update)

Active bibliography (related documents):   More   All
1.3:   Pruning in Ordered Bagging Ensembles - Suarez (2005)   (Correct)
0.6:   Aggregation Ordering in Bagging - Martínez-Muñoz, Suárez (2004)   (Correct)
0.4:   Switching Class Labels to Generate Classification Ensembles - Martínez-Muñoz, Suárez (2005)   (Correct)

Similar documents based on text:   More   All
0.2:   GramCheck: A Grammar and Style Checker - Bustamante, León (1996)   (Correct)
0.1:   Is Linguistic Information Enough for Grammar Checking? - Bustamante, León   (Correct)
0.1:   The q-analogue of the dual Hahn Polynomials: Its.. - Alvarez-Nodarse, Smirnov   (Correct)

BibTeX entry:   (Update)

@misc{ martinez-munoz-using,
  author = "Gonzalo Martinez-Munoz And Alberto Suarez",
  title = "Using Boosting to Prune Bagging Ensembles",
  url = "citeseer.ist.psu.edu/723920.html" }
Citations (may not include all citations):
1262   Classification and Regression Trees (context) - Breiman, Friedman et al. - 1984
696   UCI repository of machine learning databases (context) - Blake, Merz - 1996
509   A decision-theoretic generalization of on-line learning and .. - Freund, Schapire - 1995  ACM   DBLP
155   An empirical comparison of voting classification algorithms:.. - Bauer, Kohavi - 1999
134   An experimental comparison of three methods for constructing.. - Dietterich - 2000
89   and arcing classifiers (context) - Breiman - 1996
80   Arcing classifiers - Breiman - 2001
62   Pruning adaptive boosting - Margineantu, Dietterich - 1997  ACM   DBLP
30   Knowledge acquisition from examples via multiple models - Domingos - 1997
24   Multiboosting: A technique for combining boosting and waggin.. - Webb - 2000  DBLP
14   Ensembling neural networks: Many could be better than all - Zhou, Wu et al. - 2002  DBLP
9   the boosting pruning problem - Tamon, Xiang - 2000
9   Cost complexity-based pruning of ensemble classifiers - Prodromidis, Stolfo - 2001  ACM   DBLP
4   Clustering ensembles of neural network models (context) - Bakker, Heskes - 2003  ACM
3   Aggregation ordering in bagging (context) - Martnez-Munoz, Suarez - 2004
3   Using all data to generate decision tree ensembles (context) - Martnez-Munoz, Suarez - 2004
3   Selective ensemble of decision trees - Zhou, Tang - 2003  DBLP

Documents on the same site (http://www.eps.uam.es/~gonzalo/publications/index.html):   More
Aggregation Ordering in Bagging - Martínez-Muñoz, Suárez (2004)   (Correct)
Pruning in Ordered Bagging Ensembles - Suarez (2005)   (Correct)
Switching Class Labels to Generate Classification Ensembles - Martínez-Muñoz, Suárez (2005)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC