决策树（decision tree）.docVIP

决策树（decision tree） Decision trees are generally generated from top to bottom. Each decision or event (i.e., the natural state) can lead to two or more events that lead to different results, drawing the decision branch into a graph, very similar to the branches of a tree, so it is called decision tree. Catalog principle application Difference shortcoming comment advantage Edit this paragraph principle A decision tree provides a way to demonstrate such rules as to what values will be obtained under what conditions. For example, in the loan application, you want to apply for the risk judgment, a decision tree diagram is set up in order to solve this problem, the basic part we can see from the decision tree: the decision node, branches and leaves. The top node in the decision tree is called the root node, which is the beginning of the whole decision tree. The root node in this case is income $40000, different answer to this question of yes and no two branches. The number of node nodes in a decision tree is related to the algorithm used by the decision tree. Such as the decision tree obtained by the CART algorithm, each node has two branches, and this tree is called two fork tree. A tree that allows nodes to have more than two nodes is called a multiway tree. The internal nodes of a decision tree (non leaf nodes) represent tests on a property. Each branch is either a new decision node, or the end of the tree, called a leaf. In the process of traversing the decision tree from top to bottom, each node encounters a problem, and the different answers to the questions on each node lead to different branches and eventually arrive at a leaf node. This process is the process of classifying a decision tree using several variables (each of which corresponds to a problem) to determine which category (the last leaf will correspond to one category). Edit this paragraph application If the bank officials responsible for lending using the above this decision tree to decide which to sup