Abstract
Decision tree grafting adds nodes to inferred decision trees. Previous research has demonstrated that appropriate grafting techniques can improve predictive accuracy across a wide cross-selection of domains. However, previous decision tree grafting systems are demonstrated to have a serious deficiency for some data sets containing missing values. This problem arises due to the method for handling missing values employed by C4.5, in which the grafting systems have been embedded. This paper provides an explanation of and solution to the problem. Experimental evidence is presented of the efficacy of this solution.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ali, K., Brunk, C., & Pazzani, M. (1994). On learning multiple descriptions of a concept. In Proceedings of Tools with Artificial Intelligence, pp. 476–483 New Orleans, LA.
Breiman, L. (1996). Bagging predictors. Machine Learning, 24, 123–140.
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression Trees. Wadsworth International, Belmont, Ca.
Dietterich, T. G., & Bakiri, G. (1994). Solving multiclass learning problems via error-correcting output codes. Journal of Artificial Intelligence Research, 2, 263–286.
Freund, Y., & Schapire, R. E. (1995). A decision-theoretic generalization of online learning and an application to boosting. In Proceedings of the Second European Conference on Machine Learning, pp. 23–37. Springer-Verlag.
Kwok, S. W., & Carter, C. (1990). Multiple decision tress. In Shachter, R. D., Levitt, T. S., Kanal, L. N., & Lemmer, J. F. (Eds.), Uncertainty in Artificial Intelligence 4, pp. 327–335. North Holland, Amsterdam.
Merz, C. J., & Murphy, P. M. (1998). UCI repository of machine learning databases. [Machine-readable data repository]. University of California, Department of Information and Computer Science, Irvine, CA.
Niblett, T., & Bratko, I. (1986). Learning decision rules in noisy domains. In Bramer, M. A. (Ed.), Research and Development in Expert Systems III, pp. 25–34. Cambridge University Press, Cambridge.
Nock, R., & Gascuel, O. (1995). On learning decision committees. In Proceedings of the Twelfth International Conference on Machine Learning, pp. 413–420 Taho City, Ca. Morgan Kaufmann.
Oliver, J. J., & Hand, D. J. (1995). On pruning and averaging decision trees. In Proceedings of the Twelfth International Conference on Machine Learning, pp. 430–437. Taho City, Ca. Morgan Kaufmann.
Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA.
Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5, 197–227.
Webb, G. I. (1996). Further experimental evidence against the utility of Occam’s razor. Journal of Artificial Intelligence Research, 4, 397–417.
Webb, G. I. (1997). Decision tree grafting. In IJCAI-97: Fifteenth International Joint Conference on Artificial Intelligence, pp. 846–851 Nagoya, Japan. Morgan Kaufmann.
Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5, 241–259.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Webb, G.I. (1998). The problem of missing values in decision tree grafting. In: Antoniou, G., Slaney, J. (eds) Advanced Topics in Artificial Intelligence. AI 1998. Lecture Notes in Computer Science, vol 1502. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095059
Download citation
DOI: https://doi.org/10.1007/BFb0095059
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65138-3
Online ISBN: 978-3-540-49561-1
eBook Packages: Springer Book Archive