Ng, Sai-CheongSai-CheongNgProf. LEUNG Kwong Sak2023-03-272023-03-272005Lecture Notes in Computer Science, 2005, Vol. 3578, pp. 264 - 27103029743http://hdl.handle.net/20.500.11861/7607Although 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.enDecision TreeExecution TimeTraining SampleChild NodeDisjoint SubsetPeer Reviewed Journal Article10.1007/11508069_35