The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
RotBoost: A technique for combining Rotation Forest and AdaBoost
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
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
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 1×
“…approaches, AdaBoost (Freund and Schapire, 1996, 1997) has become a very popular one for its simplicity and adaptability and up to now there have been many variants of it (Optiz and Maclin, 1999; Dietterich, 2000; Friedman et al., 2000; Webb, 2000; Meir and Rätsch, 2003; Jin and Zhang, 2007).”
BackgroundHansen, L. K., & Salamon, P. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.58871 · Cited by 4,260
Neural Networks and the Bias/Variance Dilemma
Geman, S., Bienenstock, E., & Doursat, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.1.1 · Cited by 3,578 · cited 2×
“The decomposition of a learning machine’s error into bias and variance terms originates from analyzing learning models with numeric outputs in regression problems (Geman et al., 1992).”
MethodPopular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953 · cited 2×
“In order to investigate the reasons for the better performance of an ensemble classifier than its constituent members, many researchers (for example, see Breiman, 1998; Bauer and Kohavi, 1999; Optiz and Maclin, 1999; Webb, 2000; Zhou et al., 2002; James, 2003; Rodríguez et al., 2005) have studied this problem by decom…”
BackgroundEnsembling neural networks: Many could be better than all
Zhou, Z.-H., Wu, J., & Tang, W. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00190-x · Cited by 1,964 · cited 4×
“Among the estimation techniques, some researchers (Bauer and Kohavi, 1999; Zhou et al., 2002) used a two-stage process to evaluate the values of Bias(2)KWðxÞ and VarKWðxÞ.”
BackgroundMethodInfluential
Cited by
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Ensemble deep learning: A review
Ganaie, M. A., Hu, M., Malik, A. K., Tanveer, M., & Suganthan, P. N. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105151 · Cited by 2,143
Ren, Y., Zhang, L., & Suganthan, P. N. (2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2015.2471235 · Cited by 675
Decision forest: Twenty years of research
Rokach, L. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.06.005 · Cited by 472
Multiple Classifier System for Remote Sensing Image Classification: A Review
Du, P., Xia, J., Zhang, W., Tan, K., Liu, Y., & Liu, S. (2012) · Sensors · doi:10.3390/s120404764 · Cited by 299
Metadata
- Authors
- Zhang, C.-X., & Zhang, J.-S.
- Venue
- Pattern Recognition Letters
- Publisher
- Elsevier BV
- Published
- 2008-07
- Volume
- 29
- Issue
- 10
- Pages
- 1524-1536
- ISSN
- 0167-8655 (ISSN-L)
- OpenAlex
- W2167114860
- Cited by
- 165
- References
- 7
- FWCI
- 12.19
- Type
- journal article
- 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
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.