The DOI matches its Crossref record; 34 of the 35 references it cites were found in a registry or an index.
Measures of Diversity in Classifier Ensembles and Their Relationship with the Ensemble Accuracy
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“As we found out that the codebook and deep-learning-based approaches produce different features which yield significantly different results, we expect their fusion to take advantage of this “diversity” and lead to performance improvements [42].”
From Comparison of Feature Learning Methods for Human Activity Recognition Using Wearable Sensors (2018) · cites this paper as [42]
Experimental — accuracy not yet measured
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
Statistical Methods for Rates and Proportions
Fleiss, J. L., Levin, B., & Paik, M. C. (2003) · Wiley Series in Probability and Statistics · doi:10.1002/0471445428 · Cited by 18,646
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325 · cited 2×
“We applied both the bagging (Breiman, 1996) and the random weakclassiiers methods (Ji and Ma, 1997).”
MethodEnsemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
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 · cited 3×
“Name " = # P S Reference Q-statistic Q (#) Y Y (Yule, 1900) Correlation coe cient (#) Y Y (Sneath and Sokal, 1973) Disagreement measure D (") Y Y (Ho, 1998; Skalak, 1996) Double-fault measure DF (#) Y N (Giacinto and Roli, 2000) Kohavi-Wolpert variance kw (") N Y (Kohavi and Wolpert, 1996) Interrater agreement (#) N Y…”
BackgroundMethodHansen, L. K., & Salamon, P. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.58871 · Cited by 4,260
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 · cited 1×
“When classiiers output class labels, the classiication error can be decomposed into bias and variance terms (also called`spread') (Bauer and Kohavi, 1999; Breiman, 1999; Kohavi and Wolpert, 1996) or into bias and spread terms.”
BackgroundNeural Network Ensembles, Cross Validation, and Active Learning
Krogh, A., & Vedelsby, J. (1994) · Cited by 1,838
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 · cited 3×
“%) between the diversity measures for the breast cancer data experiment Since the classiiers had continuous valued outputs, we applied other combination methods besides the majority vote (MAJ) (Kuncheva et al., 2001).”
MethodInfluentialSelf-citationEnsemble learning via negative correlation
Liu, Y., & Yao, X. (1999) · Neural Networks · doi:10.1016/s0893-6080(99)00073-8 · Cited by 712 · cited 2×
“A negative correlation between the continuousvalued outputs has been sought, predominantly by altering the available training set or parameters of the classi er (Dietterich, 2000a; Hashem, 1999; Krogh and Vedelsby, 1995; Liu and Yao, 1999; Opitz and Shavlik, 1999; Parmanto et al., 1996; Giacinto and Roli, 2000; Rosen,…”
BackgroundBias plus variance decomposition for zero-one loss functions
Kohavi, R., & Wolpert, D. H. (1996) · Cited by 652
Error Correlation and Error Reduction in Ensemble Classifiers
TUMER, K., & GHOSH, J. (1996) · Connection Science · doi:10.1080/095400996116839 · Cited by 597 · cited 4×
“Tumer and Ghosh (Tumer and Ghosh, 1996b; Tumer and Ghosh, 1999) do not mention the case of negative correlation although it clearly supports their thesis that the smaller the correlation, the better the ensemble.”
BackgroundInfluentialStatistical Analysis: A Computer Oriented Approach.
Andrews, D. F., Afifi, A. A., & Azen, S. P. (1974) · Journal of the American Statistical Association · doi:10.2307/2285554 · Cited by 574
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 · cited 3×
“These were Naive Bayes (NB), the Behavior Knowledge Space method (BKS) (Huang and Suen, 1995); maximum (MAX), minimum5, average (AVR) and product (PRO) from the simple methods; and the decision templates (DT) method (Kuncheva et al.”
MethodInfluentialKuncheva, L. I. (2000) · Studies in fuzziness and soft computing · doi:10.1007/978-3-7908-1850-5 · Cited by 511 · cited 3×
“txt (see for more experimental results with the same data (Kuncheva, 2000)).”
BackgroundMethodSelf-citationDesign of effective neural network ensembles for image classification purposes
Giacinto, G., & Roli, F. (2001) · Image and Vision Computing · doi:10.1016/s0262-8856(01)00045-2 · Cited by 409
Boosting and Other Ensemble Methods
Drucker, H., Cortes, C., Jackel, L. D., LeCun, Y., & Vapnik, V. (1994) · Neural Computation · doi:10.1162/neco.1994.6.6.1289 · Cited by 357 · cited 2×
“Bagging and boosting methods for team members generation, and variants thereof such as arcing and wagging, have been shown to be very successful (Bauer & Kohavi, 1999; Drucker et al., 1994; Schapire, 1999).”
BackgroundLimits on the majority vote accuracy in classifier fusion
Kuncheva, L. I., Whitaker, C. J., Shipp, C. A., & Duin, R. P. W. (2003) · Pattern Analysis & Applications · doi:10.1007/s10044-002-0173-7 · Cited by 356 · cited 4×
“The relationship between Q av and the limits of P maj has been formally derived (Kuncheva et al., 2000), and for these limit cases, Q av can take values ?”
BackgroundMethodInfluentialSelf-citationAnalysis 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 · cited 1×
“Tumer and Ghosh (1996a, 1996b, 1999) derive an expression about the added classification error (i.e., the error above the Bayes error) of the team under a set of assumptions”
BackgroundConceptual modeling of coincident failures in multiversion software
Littlewood, B., & Miller, D. R. (1989) · IEEE Transactions on Software Engineering · doi:10.1109/32.58771 · Cited by 251 · cited 1×
“Diversity has been recognized as a very important characteristic in classiier combination (Cunningham and Carney, 2000; Krogh and Vedelsby, 1995; Rosen, 1996; Lam, 2000; Littlewood and Miller, 1989).”
BackgroundEnsemble Learning Using Decorrelated Neural Networks
ROSEN, B. E. (1996) · Connection Science · doi:10.1080/095400996116820 · Cited by 248 · cited 4×
“2 Diversity has been recognized as a very important characteristic in classi er combination (Cunningham and Carney, 2000; Krogh and Vedelsby, 1995; Rosen, 1996; Lam, 2000; Littlewood and Miller, 1989).”
BackgroundInfluentialDiversity versus Quality in Classification Ensembles Based on Feature Selection
Cunningham, P., & Carney, J. G. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45164-1_12 · Cited by 219 · cited 1×
“Diversity has been recognized as a very important characteristic in classiier combination (Cunningham and Carney, 2000; Krogh and Vedelsby, 1995; Rosen, 1996; Lam, 2000; Littlewood and Miller, 1989).”
BackgroundCombinations of weak classifiers
Ji, C., & Ma, S. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.554189 · Cited by 160
SHARKEY, A. J. C., & SHARKEY, N. E. (1997) · The Knowledge Engineering Review · doi:10.1017/s0269888997003123 · Cited by 159 · cited 2×
“…by altering the available training set or parameters of the classiier (Dietterich, 2000a; Hashem, 1999; Krogh and Vedelsby, 1995; Liu and Yao, 1999; Opitz and Shavlik, 1999; Parmanto et al., 1996; Giacinto and Roli, 2000; Rosen, 1996; Sharkey and Sharkey, 1997; Skalak, 1996; Tumer and Ghosh, 1999).”
BackgroundClassifier Combinations: Implementations and Theoretical Issues
Lam, L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45014-9_7 · Cited by 157 · cited 2×
“Diversity has been recognized as a very important characteristic in classifier combination (Cunningham & Carney, 2000; Krogh & Vedelsby, 1995; Rosen, 1996; Lam, 2000; Littlewood & Miller, 1989).”
BackgroundSoftware diversity: practical statistics for its measurement and exploitation
Partridge, D., & Krzanowski, W. J. (1997) · Information and Software Technology · doi:10.1016/s0950-5849(97)00023-2 · Cited by 153
Linear and Order Statistics Combiners for Pattern ClassificationPreprint
Tumer, K., & Ghosh, J. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9905012 · Cited by 144 · cited 7×
“A negative correlation between the continuousvalued outputs has been sought, predominantly by altering the available training set or parameters of the classi er (Dietterich, 2000a; Hashem, 1999; Krogh and Vedelsby, 1995; Liu and Yao, 1999; Opitz and Shavlik, 1999; Parmanto et al., 1996; Giacinto and Roli, 2000; Rosen,…”
BackgroundInfluentialSchapire, R. E. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49097-3_1 · Cited by 122 · cited 2×
“…of experts, classiier ensembles, multiple classiier systems, consensus theory , etc. Bagging and boosting methods for team members generation, and variants thereof such as arcing and wagging, have been shown to be very successful (Bauer and Kohavi, 1999; Drucker et al., 1994; Schapire, 1999).”
BackgroundReducing Variance of Committee Prediction with Resampling Techniques
Parmanto, B., Munro, P., & Doyle, H. R. (1996) · Connection Science · doi:10.1080/095400996116848 · Cited by 78 · cited 1×
“…by altering the available training set or parameters of the classiier (Dietterich, 2000a; Hashem, 1999; Krogh and Vedelsby, 1995; Liu and Yao, 1999; Opitz and Shavlik, 1999; Parmanto et al., 1996; Giacinto and Roli, 2000; Rosen, 1996; Sharkey and Sharkey, 1997; Skalak, 1996; Tumer and Ghosh, 1999).”
BackgroundRuta, D., & Gabryś, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48219-9_40 · Cited by 48
A statistical technique for comparing the accuracies of several classifiers
Looney, S. W. (1988) · Pattern Recognition Letters · doi:10.1016/0167-8655(88)90016-5 · Cited by 36 · cited 1×
“It has links to the intraclass correlation coeecient and the signiicance test of Looney (Looney, 1988).”
MethodTreating Harmful Collinearity in Neural Network Ensembles
SHARKEY, A. J. C. (1999) · Perspectives in neural computing · doi:10.1007/978-1-4471-0793-4_5 · Cited by 23 · cited 2×
“…continuousvalued outputs has been sought, predominantly by altering the available training set or parameters of the classiier (Dietterich, 2000a; Hashem, 1999; Krogh and Vedelsby, 1995; Liu and Yao, 1999; Opitz and Shavlik, 1999; Parmanto et al., 1996; Giacinto and Roli, 2000; Rosen, 1996;…”
BackgroundMethodA Genetic Algorithm Approach for Creating Neural-Network Ensembles
Opitz, D. W., & SHAVLIK, J. W. (1999) · Cited by 13
Research works printed but not linked: 3
- Breiman, L. (1999). Combining predictors. In A. Sharkey (Ed.), Combining artificial neural nets (pp. 31–50). London: Springer-Verlag.
- Skalak, D. (1996). The sources of increased accuracy for two proposed boosting algorithms. In Proc. American Association for Artificial Intelligence, AAAI-96, Integrating Multiple Learned Models Workshop.
- Yule, G. (1900). On the association of attributes in statistics. Phil. Trans., A, 194, 257–319.
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
Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., & Herrera, F. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2161285 · Cited by 2,794
“Note also that, the measurement of the diversity and its relation to accuracy is not demonstrated [43], [92], but this is probably due”
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
“Diversity is a crucial condition for obtaining accurate ensembles (Tumer and Ghosh 1996; Krogh and Vedelsby 1995; Kuncheva 2005; Kuncheva and Whitaker 2003).”
BackgroundHistopathological Image Analysis: A Review
Gurcan, M. N., Boucheron, L. E., Can, A., Madabhushi, A., Rajpoot, N. M., & Yener, B. (2009) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2009.2034865 · Cited by 2,052
“and thereby reducing either the bias or variance of the individual classifiers [107].”
BackgroundRotation Forest: A New Classifier Ensemble Method
Rodriguez, J. J., Kuncheva, L. I., & Alonso, C. J. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.211 · Cited by 1,893
Self-citation
Metadata
- Authors
- Kuncheva, L. I., & Whitaker, C. J.
- Affiliations
- Bangor University (GB)
- ORCID
- Kuncheva, Ludmila I.
- Venue
- Machine Learning
- Published
- 2003-05
- Volume
- 51
- Issue
- 2
- Pages
- 181-207
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2115629999
- Cited by
- 2,335
- References
- 35
- Citations by year
- 2026: 96 · 2025: 81 · 2024: 73 · 2023: 88 · 2022: 102 · 2021: 147 · 2020: 127 · 2019: 117 · 2018: 132 · 2017: 116 · 2016: 124 · 2015: 135 · 2014: 143 · 2013: 116 · 2012: 132
- FWCI
- 55.38
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Machine Learning (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Imbalanced Data Classification Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Keywords
- ensemble classifiers, diversity measures, ensemble accuracy, classifier combination, item difficulty index, interobserver agreement, q-statistics, correlation, disagreement, double faults
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.