Abstract
In recent years a number of authors have suggested that combining classifiers within local regions of the measurement space might yield superior classification performance to rigid global weightingschemes. In this paper we describe a modified version of the CART algorithm, called ARPACC, that performs local classifier combination. One obstacle to such combination is the fact that the ‘optimal’ covariance combination results originally assumed only two classes and classifier unbiasedness. In this paper we adopt an approach based on minimizing the Brier score and introduce a generalized matrix inverse solution for use in cases where the error matrix is singular. We also report some preliminary experimental results on simulated data.
Chapter PDF
Similar content being viewed by others
Keywords
References
Bates, J.M., Granger, W.J.: The combination of forecasts. Operational Research Quarterly 20, 451–468 (1969)
Blockeel, H., Struyf, J.: Frankenstein classifiers: Some experiments on the sisyphus data set. In: Proceedings of IDDM 2001, pp. 1–12 (2001)
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees, Wadsworth, U.S (1984)
Dickinson, J.P.: The combination of short term forecasts. In: Proc. Univ. of Lancaster Forecasting Conference (1972)
Dickinson, J.P.: Some comments on the combination of forecasts. Operational Research Quarterly 26, 205–210 (1975)
Frank, E., Wang, Y., Inglis, S., Holmes, G., Witten, I.: Using model trees for classification. Machine Learning 32, 63–76 (1998)
Hand, D.J.: Construction and Assessment of Classification Rules. John Wiley & Sons, Chichester (1997)
Hashem, S., Schmeiser, B.: Improving model accuracy using optimal linear combinations of trained neural networks. IEEE Transactions on Neural Networks 6, 792–794 (1995)
Joergensen, T.M., Linneberg, C.: Feature weighted ensemble classifiers - a modified decision scheme. In: Kittler, J., Roli, F. (eds.) MCS 2001. LNCS, vol. 2096, pp. 218–227. Springer, Heidelberg (2001)
Kamel, M.S., Wanas, N.M.: Data dependence in combining classifiers. In: Windeatt, T., Roli, F. (eds.) MCS 2003. LNCS, vol. 2709, pp. 1–14. Springer, Heidelberg (2003)
Kittler, J., Hatef, M., Duin, R.P.W., Matas, J.: On combining classifiers. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(3) (1998)
Venables, W., Ripley, B.: Modern Applied Statistics with S-Plus. Springer, Heidelberg (1994)
Woods, K., Kegelmeyer, W.P., Bowyer, K.: Combination of multiple classifiers using local accuracy estimates. IEEE Transactions on Pattern Analysis and Machie Intelligence 19, 405–410 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McDonald, R.A., Eckley, I.A., Hand, D.J. (2004). A Classifier Combination Tree Algorithm. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2004. Lecture Notes in Computer Science, vol 3138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27868-9_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-27868-9_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22570-6
Online ISBN: 978-3-540-27868-9
eBook Packages: Springer Book Archive