Decision Tree Algorithm Comparision - clumsyspeedboat/Decision-Tree-Neo4j GitHub Wiki
Survey of Decision Tree Algorithms
Introduction
Decision Tree belongs to a family of supervised learning algorithms. Unlike other supervised learning algorithms, decision tree algorithm can also be used for solving regression and classification problems. Hence the reason why decision tree often applied in working with medical data to classified patients according to their conditions.
Decision Tree Algorithms
There are several statistical algorithms that can be uses to build a decision tree. Depending on our clinical data set about heart failure prediction, we will need to choose a decision tree algorithms accordingly.
The table below provides a brief comparison between decision tree algorithms, The information from this table are gathered from various articles: ResearchGate ,TowardsDataScience
ID3
CART
CART is a Decision Tree algorithm that created binary classification or regression trees. It can handle data in raw form and can use the variables again in the same decision tree.
C4.5
C4.5 can handle continuous and categorical data, make it able to create regression and classification trees. It can also handle missing values by ignoring instances that include non-existing data. There is a latest version of C4.5 algorithm that is called C5. C5 presents with some improvements like:
- Improvement in speed
- Memory usage
- Smaller decision trees
- Additional data types
- Winnowing