New framework for Improving Random Forest Classification Accuracy

Iterating over every possible combination of features and building each combination as a decision tree takes massive processing power especially when there many features to select from. The main drawback with using decision tree classifiers is the tendency of the tree to be over fitted to a specific scenario. The random forest classifier resolves this issue by using randomly selected features as nodes. The problem with this approach is that it requires more time and computational power to construct the trees. In this paper we employed an optimization algorithm called Binary Particle Swarm. The binary particle swarm optimization algorithm is a powerful algorithm in the field of optimization. We used this algorithm to pick the best features that represent a dataset as input for a random forest classifier. We have achieved impeccable results in terms of accuracy and precision while maintaining minimum user interaction. We used the Wisconsin breast cancer dataset which can be obtained from the UCI machine learning repository. In this dataset, the objective is to predict whether the passenger has survived or not based on the provided attributes. We obtained a 97% on average and a best 98% classification accuracy on the Wisconsin breast cancer dataset.