The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
A theoretical and experimental analysis of linear combiners for multiple classifier systems
Abstract
In this paper, a theoretical and experimental analysis of linear combiners for multiple classifier systems is presented. Although linear combiners are the most frequently used combining rules, many important issues related to their operation for pattern classification tasks lack a theoretical basis. After a critical review of the framework developed in works by Tumer and Ghosh on which our analysis is based, we focus on the simplest and most widely used implementation of linear combiners, which consists of assigning a nonnegative weight to each individual classifier. Moreover, we consider the ideal performance of this combining rule, i.e., that achievable when the optimal values of the weights are used. We do not consider the problem of weights estimation, which has been addressed in the literature. Our theoretical analysis shows how the performance of linear combiners, in terms of misclassification probability, depends on the performance of individual classifiers, and on the correlation between their outputs. In particular, we evaluate the ideal performance improvement that can be achieved using the weighted average over the simple average combining rule and investigate in what way it depends on the individual classifiers. Experimental results on real data sets show that the behavior of linear combiners agrees with the predictions of our analytical model. Finally, we discuss the contribution to the state of the art and the practical relevance of our theoretical and experimental analysis of linear combiners for multiple classifier systems.
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
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
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
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
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
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
Chiang, L. H., Russell, E. L., & Braatz, R. D. (2001) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0347-9_3 · Cited by 5,003
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 1×
“From a practical standpoint, these results suggest using the following approach to the problem of bias-variance tradeoff [10]: The design of individual classifiers should focus on obtaining estimation errors with low bias and correlation, rather than low variance, since the variance can be reduced by averaging classif…”
BackgroundCombining Pattern Classifiers: Methods and Algorithms
Bagui, S. C. (2005) · Technometrics · doi:10.1198/tech.2005.s320 · Cited by 3,202
Combining Pattern Classifiers: Methods and Algorithms
Kuncheva, L. I. (2004) · Wiley eBooks · doi:10.1002/0471660264 · Cited by 3,005
Pattern Classification (2nd ed.)
Duda, R. O., Hart, P. E., & Stork, D. G. (1999) · Cited by 2,520
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00117832 · Cited by 1,912
Decision 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
When networks disagree: Ensemble methods for hybrid neural networks
PERRONE, M. P., & COOPER, L. N. (1995) · World Scientific Series in 20th Century Physics · doi:10.1142/9789812795885_0025 · Cited by 755
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
Optimal Linear Combinations of Neural Networks
Hashem, S. (1997) · Neural Networks · doi:10.1016/s0893-6080(96)00098-6 · Cited by 499
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
Analysis of decision boundaries in linearly combined neural classifiers
Tumer, K., & Ghosh, J. (1996) · Pattern Recognition · doi:10.1016/0031-3203(95)00085-2 · Cited by 335
Combining Estimates in Regression and Classification
Leblanc, M., & Tibshirani, R. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476733 · Cited by 290
(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9 · Cited by 236
Sum versus vote fusion in multiple classifier systems
Kittler, J., & Alkoot, F. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1159950 · Cited by 232
Optimal linear combination of neural networks for improving classification performance
Ueda, N. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.825759 · Cited by 205
Improving model accuracy using optimal linear combinations of trained neural networks
Hashem, S., & Schmeiser, B. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.377990 · Cited by 177
Parallel consensual neural networks
Benediktsson, J. A., Sveinsson, J. R., Ersoy, O. K., & Swain, P. H. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.554191 · Cited by 163
Linear and Order Statistics Combiners for Pattern ClassificationPreprint
Tumer, K., & Ghosh, J. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9905012 · Cited by 141
Linear and Order Statistics Combiners for Pattern Classification
SHARKEY, A. J. C. (1999) · Perspectives in neural computing · doi:10.1007/978-1-4471-0793-4_6 · Cited by 56
MARCIALIS, G. L., & Roli, F. (2004) · Lecture notes in computer science · doi:10.1007/b98227 · Cited by 39
Self-citationCombining independent and unbiased classifiers using weighted average
Alexandre, L. A., Campilho, A., & Kamel, M. S. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2000.906120 · Cited by 38
Cited by
Ensemble based systems in decision making
Polikar, R. (2006) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2006.1688199 · Cited by 2,938
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100318 · Cited by 1,037
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
Learning similarity with cosine similarity ensemble
Xia, P., Zhang, L., & Li, F. (2015) · Information Sciences · doi:10.1016/j.ins.2015.02.024 · Cited by 552
Fault diagnosis of rotating machinery based on multiple ANFIS combination with gas
Lei, Y., He, Z., Zi, Y., & Hu, Q. (2007) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2006.11.003 · Cited by 500
Metadata
- Authors
- Fumera, G., & Roli, F.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2005-06
- Volume
- 27
- Issue
- 6
- Pages
- 942-956
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2168847089
- Cited by
- 307
- References
- 30
- FWCI
- 24.39
- 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.