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

07/16/2019
∙
by   Kamil Khadiev, et al.
∙
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 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· N N). Secondly, we suggest a quantum version of this algorithm, which uses quantum subroutines like the amplitude amplification and the Dürr-Høyer minimum search algorithms that are based on Grover's algorithm. The running time of the quantum algorithm is O(h·√(d) d · N N) that is better than complexity of the classical algorithm.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment