The Quantum Version Of Classification Decision Tree Constructing Algorithm C5.0

In the paper, we focus on complexity of C5.0 algorithm for constructing decision tree classifier that is the models for the classification problem from machine learning. In classical case the decision tree is constructed in O(hd(NM+N log N)) running time, where M is a number of classes, N is the size of a training data set, d is a number of attributes of each element, h is a tree height. Firstly, we improved the classical version, the running time of the new version is O(h· d· Nlog N). Secondly, we suggest a quantum version of this algorithm, which uses quantum subroutines like the amplitude amplification and the D"urr-Hoyer minimum search algorithms that are based on Grover's algorithm. The running time of the quantum algorithm is Obig(h· √dlog d · N log Nbig) that is better than complexity of the classical algorithm.