The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
Regularized Discriminant Analysis
Friedman, J. H. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478752 · Cited by 2,421
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
39 Dimensionality and sample size considerations in pattern recognition practice
Jain, A. K., & Chandrasekaran, B. (1982) · Handbook of Statistics · doi:10.1016/s0169-7161(82)02042-2 · Cited by 560
The Effects of Adding Noise During Backpropagation Training on a Generalization Performance
An, G. (1996) · Neural Computation · doi:10.1162/neco.1996.8.3.643 · Cited by 475 · cited 1×
“One way is to stabilise the decision of a weak classifier (as weak classifiers are often unstable) by regularisation [2] or noise injection [3].”
BackgroundSchwenk, H., & Bengio, Y. (2000) · Neural Computation · doi:10.1162/089976600300015178 · Cited by 297
Random Forests--Random Features
Breiman, L. (1999) · Cited by 204
Expected classification error of the Fisher linear classifier with pseudo-inverse covariance matrix
Raudys, S., & Duin, R. P. W. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(98)00016-6 · Cited by 187
Self-citationRaudys, S., & Pikelis, V. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4767011 · Cited by 167
Bagging for linear classifiers
Skurichina, M., & Duin, R. P. W. (1998) · Pattern Recognition · doi:10.1016/s0031-3203(97)00110-6 · Cited by 145
Self-citationBoosted Mixture of Experts: An Ensemble Learning Scheme
Avnimelech, R., & Intrator, N. (1999) · Neural Computation · doi:10.1162/089976699300016737 · Cited by 103
Boosting in Linear Discriminant Analysis
Skurichina, M., & Duin, R. (2000) · International Workshop on Multiple Classifier Systems · doi:10.1007/3-540-45014-9_18 · Cited by 32
Self-citationThe Role of Combining Rules in Bagging and Boosting
Skurichina, M., & Duin, R. (2000) · SSPR/SPR · doi:10.1007/3-540-44522-6_65 · Cited by 24
Self-citationCombining Fisher Linear Discriminants for Dissimilarity Representations
Pękalska, E., Skurichina, M., & Duin, R. P. W. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45014-9_11 · Cited by 8
Self-citation(1996)
Cited by
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Prasad, A. M., Iverson, L. R., & Liaw, A. (2006) · Ecosystems · doi:10.1007/s10021-005-0054-1 · Cited by 1,987
Investigation of the random forest framework for classification of hyperspectral data
Ham, J., Chen, Y., Crawford, M. M., & Ghosh, J. (2005) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2004.842481 · Cited by 1,276
A survey of multiple classifier systems as hybrid systems
Woźniak, M., Graña, M., & Corchado, E. (2014) · Information Fusion · doi:10.1016/j.inffus.2013.04.006 · Cited by 912
An empirical Bayes approach to inferring large-scale gene association networks
Schäfer, J., & Strimmer, K. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti062 · Cited by 795
Metadata
- Authors
- Skurichina, M., & Duin, R. P. W.
- Venue
- Pattern Analysis & Applications
- Published
- 2002-06-07
- Volume
- 5
- Issue
- 2
- Pages
- 121-135
- ISSN
- 1433-7541 (ISSN-L)
- 1433-755X
- OpenAlex
- W2157124852
- Cited by
- 521
- References
- 24
- FWCI
- 12.71
- 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.