Decision Tree Analysis On Decision Trees

1277 Words6 Pages
Decision Tree Analysis A decision tree is a widespread technique of designing and envisaging predictive patterns and systems. It is a tree-structured design of a set of aspects to test in direction to expect the output. Decision trees are effective and accepted implements for prediction and classification. The value of decision trees is because of the reality that, in compare to neural networks, it signifies rules. Rules can quickly be articulated so that individuals can comprehend them or even directly use up in a database retrieve language as structured query language (SQL) so that keep information falling into a certain sort may be accessed. Decision tree technique is mostly used for data classification, and it differed into 2 phases; the tree pruning and the tree structure. The training data to create a test function, conferring to various classification centered on decision tree classification process in contrast with another, it is a faster, more straightforward and easy to comprehend classification systems, simply transformed into database uncertainties benefits, and particularly in problem matters of high dimension can be incredibly decent classification outcomes. The decision tree is a classification paradigm, applied to remaining data. If we apply it to special data, for which the class is unidentified, we also get a prognostication of the class. The hypothesis is that the special data originates from the analogous dissemination as the data we get through to create
Open Document