Research Article
Advancement in Physical Education Teaching Using Improved Energy Efficient Scalable Routing Algorithm-Based Wireless Network
Algorithm 2
Algorithm of RF classifier.
Input: training sample n, tree index q | Output: decision tree d | If the d’s root does not happen | Make a new leaf node F with the category of c as its label | Get the root node F of d | End if | Move the sample n towards the F at the bottom of the tree | Insert the sample n into F sample collection | Using F, refresh the allocation of class labels | if Gini (F) > SPLITTHRESHOLD | create a new node B | construct an additional tree | If F is a root node, then B should be as well | Else change F with B as the son node of O, O is a parent node | End if | Erase F | End if | Return d |
|