A C++ project which efficiently solves any given N-puzzle using backtracking on a decision tree.
-
Updated
Oct 21, 2023 - C++
A C++ project which efficiently solves any given N-puzzle using backtracking on a decision tree.
C++ code for "A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque"
A decision tree is a predictive model useful for different purposes and often used as a tool for decision support.
A C++ implementation and performance comparison of two machine learning algorithms, deep learning and decision tree learning
QUEST is proposed by Loh and Shih (1997), and stands for Quick, Unbiased, Efficient, Statistical Tree. It is a tree-structured classification algorithm that yields a binary decision tree. A comparison study of QUEST and other algorithms was conducted by Lim et al (2000).
Distributed Decision Tree Induction using MPI
An implementation of the ID3 Decision tree algorithm.
Add a description, image, and links to the decision-tree-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the decision-tree-algorithm topic, visit your repo's landing page and select "manage topics."