Selected tree classifier combination based on both accuracy and error diversity

Pattern Recognition

Volumn 38, Issue 2, 2005, Pages 191-197

  Shin, H W ^a   Sohn, S Y ^b  

^a Samsung Advanced Institute of Technology (SAIT)   (South Korea)

^b Yonsei University   (South Korea)

Author keywords

Accuracy; Diversity; Dynamic classifier selection; Ensemble; Tree classifier

Indexed keywords

ALGORITHMS; COSTS; DECISION THEORY; ERROR ANALYSIS; SET THEORY;

CLASSIFIER ENSEMBLE; DYNAMIC CLASSIFIER SELECTION; TREE CLASSIFIERS;

PATTERN RECOGNITION;

EID: 6444238786     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(04)00272-9     Document Type: Article

References (21)

1. L. Breiman, Bagging predictors, Mach. Learning 24 (2) (1996) 123-140.
2. Y. Freund, R.E. Schapire, Experiment with a new boosting algorithm, in: Proceedings 13th Conference on Machine Learning, 1996, pp. 148-156.
3. T.K. Ho, J.J. Hull, S.N. Srihari, Decision combination in multiple classifiers system, IEEE Trans. Pattern Anal. Mach. Intell. 16 (1) (1994) 66-75.
4. K. Woods, W.P. Kegelmeyer, K. Bowyer, Combination of multiple classifiers using local accuracy estimates, IEEE Trans. Pattern Anal. Mach. Intell. 19 (4) (1997) 405-410.
5. G. Giacinto, F. Roli, Dynamic classifier selection based on multiple classifier behaviour, Pattern Recognition 34 (2001) 1879-1881.
6. G. Giacinto, F. Roli, An approach to the automatic design of multiple classifier systems, Pattern Recogn. Lett. 22 (2001) 25-33.
7. L.I. Kuncheva, C.J. Whitaker, Ten measures of diversity in classifier ensembles: limits for two classifiers, in: Proceedings of IEE Workshop on Intelligent Sensor Processing, 2001, pp. 10/1-10/6.
8. L.I. Kuncheva, R.K. Kountchev, Generating classifier outputs of fixed accuracy and diversity, Pattern Recogn. Lett. 23 (5) (2002) 593-600.
9. L.K. Hansen, P. Salamon, Neural network ensembles, IEEE Trans. Pattern Anal. Mach. Intell. 12 (1990) 993-1001.
10. A.J.C. Sharkey, Multi-Net Systems. Combining Artificial Neural Nets, Ensemble and Modular Multi-Net Systems, Springer, Berlin, 1999.
11. K. Turner, J. Ghosh, Linear and order statistics combiners for pattern classification. Combining Artificial Neural Nets, Ensemble and Modular Multi-Net Systems, Springer, Berlin 1999.
12. L.I. Kuncheva, C.A. Whitaker, C.A. Shipp, R.P.W. Duin, Is independence good for combining classifiers?, in: Proceedings 15th International Conference on Pattern Recognition, 2000, pp. 168-171.
13. S.M. Selkow, The tree-to-tree editing problem, Inform. Process. Lett. 6 (6) (1977) 184-186.
14. J.T.L. Wang, K. Zhang, Finding similar consensus between trees: an algorithm and a distance hierarchy, Pattern Recognition 34 (2001) 127-137.
15. G. Valiente, An efficient bottom-up distance between trees, in: Proceedings 8th International Symposium on String Processing and Information Retrieval, 2001, pp. 212-219.
16. E. Tanaka, K. Tanaka, The tree-to-tree editing problem, Int. J. Pattern Recogn. Artif. Intell. 2 (1988) 221-240.
17. T. Jiang, L. Wang, K. Zhang, Alignment of trees-an alternative to tree edit, Theory Comput. Sci. 143 (1) (1995) 137-148.
18. W.D. Shannon, D. Banks, Combining classification trees using MLE, Statist. Med. 18 (6) (1999) 727-740.
19. R. Mojena, Hierarchical grouping methods and stopping rules: An evaluation, Comput. J. 20 (1977) 359-363.
20. G.W. Milligan, M.C. Cooper, An examination of procedures for determining the number of clusters in a data set, Psychometrika 50 (2) (1985) 159-179.
21. M. Skurichina, R.P.W. Duin, Bagging for linear classifiers, Pattern Recognition 31 (7) (1998) 909-930.