Abstract
Decision tree methods constitute an important and much used technique for classification problems. When such trees are used in a Datamining and Knowledge Discovery context, ease of interpretation of the resulting trees is an important requirement to be met. Decision trees with tests based on a single variable, as produced by methods such as ID3, C4.5 etc., often require a large number of tests to achieve an acceptable accuracy. This makes interpretation of these trees, which is an important reason for their use, disputable. Recently, a number of methods for constructing decision trees with multivariate tests have been presented. Multivariate decision trees are often smaller and more accurate than univariate trees; however, the use of linear combinations of the variables may result in trees that are hard to interpret. In this paper we consider trees with test bases on combinations of at most two variables. We show that bivariate decision trees are an interesting alternative to both uni- and multivariate trees, especially qua ease of interpretation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J.C. Bioch, O.R. van der Meer, R. Potharst. Bivariate Decision Trees. Technical Report, Department of Computer Science, Erasmus University Rotterdam, 1996.
R.J. Brachman. The Process of Knowledge Discovery in Databases, in: U.M. Fayyad et al. eds. Advances in Knowledge Discovery and Datamining, Ch.2, AAAI/MIT Press, Cambridge 1996.
L. Breiman, J.H. Friedman, R.A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth (reprinted by Chapman & Hall), 1984.
C.E. Brodley and P.E. Utgoff. Multivariate decision trees. Machine Learning, 19: 45–77, 1995.
U.M. Fayyad and K.B. Irani. Multi-interval discretization of continous-valued attributes for classification learning. In Proceedings Thirteenth International Joint Conference on Artificial Intelligence, pages 1022–1027. San Fransisco: Morgan Kaufmann, 1993.
B. Koehn and J.M. Zytkow. Experimenting and Theorizing in Theory Formation, in: Z. Ras and M. Zemankova eds. Proceedings of the International Symposium of Methodologies for Intelligent Systems, ACM SIGART Press, 296–307, 1986.
P.M. Murphy and D.W. Aha. UCI repository of machine learning databases and domain theories. Technical report, University of California, 1992. Web Page: http://www.ics.uci.edu/~mlearn/MLRepository.html.
S. Murthy, S. Kasif, S. Salzberg, and R. Beigel. OCl: Randomized induction of oblique decision trees. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 322–327, 1993.
S. Murthy. On Growing Better Decision Trees from Data. PhD thesis, John Hopkins University, Baltimore, 1995.
O.L. Mangasarian and W. H. Wolberg. Cancer diagnosis via linear programming. SIAM News, 23(5):1–18, 1990.
J.R. Quinlan. Improved use of continuous attributes in C4.5. Journal of Artificial Intelligence Research, 4:77–90, 1996.
B.D. Ripley. Pattern Recognition and Neural Networks. Cambridge University Press, 1996.
S. Thrun. Comparison of machine learning algorithms. Technical Report CMU-CS-91-197, Carnegie Mellon University, Department of Computer Science, 1991.
P.E. Utgoff and C.E. Brodley. Linear machine decision trees. Technical Report COINS Technical Report 91-10, University of Massachusetts, Department of Computer and Information Science, 1991.
J.M. Zytkow. Automated Discovery of Empirical Laws. Fundamenta Informaticae, 27:299–318, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bioch, J.C., van der Meer, O., Potharst, R. (1997). Bivariate decision trees. In: Komorowski, J., Zytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1997. Lecture Notes in Computer Science, vol 1263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63223-9_122
Download citation
DOI: https://doi.org/10.1007/3-540-63223-9_122
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63223-8
Online ISBN: 978-3-540-69236-2
eBook Packages: Springer Book Archive