Although genetic algorithm-based decision tree algorithms are applied successfully in various classification tasks, their execution times are quite long on large datasets. A novel decision tree algorithm, called Real-Coded Genetic Algorithm-based Linear Decision Tree Algorithm with k-D Trees (RCGA-based LDT with kDT), is proposed. In the proposed algorithm, a k-D tree is built when a new node of a linear decision tree is created. The use of k-D trees speeds up the construction of linear decision trees without sacrificing the quality of the constructed decision trees. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Ng, S. C., & Leung, K. S. (2005). Induction of linear decision trees with real-coded genetic algorithms and k-D trees. In Lecture Notes in Computer Science (Vol. 3578, pp. 264–271). Springer Verlag. https://doi.org/10.1007/11508069_35
Mendeley helps you to discover research relevant for your work.