Qiskit Quantum Implementation for Random Forest Algorithm for Binary Clasification Problem

Safina L., Khadiev K., Zinnalullin I., Khadieva A., Qiskit Quantum Implementation for Random Forest Algorithm for Binary Clasification Problem

Quantum circuit for random forest prediction.

L. Safina, K. Khadiev, I. Zinnatullin, A. Khadieva. Quantum circuit for random forest prediction.

Quantum emulator experiments for Ensemble methods on Binary Classification Problems.

L. Safina, K. Khadiev, Quantum emulator experiments for Ensemble methods on Binary Classification Problems.

The Quantum Version Of Random Forest Model For Binary Classification Problem

Kamil Khadiev and Liliya Safina, The Quantum Version Of Random Forest Model For Binary Classification Problem

Quantum vertion of prediction a class by ansamble methods for Binary classification problem

Liliya Safina, Kamil Khadiev, Quantum vertion of prediction a class by ansamble methods for Binary classification problem

Analysis of Quantum Algorithm for Decision Tree Construction Implementation

Liliya Safina, Ilnaz Mannapov, Kamil Khadiev, Analysis of Quantum Algorithm for Decision Tree Construction Implementation

The Quantum Version of Prediction for Binary Classification Problem by Ensemble Methods.

The Quantum Version of Prediction for Binary Classification Problem by Ensemble Methods.

K. Khadiev, L. Safina, The Quantum Version of Prediction for Binary Classification Problem by Ensemble Methods.

The Classical and Quantum Improvements of Decision Tree Constructing Algorithms C5.0 and CART

The Classical and Quantum Improvements of Decision Tree Constructing Algorithms C5.0 and CART

Liliia Safina, Ilnaz Mannapov and Kamil Khadiev. The Classical and Quantum Improvements of Decision Tree Constructing Algorithms C5.0 and CART

Classical and Quantum Improvements of Generic Decision Tree Constructing Algorithm for Classification Problem

Classical and Quantum Improvements of Generic Decision Tree Constructing Algorithm for Classification Problem

Ilnaz Mannapov, Kamil Khadiev and Liliya Safina. Classical and Quantum Improvements of Generic Decision Tree Constructing Algorithm for Classification Problem

Classical and Quantum Improvements of Generic Decision Tree Constructing Algorithm for Classification Problem

Ilnaz Mannapov, Liliya Safina and Kamil Khadiev, Classical and Quantum Improvements of Generic Decision Tree Constructing Algorithm for Classification Problem

The Quantum Version Of Random Forest Model For Binary Classification Problem

Kamil Khadiev and Liliya Safina, The Quantum Version Of Random Forest Model For Binary Classification Problem

Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs

In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known deterministic algorithm is $O(n+m)$, where $n$ is the number of

Kamil Khadiev and Liliya Safina. Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs

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

The Quantum Version Of Classification Decision Tree Mannapov I., Safina L., Khadiev K., Constructing Algorithm C5.0

The Quantum Version Of Classification Decision Tree Constructing Algorithms

We consider decision tree as a model for the classification problem from machine learning. We focus on complexity of decision tree constructing algorithms as C5.0, CART. In classical case the decision tree is constructed in O(hd(NM+NlogN)) running time, where M is a number of classes, N is the size

Lilia Safina, Ilnaz Mannapov, Kamil Khadiev "The Quantum Version Of Classification Decision Tree Constructing Algorithms"

Quantum Algorithm for Shortest Path Searching Problem in Directed Acycling Graphs

Khadiev K., Safina L. "Quantum Algorithm for Shortest Path Searching Problem in Directed Acycling Graphs"

Quantum Algorithms for Shortest and Longest Path Search Problems for DAGs

Kamil Khadiev and Liliya Safina. Quantum Algorithms for Shortest and Longest Path Search Problems for DAGs

Quantum Dynamic Programming Algorithm for DAGs. Applications for AND-OR DAG Evaluation, Diameter, Shortest and Longest Paths Search in DAG

In this paper, we present Quantum Dynamic Programming approach for problems on directed acycling graphs (DAGs). The algorithm has the time complexity $O(\sqrt{\hat{n}m}\log \hat{n})$ comparing to a deterministic one that has the time complexity $O(n+m)$. Here $n$ is a number of vertexes, $\hat{n}$ i

"Quantum Dynamic Programming Algorithm for DAGs. Applications for AND-OR DAG Evaluation, Diameter, Shortest and Longest Paths Search in DAG"

Linear model for Electric load forecasting. Tatarstan republic experience

Safina L., Khadiev K. Linear model for Electric load forecasting. Tatarstan republic experience