VECTOR EVALUATION IN INDUCTION ALGORITHMS
Robert A. Pearson, PAUL E. STOKES · International Journal of High Speed Computing · 1990
This paper examines some of the aspects of an induction process that can have a significant decrease in total run time through the use of a vector processor and appropriate algorithms and code. The simplified induction algorithm assumes that all values are realistic, that a number of possible attributes could be used at every single node, and that possible partition points are given. The algorithm chooses the one-step optimal attribute, then builds a tree. Two slightly different variants of the algorithm are considered. For the first, the results include a comparison between the times taken for a scalar compilation, a compilation with the automatic vector code and some vector compiler directives. In the second variant calls to the vector library are used and other parts have the compiler directives.Timings for building the tree on a learning sample, and passing a test sample down an existing tree are compared in each case. The gain in speed, even for relatively short vectors, is about a factor of two.