The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
AdaBoost.RT: a boosting algorithm for regression problems
Abstract
A boosting algorithm, AdaBoost.RT, is proposed for regression problems. The idea is to filter out examples with a relative estimation error that is higher than the pre-set threshold value, and then follow the AdaBoost procedure. Thus it requires to select the sub-optimal value of relative error threshold to demarcate predictions from the predictor as correct or incorrect. Some experimental results using the M5 model tree as a weak learning machine for benchmark data sets and for hydrological modeling are reported, and compared to other boosting methods, bagging and artificial neural networks, and to a single M5 model tree. AdaBoost.Rt is proved to perform better on most of the considered data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Witten, I. H. (2008) · Cited by 9,143
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Popular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00117832 · Cited by 1,912
Quinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,262
Prediction Games and Arcing Algorithms
Breiman, L. (1999) · Neural Computation · doi:10.1162/089976699300016106 · Cited by 530
Cited by
Ekanayake, I. U., Meddage, D. P. P., & Rathnayake, U. (2022) · Case Studies in Construction Materials · doi:10.1016/j.cscm.2022.e01059 · Cited by 498
Machine learning approaches for estimation of prediction interval for the model output
Shrestha, D. L., & Solomatine, D. P. (2006) · Neural Networks · doi:10.1016/j.neunet.2006.01.012 · Cited by 428
Self-citationMachine Recognition of Music Emotion: A Review
Yang, Y.-H., & Chen, H. H. (2012) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2168752.2168754 · Cited by 378
Blind image quality assessment by relative gradient statistics and adaboosting neural network
Liu, L., Hua, Y., Zhao, Q., Huang, H., & Bovik, A. C. (2016) · Signal Processing: Image Communication · doi:10.1016/j.image.2015.10.005 · Cited by 282
Feng, D.-C., Liu, Z.-T., Wang, X.-D., Jiang, Z.-M., & Liang, S.-X. (2020) · Advanced Engineering Informatics · doi:10.1016/j.aei.2020.101126 · Cited by 269
Metadata
- Authors
- Solomatine, D. P., & Shrestha, D. L.
- Venue
- 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)
- Publisher
- IEEE
- Published
- 2005-04-05
- Volume
- 2
- Pages
- 1163-1168
- OpenAlex
- W2133176659
- Cited by
- 306
- References
- 19
- FWCI
- 3.82
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: AdaBoost.RT: a boosting algorithm for regression problems. https://app.cochat.ai/papers/10.1109/ijcnn.2004.1380102
- The paper
- Solomatine, D. P., & Shrestha, D. L. (2005). AdaBoost.RT: a boosting algorithm for regression problems. 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541). https://doi.org/10.1109/ijcnn.2004.1380102
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.