The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
The combining classifier: to train or not to train?
Abstract
When more than a single classifier has been trained for the same recognition problem the question arises how this set of classifiers may be combined into a final decision rule. Several fixed combining rules are used that depend on the output values of the base classifiers only. They are almost always suboptimal. Usually, however, training sets are available. They may be used to calibrate the base classifier outputs, as well as to build a trained combining classifier using these outputs as inputs. It depends on various circumstances whether this is useful, in particular whether the training set is used for the base classifiers as well and whether they are overtrained. We present an intuitive discussion on the use of trained combiners, relating the question of the choice of the combining classifier to a similar choice in the area of dissimilarity based pattern recognition. Some simple examples are used to illustrate the discussion.
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
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
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
Statistical pattern recognition: a review
Jain, A. K., Duin, P. W., & Mao, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824819 · Cited by 6,767
Kittler, J., Hatef, M., Duin, R. P. W., & Matas, J. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.667881 · Cited by 5,290
Self-citationDecision combination in multiple classifier systems
Ho, T. K., Hull, J. J., & Srihari, S. N. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.273716 · Cited by 1,511
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100318 · Cited by 1,037
Decision templates for multiple classifier fusion: an experimental comparison
Kuncheva, L. I., Bezdek, J. C., & Duin, R. P. W. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(99)00223-x · Cited by 1,003
Self-citationCombination of multiple classifiers using local accuracy estimates
Woods, K., Kegelmeyer, W. P., & Bowyer, K. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.588027 · Cited by 952
Fuzzy models for pattern recognition
Bezdek, J. C., & Pal, S. K. (1994) · Cited by 832
A theoretical study on six classifier fusion strategies
Kuncheva, L. I. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.982906 · Cited by 720
A method of combining multiple experts for the recognition of unconstrained handwritten numerals
Huang, Y. S., & Suen, C. Y. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.368145 · Cited by 564
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
Skurichina, M., & Duin, R. P. W. (2002) · Pattern Analysis & Applications · doi:10.1007/s100440200011 · Cited by 521
Self-citationKuncheva, L. I. (2000) · Studies in fuzziness and soft computing · doi:10.1007/978-3-7908-1850-5 · Cited by 511
Combining multiple classifiers by averaging or by multiplying?
Tax, D. M. J., van Breukelen, M., Duin, R. P. W., & Kittler, J. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00138-7 · Cited by 377
Self-citationSwitching between selection and fusion in combining classifiers: an experiment
Kuncheva, L. I. (2002) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.990871 · Cited by 348
(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9 · Cited by 236
Experiments with Classifier Combining Rules
Duin, R. P. W., & Tax, D. M. J. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_2 · Cited by 235
Self-citationDissimilarity representations allow for building good classifiers
Pękalska, E., & Duin, R. P. W. (2002) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00024-7 · Cited by 219
Self-citationAn approach to the automatic design of multiple classifier systems
Giacinto, G., & Roli, F. (2001) · Pattern Recognition Letters · doi:10.1016/s0167-8655(00)00096-9 · Cited by 197
(2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-48219-9 · Cited by 197
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-citationCombination of multiple classifiers using local accuracy estimates
Woods, K. S., Bowyer, K. W., & Kegelmeyer, W. P. (1996) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1996.517102 · Cited by 134
Chen, K., Wang, L., & Chi, H. (1997) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001497000196 · Cited by 121
The “Test and Select” Approach to Ensemble Combination
SHARKEY, A. J. C., SHARKEY, N. E., Gerecke, U., & Chandroth, G. O. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45014-9_3 · Cited by 105
Classifier conditional posterior probabilities
Duin, R. P. W., & Tax, D. M. J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0033285 · Cited by 72
Self-citationDiversity between Neural Networks and Decision Trees for Building Multiple Classifier Systems
Wang, W., Jones, P., & Partridge, D. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45014-9_23 · Cited by 48
Cited by
A Survey of Ensemble Learning: Concepts, Algorithms, Applications, and Prospects
Mienye, I. D., & Sun, Y. (2022) · IEEE Access · doi:10.1109/access.2022.3207287 · Cited by 1,298
Multi-column deep neural network for traffic sign classification
Cireşan, D., Meier, U., Masci, J., & Schmidhuber, J. (2012) · Neural Networks · doi:10.1016/j.neunet.2012.02.023 · Cited by 1,057
Optimization and applications of echo state networks with leaky- integrator neurons
Jaeger, H., Lukoševičius, M., Popovici, D., & Siewert, U. (2007) · Neural Networks · doi:10.1016/j.neunet.2007.04.016 · Cited by 948
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
Dynamic classifier selection: Recent advances and perspectives
Cruz, R. M. O., Sabourin, R., & Cavalcanti, G. D. C. (2018) · Information Fusion · doi:10.1016/j.inffus.2017.09.010 · Cited by 440
Metadata
- Authors
- Duin, R. P. W.
- Venue
- Object recognition supported by user interaction for service robots
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-25
- Volume
- 2
- Pages
- 765-770
- OpenAlex
- W2158869137
- Cited by
- 332
- References
- 27
- FWCI
- 14.97
- 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
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.