Boosted tree ensembles for solving multiclass problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2364, Issue , 2002, Pages 42-51

  Windeatt, Terry ^a   Ardeshir, Gholamreza ^a  

^a UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING;

BASE CLASSIFIERS; BENCHMARK DATASETS; ENSEMBLE TECHNIQUES; GENERALISATION; MULTI-CLASS PROBLEMS; TREE ENSEMBLES; TREE PRUNING;

FORESTRY;

EID: 84947560755     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45428-4_4     Document Type: Article

References (25)

1. [1] D.W. Aha and R. L. Bankert. Cloud classification using error-correcting output codes. Artificial Intelligence Applications: Natural Resources, Agriculture, and Environmental Science, 11(1):13-28, 1997.
2. [2] E.L. Allwein, R.E. Schapire, and Y. Singer. Reducing multi-class to binary: A unifying approach for margin classifiers. Machine learning research, 1:113-141, 2000.
3. [3] G. Bakiri and T. Dietterich. Achieving high-accuracy text-to-speech with machine learning, 1999.
4. [4] A. Berger. Error-correcting output coding for text classification. In IJCAI’99, Workshop on machine learning for information filtering, 1999.
5. [5] C.L. Blake and Merz C.J. Uci repository of machine learning databases. Technical report, Irvine, Univ.of Calif., Inf. and Comp. Scienc, 1998.
6. [6] Leo Breiman, J.H.F reidman, R.A. Olshen, and C.J. Stone. Classification and regression trees. Wadsworth International Group, 1984.
7. [7] L.A. Breslow and D.W. Aha. Simplifying decision trees: A survey. Knowledge Engineering Review, pages 1-40, 1997.
8. [8] K.Crammer and Y.S inger. On the learnability and design of output codes for multiclass problems. Machine Learning, to appear.
9. [9] T.G. Dietterich D.M argineantu. Pruning adaptive boosting. In International Conference on Machine Learning, pages 211-218.Morgan Kaufmann, 1997.
10. [10] T.G.D ietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40(2):139-158, 2000.
11. [11] T.G Dietterich and G. Bakiri. Error-correcting output codes: A general method for improving multiclass inductive learning programs.In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), pages 572-577. AAAI Press, 1991.
12. [12] T.G. Dietterich and G Bakiri. Solving multi-class learning problems via errorcorrecting output codes. Journal of Artificial Intelligence Research, 2:263-286, 1995.
13. [13] F.Esp osito, D. Malerba, and G.S emeraro. A comparative analysis of methods for pruning decision trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(5):476-491, May 1997.
14. [14] G.M. James, and T. Hastie. The error coding method and pict’s. Computational and Graphical Statistics, 7:377-387, 1998.
15. [15] J. Kittler, R. Ghaderi, T. Windeatt, and G. Matas. Face verification using error correcting output codes.In Computer Vision and Pattern Recognition CVPR01, volume 1, pages 755-760, Hawaii, December 2001.I EEE Press.
16. [16] J. Ross. Quinlan. Personal communication from Quinlan.
17. [17] R. Quinlan. Induction of decision tree. Machine Learning, 1:81-106, 1986.
18. [18] R. Quinlan. C4.5: Programs for Machine Learning. M organ Kaufmann, San Mateo, California, 1993.
19. [19] R.J. Quinlan. Simplyfying decision trees. International Journal of Man-Machine Studies, 27:221-234, 1987.
20. [20] R.E. Schapire. Using output codes to boost multiclass learning problems. In 14th International Conf. on Machine Learning, pages 313-321.Morgan Kaufman, 1997.
21. [21] T. Windeatt and A. Ardeshir. Tree pruning for output coded ensembles. In International Conference of Pattern Recognition, Quebec, Canada, 2002.su bmitted.
22. [22] T. Windeatt and G. Ardeshir. Boosting unpruned and pruned decision trees. In Applied Informatics, Preceedings of the IASTED International Symposia, pages 66-71, 2001.
23. [23] T. Windeatt and G. Ardeshir. An empirical comparison of pruning methods for ensemble classifiers.In IDA 2001.Spri nger-Verlag, Lecture notes in computer science, 2001.
24. [24] T. Windeatt and R. Ghaderi. Multi-class learning and error-correcting code sensitivity. Electronics Letters, 36(19):1630-1632, Sep 2000.
25. [25] T. Windeatt and R. Ghaderi. Binary labelling and decision level fusion. Information Fusion, 2(2):103-112, 2001.