Improving McDiarmid Tree Performance for Predicting Heart Disease from Data Streams with Missing and Meaningless Values

Abstract

Building machine learning algorithms for real-time clinical decision support systems has become a current research hotspot. The success of these algorithms depends on their ability to handle data stream characteristics. For example, we cite as characteristics the large amounts of data, the high speed and rate of incoming data, and the change in data nature and distribution over time. The Very Fast Decision Tree (VFDT) is a method for incrementally building decision trees. Since its proposition in the literature, it has become one of the most popular tools for data stream classification. This paper aims to optimize a new version of VFDT called McDiarmid Tree (MT) for the early prediction of heart diseases in real-time clinical decision support systems. The proposed method for improving MT performance consists of two main mechanisms: detecting the presence of missing and meaningless values in data attributes and handling the impact of this presence. The proposed MT has been compared with MT and VFDT. Simulation results show that the proposed MT attains significantly higher prediction accuracy with less time and model cost (RAM-Hours) than the other two algorithms.