Thresholding a Random Forest Classifier

Abstract

Abstract. The original Random Forest derives the final result with respect to the number of leaf nodes voted for the corresponding class. Each leaf node is treated equally and the class with the most number of votes wins. Certain leaf nodes in the topology have better classification accuracies and others often lead to a wrong decision. Also the performance of the forest for different classes differs due to uneven class proportions. In this work, a novel voting mechanism is introduced: each leaf node has an individual weight. The final decision is not determined by majority voting but rather by a linear combination of individual weights leading to a better and more robust decision. This method is inspired by the construction of a strong classifier using a linear combination of small rules of thumb (AdaBoost). Small fluctuations which are caused by the use of binary decision trees are better balanced. Experimental results on several datasets for object recognition and action recognition demonstrate that our method successfully improves the classification accuracy of the original Random Forest algorithm.

Towards transparent machine learning models using feature sensitivity algorithm

“…Experiments After Random Forest (RF) is a machine learning algorithm that is used widely for classification problems, RF is made of an ensemble of autonomous decision trees [21]. Each tree is learned with randomly selected samples and features [30]. We created a model to predict the test data.…”

A Comparative Analysis for Predicting Airline Arrival Delays

“…Random forest is a classifier that consists of relatively uncorrelated models (trees) operating as a committee will outperform any of the individual constituent models. Random Forest uses an ensemble of decision trees as a basis and therefore has all advantages of decision trees, such as high accuracy, easy usage, and no necessity of scaling data [9].…”