Algorithm 4 Random forest classification algorithm

Starting from the root node of the current tree, according to the current node’s threshold $th$, it is determined whether to enter the left node ($<th$) or enter the right node ($\ge th$) until a certain leaf node is reached and the predicted value is output. Repeat 1 until all t-trees have output predictions. This will give a class with the largest sum of predicted probabilities in all trees.