A Novel Method to Improve the Efficiency of Classification Phase of a Decision Tree

Abstract

So far, most of the research on classification algorithms in machine learning has been focused only on improving the training speed and further improving the technical performance evaluation measures of the constructed models. There is no focus on improving the runtime efficiency of the classification phase which is much required in some critical applications. In this paper, we are considering the computation complexity of a decision tree’s classification phase as the major criterion. A novel approach has been proposed to predict the class label of an unseen instance using the decision tree in less time than the regular tree traversal method. In the proposed method, the constructed decision tree is represented in the form of arrays. Then, the process of finding the class label is carried out by performing the bitwise operations between the elements of the arrays and test instance. Empirical results on various UCI data sets proved that the proposed method outperforms the standard method and five other benchmark classifiers and its classification is at least four times faster than the regular method.