Decision Trees Applications
/ August 14, 2017

Decision Tree Overview In data mining techniques two kinds of basic learning processes are available namely supervised and unsupervised. when we talk about the supervised learning techniques the decision tree learning is one of the most essential technique of classification and prediction. A number of different kinds of decision tree algorithms are available i.e. ID3, C4.5, C5.0, CART, SLIQ and others. All these algorithms the used to generate the transparent data models. these data models can be evaluated using the paper and pencil. therefore that is an effective data modeling technique. Applications of Decision Trees Application of Decision Tree Algorithm in Healthcare Operations [1]: the decision trees are used to visualize the data patterns in form of tree data structure. that help to also prepare the relationship among the attributes and the final class labels. thus the patient’s different health attributes can help to understand the symptoms and possibility by comparing the historical data available with the similar attributes. Manufacturing and Production: in a large production based industries where the regulation of production and planning is required. the decision tree models helps for understanding the amount of production, time of production and other scenarios. that can be evaluated using the past scenarios of…

Introduction of Decision Trees
/ August 11, 2017

Decision Tree: Overview Data mining techniques that help to make decisions using the available facts can be termed as Decision Tree. Decision trees are not only useful for decision-making applications it is also used for classification and prediction task. There are some popular decision Tree algorithms namely C4.5, ID3, and CART. These algorithms are supervised learning algorithms. During training, the input samples are represented as a tree data structure. example An example of a decision tree is given in figure 1, where nodes of the tree show the attributes of the data set. Additionally, edges create a relationship among two nodes using the values of available attributes. The leaf node of the tree is recognized as the decision node. Figure 1 decision tree example Figure 1, demonstrates a decisions tree. Here decision labels are (yes or no), it is also known as class labels. In decision trees, the class label is placed on leaf nodes. Additionally, the nodes humidity, outlook, and wind are attributes in data-set. Because the data set contains decision and attributes and decision tree graphically represents the data. Therefore it is helpful to understand the relationship between them. Sometimes the decision trees are used in form of IF…