Contents • Decision Trees • ID3 Algorithm • C 4.5 Algorithm • Random Forest
Decision Trees • Decision tree is a simple but powerful learning Paradigm. • It is a type of classification algorithm for supervised learning. • A decision tree is a tree in which each branch node represents a choice between a number of alternatives and each leaf node represents a decision. • A node with outgoing edges is called an internal or test node. All other nodes are called leaves (also known as terminal or decision nodes).