Systematic Consequence of Different Splitting Indices on the Classification Performance of Random Decision Forest

Random Forest algorithm eliminates the confines of a decision tree algorithm by reducing the over-fitting of datasets. It can handle the missing values in an effective manner and is more accurate than the decision trees. This research study presents a comparison of five different supervised machine learning algorithms namely Naive Bayes, Decision Tree, Multilayer Perceptron, Support Vector Machine and Random Forest for the classification of the disease dataset collected from an online repository. The Random Forest algorithm emerges to be the most efficient algorithm in classifying the diseases. Also, the research study applies different attribute selection measures to evaluate the impact of accuracy on the Random Forest classifier empirically. Among the different node splitting criteria, we conclude that the GINI index performed better on average than the Information Gain and Gain Ratio. The work is implemented using the Python 3.7 programming language.