Abstract
Better decision trees can be learnt by merging continuous values into intervals. Merging of values, however, could introduce inconsistencies to the data, or information loss. When it is desired to maintain a certain consistency, interval mergings in one attribute could disable those in another attribute. This interaction raises the issue of determining the order of mergings. We consider a globally greedy heuristic that selects the “best” merging from all continuous attributes at each step. We present an implementation of the heuristic in which the best merging is determined in a time independent of the number of possible mergings. Experiments show that intervals produced by the heuristic lead to improved decision trees.
Preview
Unable to display preview. Download preview PDF.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
J. Dougherty, R. Kohavi, M. Sahami. Supervised and Unsupervised Discretization of Continuous Features. In the 12th International Conference on Machine Learning, 1995.
R. Kerber. ChiMerge: Discretization of Numeric Attributes. In Ninth National Conference on Artificial Intelligence, 1992, 123–128.
C.J. Merz, P.M. Murphy. UCI Repository of machine learnign databases [http://www.ics.uci.edu/ mlearn/MLRepository.html].
J.R. Quinlan, C4.5: Programs for Machine Learning. Los Altos, CA: Morgan Kaufmann, 1993.
J.R. Quinlan. Improved Use of Continuous Attributes in C4.5. In Journal of Artificial Intelligence Research 4, 1996, 77–90
M. Richeldi and M. Rossotto. Class-driven Statistical Discretization of Continuous Attributes. In Proc. of European Conference on Machine Learning 1995, Springer Verlag, 335–338.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, K., Liu, B. (1998). Concurrent discretization of multiple attributes. In: Lee, HY., Motoda, H. (eds) PRICAI’98: Topics in Artificial Intelligence. PRICAI 1998. Lecture Notes in Computer Science, vol 1531. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0095274
Download citation
DOI: https://doi.org/10.1007/BFb0095274
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65271-7
Online ISBN: 978-3-540-49461-4
eBook Packages: Springer Book Archive