Ensemble diversity measures and their application to thinning

Information Fusion

Volumn 6, Issue 1, 2005, Pages 49-62

  Banfield, Robert E ^a   Hall, Lawrence O ^a   Bowyer, Kevin W ^b   Kegelmeyer, W Philip ^c  

^a University of South Florida   (United States)

^b University of Notre Dame   (United States)

^c SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Decision trees; Diversity; Ensembles; Multiple classifier systems; Thinning

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; METRIC SYSTEM; NEURAL NETWORKS; PROBABILITY;

DECISION TREES; DIVERSITY; ENSEMBLES; MYULTIPLE CLASSIFIER SYSTEMS;

INFORMATION ANALYSIS;

EID: 10444241978     PISSN: 15662535     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.inffus.2004.04.005     Document Type: Article

References (23)

1. T. Dietterich, Ensemble methods in machine learning, presented at 1st International Workshop on Multiple Classifier Systems, Cagliari, Italy, 2000, pp. 1-15.
2. L. Breiman, Bagging predictors, Machine Learning 24 (1996) 123-140.
3. L. Breiman, Pasting small votes for classification in large databases and on-line, Machine Learning 36 (1999) 85-103.
4. T. Dietterich, An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization, Machine Learning 40 (2000) 139-158.
5. L. Breiman, Random forests, Machine Learning 45 (2001) 5-32.
6. Y. Freund, R.E. Schapire, Experiments with a new boosting algorithm, presented at 13th International Conference on Machine Learning, 1996, pp. 148-156.
7. L.I. Kuncheva, C.J. Whitaker, Measures of diversity in classifier ensembles, Machine Learning 51 (2003) 181-207.
8. R.E. Banfield, L.O. Hall, K.W. Bowyer, W.P. Kegelmeyer, A new ensemble diversity measure applied to thinning ensembles, presented at 4th International Workshop on Multiple Classifier Systems, 2003, pp. 306-316.
9. P. Domingos, A unified bias-variance decomposition and its applications, presented at 17th International Conference on Machine Learning, 2000, pp. 231-238.
10. G.U. Yule, On the association of attributes in statistics, presented at Philosophical Transactions of the Royal Society of London, 1900, pp. 257-319.
11. L.I. Kuncheva, C.J. Whitaker, C. Shipp, R. Duin, Is independence good for combining classifiers?, presented at 15th International Conference on Pattern Recognition, 2000, pp. 168-171.
12. L.I. Kuncheva, M. Skurichina, W.I. Duin, An experimental study on diversity for bagging and boosting with linear classifiers, Information Fusion 3 (2002) 245-258.
13. L. Hansen, P. Salamon, Neural network ensembles, IEEE Transactions on PAMI 12 (1990) 993-1001.
14. J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, San Francisco, CA, 1993.
15. T.K. Ho, Random decision forests, presented at 3rd International Conference on Document Analysis and Recognition, 1995, pp. 278-282.
16. T.K. Ho, The random subspace method for constructing decision forests, IEEE Transactions on PAMI 20 (1998) 832-844.
17. C.J. Merz, P.M. Murphey, UCI repository of machine learning databases, http://www.ics.uci.edu/~mlearn/MLRepository.html, 2003.
18. ELENA Project, http://www.dice.ucl.ac.be/neural-nets/Research/Projects/ELENA/elena.htm, 2003.
19. NIAAD, http://www.liacc.up.pt/ML, 2003.
20. A.J.C. Sharkey, N.E. Sharkey, U. Gerecke, G.O. Chandroth, The 'test and select' approach to ensemble combination, presented at 1st International Workshop on Multiple Classifier Systems, 2000, pp. 30-44.
21. G. Giacinto, F. Roli, An approach to automatic design of multiple classifier systems, Pattern Recognition Letters 22 (2001) 25-33.
22. P. Latinne, O. Debeir, C. Decaestecker, Limiting the number of trees in random forests, presented at 2nd International Workshop on Multiple Classifier Systems, 2001, pp. 178-187.
23. J.C. de Borda, Memoire sur les Elections au Scrutin, Historie de l'Academie Royale des Sciences, Paris, 1781.