00:01
Hello everyone in this problem it is given that a new applicant age 45 is applying for a loan using the table below what is the estimated probability that loan will be approved now in the table we have age 34 24 49 32 44 54 53 and record 1 2 3, 4, 5, 6, marital status, single, married, single, other, married, single.
00:55
Loan, 5 ,000, 15 ,000, 7 ,000, 10 ,000, 12 ,000, 9 ,000, risk, high low medium medium high low and default yes no yes no so from this table we can see the new applicant applying for the loan of age the probability be 30 % of approval probability be 30 % of approval probability be 30 % of approval.
01:57
Now the classification and regression trees, that is c -a -r -t, classification and regression trees algorithm, is the classification algorithm, is the classification algorithm for building a decision.
02:29
For building a decision tree based on, based on genie's impurity, genie's impurity index, impurity as splitting, splitting criteria, that is c -a -r -t is a binary tree, binary three build by building by splitting mode into two child into two child node rapidly rapidly the algorithm works the algorithm here we write algorithm works rapidly and for this we explain it through a diagram.
03:56
Here we have the root node and it divides it into two parts.
04:04
That is internal node, internal node and external node.
04:14
And external node...