A New Efficiency Improvement of Ensemble Learning for Heart Failure Classification by Least Error Boosting

Abstract

Heart failure is a very common disease, often a silent threat. It's also costly to treat and detect. There is also a steadily higher incidence rate of the disease at present. Although researchers have developed classification algorithms. Cardiovascular disease data were used by various ensemble learning methods, but the classification efficiency was not high enough due to the cumulative error that can occur from any weak learner effect and the accuracy of the vote-predicted class label. The objective of this research is the development of a new algorithm that improves the efficiency of the classification of patients with heart failure. This paper proposes Least Error Boosting (LEBoosting), a new algorithm that improves adaboost.m1's performance for higher classification accuracy. The learning algorithm finds the lowest error among various weak learners to be used to identify the lowest possible errors to update distribution to create the best final hypothesis in classification. Our trial will use the heart failure clinical records dataset, which contains 13 features of cardiac patients. Performance metrics are measured through precision, recall, f-measure, accuracy, and the ROC curve. Results from the experiment found that the proposed method had high performance compared to naïve bayes, k-NN, and decision tree, and outperformed other ensembles including bagging, logitBoost, LPBoost, and adaboost.m1, with an accuracy of 98.89%, and classified the capabilities of patients who died accurately as well compared to decision tree and bagging, which were completely indistinguishable. The findings of this study found that LEBoosting was able to maximize error reductions in the weak learner's training process from any weak learner to maximize the effectiveness of cardiology classifiers and to provide theoretical guidance to develop a model for analysis and prediction of heart disease. The novelty of this research is to improve original ensemble learning by finding the weak learner with the lowest error in order to update the best distribution to the final hypothesis, which will give LEBoosting the highest classification efficiency.