Abstract
Recently, decision tree algorithms have been widely used in dealing with data mining problems to find out valuable rules and patterns. However, scalability, accuracy and efficiency are significant concerns regarding how to effectively deal with large and complex data sets in the implementation. In this paper, we propose an innovative machine learning approach (we call our approach GAIT), combining genetic algorithm, statistical sampling, and decision tree, to develop intelligent decision trees that can alleviate some of these problems. We design our computational experiments and run GAIT on three different data sets (namely Socio-Olympic data, Westinghouse data, and FAA data) to test its performance against standard decision tree algorithm, neural network classifier, and statistical discriminant technique, respectively. The computational results show that our approach outperforms standard decision tree algorithm profoundly at lower sampling levels, and achieves significantly better results with less effort than both neural network and discriminant classifiers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Condon, E. (1997). Predicting the Success of Nations in the Summer Olympics Using Neural Networks, Master thesis, University of Maryland, College Park.
DeJong, K. (1980). Adaptive system design: A genetic approach. IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-10, No. 9, 566–574.
Fayyad, U., Piatetsky-Shapiro, G., Smith, P., & Uthurusamy, R. (1996). Advances in Knowledge Discovery and Data Mining, Cambridge, MA: MIT Press.
Fu, Z. (2000). Using Genetic Algorithms to Develop Intelligent Decision Trees, Doctoral dissertation, University of Maryland, College Park.
Goldberg, D. (1988). Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA: Addison-Wesley.
Grefenstette, J. Gopal, R., Rosmaita, B., & Van Gucht, D. (1985). Genetic algorithms for the traveling salesman problem. Proceedings of 1st International Conference on Genetic Algorithms (Pittsburgh, PA, (dy1985). Hillsdale, NJ: Erlbaum, 160–168.
Holland, J. (1975).Adaptation in Natural and Artificial Systems, Ann Arbor, MI: University of Michigan Press.
Janikow, C., & Michalewicz, Z. (1991). An experimental comparison of binary and floating point representations in genetic algorithms. Proceedings of 4th International Conference on Genetic Algorithms (San Diego, CA,1991). San Mateo, CA: Morgan Kaufmann, 31–36.
Kennedy, H., Chinniah C., Bradbeer P., & Morss L. (1997). The construction and evaluation of decision trees: A comparison of evolutionary and concept learning methods. Evolutionary Computing, D. Corne and J. Shapiro (eds.), Lecture Notes in Computer Science. Berlin: Springer-Verlag, 147–161.
Quinlan, J.R. (1993). C4.5: Programming for Machine Learning, San Mateo, CA: Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, Z. (2002). Using Genetic Algorithms-Based Approach for Better Decision Trees: A Computational Study. In: Lange, S., Satoh, K., Smith, C.H. (eds) Discovery Science. DS 2002. Lecture Notes in Computer Science, vol 2534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36182-0_40
Download citation
DOI: https://doi.org/10.1007/3-540-36182-0_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00188-1
Online ISBN: 978-3-540-36182-4
eBook Packages: Springer Book Archive