Random Forest (RF) is an ensemble learner in which many unpruned decision trees are built [10]. Bagging is used to
construct the trees in that a random subset (with replacement) of features and a random subset of data are selected to build
each tree. While building the trees, a random subset of features are considered at each decision node. After all trees are
built, classification takes place by evaluating the instance with respect to all trees and the decision is the one agreed by the
majority of the trees (i.e. a majority voting approach)