scientific article; zbMATH DE number 1950578

MaRDI QIDQ4413264zbMATH OpenFDO

Authors Ron Meir, Gunnar Rätsch

Publication date 17 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2600/26000118.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Boosting. Foundations and algorithms.
• The boosting approach to machine learning: an overview
• scientific article; zbMATH DE number 1304648
• Boosting methods for regression
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)

Cited in

(26)

• A stochastic approximation view of boosting
• Boosting-based sequential output prediction
• Boosting as a kernel-based method
• Quantum adiabatic machine learning
• Early stopping in \(L_{2}\)Boosting
• An empirical study of using Rotation Forest to improve regressors
• Analysis of boosting algorithms using the smooth margin function
• An efficient modified boosting method for solving classification problems
• Prototype Classification: Insights from Machine Learning
• scientific article; zbMATH DE number 2013295 (Why is no real title available?)
• Boosting algorithms: regularization, prediction and model fitting
• Fully corrective boosting with arbitrary loss and regularization
• Explaining AdaBoost
• The boosting approach to machine learning: an overview
• Dual space preconditioning for gradient descent
• Optimization by Gradient Boosting
• Effect of pruning and early stopping on performance of a boosting ensemble.
• Boosting methods for regression
• Explainable subgradient tree boosting for prescriptive analytics in operations management
• A boosting approach for supervised Mahalanobis distance metric learning
• Learning ensembles of interpretable simple structure
• Ensemble learning algorithms based on easyensemble sampling for financial distress prediction
• Machine learning approaches for discrimination of extracellular matrix proteins using hybrid feature space
• Tutorial series on brain-inspired computing. VI: Geometrical structure of boosting algorithm
• The value of agreement a new boosting algorithm
• Using boosting to prune double-bagging ensembles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413264)