Decision Tree


A decision tree is a non-parametric supervised learning algorithm, which is utilized for both classification and regression tasks. It has a hierarchical, tree structure, which consists of a root node, branches, internal nodes and leaf nodes.As you can see from the diagram above, a decision tree starts with a root node, which does not have any incoming branches. The outgoing branches from the root node then feed into the internal nodes, also known as decision nodes. Based on the available features, both node types conduct evaluations to form homogenous subsets, which are denoted by leaf nodes, or terminal nodes. The leaf nodes represent all the possible outcomes within the dataset.

Placeholder


Applications of Decision Tree? Let's Understand!



● Business management


● customer relationship management


● fraudulent statement detectionenergy consumption

PlaceholderPlaceholder


About Decision Tree: Let's See!

Tensorflow
sci-kit learn
Py torch
Keras
NumPy
Pandas
Matplotlib
Theano
Scipy
Plotly
Statsmodels

Placeholder