The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Using Correspondence Analysis to Combine Classifiers
Open accessOverview
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
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
Wolpert, D. H. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80023-1 · Cited by 7,951 · cited 4×
“The approach taken, called SCANN (Section 3), uses the strategies of stacking [37] and correspondence analysis [14] to model the relationship between the learning examples and the way in which they are classi ed by a collection of learned models.”
MethodInfluentialThe Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Learning internal representations by error propagation
RUMELHART, D. E., HINTON, G. E., & WILLIAMS, R. J. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50035-2 · Cited by 3,002
Boosting a Weak Learning Algorithm by Majority
Freund, Y. (1995) · Information and Computation · doi:10.1006/inco.1995.1136 · Cited by 1,674
Cited by
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Is Combining Classifiers with Stacking Better than Selecting the Best One?
Džeroski, S., & Ženko, B. (2004) · Machine Learning · doi:10.1023/b:mach.0000015881.36452.6e · Cited by 889
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
Fontugne, R., Borgnat, P., Abry, P., & Fukuda, K. (2010) · Proceedings of the 6th International COnference · doi:10.1145/1921168.1921179 · Cited by 295
Rokach, L. (2009) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2009.07.017 · Cited by 253
Metadata
- Authors
- Merz, C. J.
- Venue
- Machine Learning
- Published
- 1999-07
- Volume
- 36
- Issue
- 1-2
- Pages
- 33-58
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1655845646
- Cited by
- 208
- References
- 5
- FWCI
- 10.58
- Type
- journal article
- Language
- en
- Open access
- bronze
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.