A local boosting algorithm for solving classification problems
From MaRDI portal
Publication:1023522
DOI10.1016/j.csda.2007.06.015zbMath1452.62478OpenAlexW2016717446MaRDI QIDQ1023522
Jiang-She Zhang, Chun-Xia Zhang
Publication date: 12 June 2009
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2007.06.015
Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (9)
A multilayered neuro-fuzzy classifier with self-organizing properties ⋮ Noise peeling methods to improve boosting algorithms ⋮ An empirical bias–variance analysis of DECORATE ensemble method at different training sample sizes ⋮ RandGA: injecting randomness into parallel genetic algorithm for variable selection ⋮ Using boosting to prune double-bagging ensembles ⋮ Taxonomy for characterizing ensemble methods in classification tasks: a review and annotated bibliography ⋮ Benchmarking local classification methods ⋮ A weight-adjusted voting algorithm for ensembles of classifiers ⋮ IRUSRT: A Novel Imbalanced Learning Technique by Combining Inverse Random Under Sampling and Random Tree
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Bagging predictors
- A decision-theoretic generalization of on-line learning and an application to boosting
- Arcing classifiers. (With discussion)
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Combining Different Methods and Numbers of Weak Decision Trees
- Improved boosting algorithms using confidence-rated predictions
- Soft margins for AdaBoost
- Random forests
- Stochastic gradient boosting.
This page was built for publication: A local boosting algorithm for solving classification problems
