Decision Tree

Decision tree is one of the popular and widely used technique. A decision tree is a flowchart-like tree structure, where each internal node (non leaf node) denotes a test on an attribute, each branch represents an outcome of the test, and each leaf node (or terminal node) holds a class label. The topmost node in a tree is the root node. Some of decision tree algorithms are ID3, C4.5, NBTree, SimpleCart, REPTree, BFTree and others. This research work focuses on the C4.5 algorithm to develop the online software. Three measures are used for selecting the root node of a decision tree. The measures are: information gain, gain ratio and gini index. Different Decision tree algorithms use different measures to calculate the information contained in each attribute to select the root node of the decision tree. The measure used by C4.5 algorithm is Gain Ratio.

                                               Designed & Developed by :
                                                         Suvajit Das
Guided by Ms.Shashi Dahiya
   Indian Agricultural Statistics Research Institute (IASRI), Pusa, New Delhi-110012