Algorithm 2: Decision Tree

Step

Processes Involved

1

Start Form_Dcision_Tree (DT)

2

Compute Class Frequency Value and Return Leaf_Node

3

CreateDT of N_nodes with Class Frequency Table (CFT)

4

ComputeGainValue (A) for Each_Attributes of A

5

N_Test = Best_Attribute_Gain

6

Test If N_Test Is Continuous Then

7

Find_Threshold_Value

8

If CFT Is Empty Then Child_N_Node Is a Leaf_Node

9

If CFT Is Not Empty Then Child_N_Nodeto Form_DT

10

Compute_Error_N_Node

11

Return N_Node