Article

Pruning Adaptive Boosting

Authors:

Dragos D. Margineantu,

Thomas G. DietterichAuthors Info & Claims

ICML '97: Proceedings of the Fourteenth International Conference on Machine Learning

Pages 211 - 218

Published: 08 July 1997 Publication History

Abstract

No abstract available.

Cited By

View all

Yeh CFan YDai XSaini ULai VAboagye PWang JChen HZheng YZhuang ZWang LZhang WBaeza-Yates RBonchi F(2024)RPMixer: Shaking Up Time Series Forecasting with Random Projections for Large Spatial-Temporal DataProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671881(3919-3930)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671881
Rozemberczki BSarkar RDemartini GZuccon GCulpepper JHuang ZTong H(2021)The Shapley Value of Classifiers in Ensemble GamesProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482302(1558-1567)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482302
Vidal TSchiffer MDaumé HSingh A(2020)Born-again tree ensemblesProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3525841(9743-9753)Online publication date: 13-Jul-2020
https://dl.acm.org/doi/10.5555/3524938.3525841
Show More Cited By

Recommendations

Sparse training via boosting pruning plasticity with neuroregeneration
NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems

Works on lottery ticket hypothesis (LTH) and single-shot network pruning (SNIP) have raised a lot of attention currently on post-training pruning (iterative magnitude pruning), and before-training pruning (pruning at initialization). The former method ...
Boosting spatial pruning: on optimal pruning of MBRs
SIGMOD '10: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of objects' approximations, which are typically minimum bounding rectangles (MBRs). In this paper, we propose a novel effective and ...
Pruning adaptive boosting ensembles by means of a genetic algorithm
IDEAL'06: Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning

This work analyzes the problem of whether, given a classification ensemble built by Adaboost, it is possible to find a subensemble with lower generalization error. In order to solve this task a genetic algorithm is proposed and compared with other ...

Comments

Information & Contributors

Information

Published In

ICML '97: Proceedings of the Fourteenth International Conference on Machine Learning

July 1997

414 pages

ISBN:1558604863

Editor:
Douglas H. Fisher

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 08 July 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

107
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yeh CFan YDai XSaini ULai VAboagye PWang JChen HZheng YZhuang ZWang LZhang WBaeza-Yates RBonchi F(2024)RPMixer: Shaking Up Time Series Forecasting with Random Projections for Large Spatial-Temporal DataProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671881(3919-3930)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671881
Rozemberczki BSarkar RDemartini GZuccon GCulpepper JHuang ZTong H(2021)The Shapley Value of Classifiers in Ensemble GamesProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482302(1558-1567)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482302
Vidal TSchiffer MDaumé HSingh A(2020)Born-again tree ensemblesProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3525841(9743-9753)Online publication date: 13-Jul-2020
https://dl.acm.org/doi/10.5555/3524938.3525841
Lucchese CNardini FOrlando SPerego RSilvestri FTrani S(2018)X-CLEaVERACM Transactions on Intelligent Systems and Technology10.1145/32054539:6(1-26)Online publication date: 29-Oct-2018
https://dl.acm.org/doi/10.1145/3205453
Sun TZhou Z(2018)Structural diversity for decision tree ensemble learningFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-018-7151-812:3(560-570)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s11704-018-7151-8
Ding SChen ZZhao SLin T(2018)Pruning the Ensemble of ANN Based on Decision Tree InductionNeural Processing Letters10.1007/s11063-017-9703-648:1(53-70)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s11063-017-9703-6
Xia XLin TChen Z(2018)Maximum relevancy maximum complementary based ordered aggregation for ensemble pruningApplied Intelligence10.1007/s10489-017-1106-x48:9(2568-2579)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1007/s10489-017-1106-x
Li MDai Q(2018)A novel knowledge-leverage-based transfer learning algorithmApplied Intelligence10.1007/s10489-017-1084-z48:8(2355-2372)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s10489-017-1084-z
Zhu XNi ZCheng MJin FLi JWeckman G(2018)Selective ensemble based on extreme learning machine and improved discrete artificial fish swarm algorithm for haze forecastApplied Intelligence10.1007/s10489-017-1027-848:7(1757-1775)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s10489-017-1027-8
Gomes HBarddal JEnembreck FBifet A(2017)A Survey on Ensemble Learning for Data Stream ClassificationACM Computing Surveys10.1145/305492550:2(1-36)Online publication date: 27-Mar-2017
https://dl.acm.org/doi/10.1145/3054925
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Sparse training via boosting pruning plasticity with neuroregeneration

Boosting spatial pruning: on optimal pruning of MBRs

Pruning adaptive boosting ensembles by means of a genetic algorithm

Comments

Published In

Publisher

Publication History

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

Cited By

Index Terms

Recommendations

Sparse training via boosting pruning plasticity with neuroregeneration

Boosting spatial pruning: on optimal pruning of MBRs

Pruning adaptive boosting ensembles by means of a genetic algorithm

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations