Comparison of Predictive Models for Transferring Stroke In-Patients to Intensive Care Unit
Journal Title: Transactions on Machine Learning and Artificial Intelligence - Year 2016, Vol 4, Issue 3
Abstract
The cost for Intensive Care Unit (ICU) resources is extremely high and it affects healthcare budget that provides quality healthcare service for patients. Thus, the need for a predictive model for the decision to transfer stroke in-patients to the ICU is very important to utilize the resources effectively. Also, it will help to lower morbidity and mortality rates through earlier detection and intervention. In this research, initially, a Decision Tree (DT) model, an Artificial Neural Network (ANN) model, a Support Vector Machine (SVM) model, and a Logistic Regression (LR) model are evaluated for predicting the need to transfer the stroke in-patients to the ICU or not. The study is conducted on a clinical dataset consisting of 1,415 observations using the vital signs with six variables. This original dataset was having data imbalance and hence the result was misleading. In order to overcome this situation the Synthetic Minority Oversampling Technique was applied on the dataset. A DT model, an ANN model, a SVM model, and a LR model are evaluated again on the balanced dataset for prediction. Tree-based ensemble approaches such as Generalized Boosted Model, Adaptive Boosting (AdaBoost.M1), Random Forest and Bagged AdaBoost (Adabag) are used to improve the accuracy and performance of models. These methods were trained and tested on the balanced stroke in-patients dataset. The boosting model, AdaBoost.M1, and bagging model, Random Forest, achieved better accuracy compared to the other models. Therefore, these two models could be used for helping healthcare professionals in decision-making.
Authors and Affiliations
Nawal N. Alotaibi, Sreela Sasi
Keywords
Related Articles
- EP ID EP277213
- DOI 10.14738/tmlai.43.2051
- Views 63
- Downloads 0
Comparison Performance Evaluation of Modified Genetic Algorithm and Modified Counter Propagation Network for Online Character recognition
This paper carries out performance evaluation of a Modified Genetic Algorithm (MGA) and Modified Counter Propagation Network (MCPN) Network for online character recognition. Two techniques were used to train the feature...
On Modified Self Organizing Feature Maps
This paper presents optimization of self-organizing feature maps by adjusting tunable parameters and in the iterative process by utilizing linear algebra concepts. A gradient rule is applied on the weights matrix singula...
Probabilistic Search and Pursuit Evasion on a Graph
This paper presents an approach to locate an adversarial, mobile evader in an indoor environment using motion planning of mobile pursuers. The approach presented in this paper uses motion planning of mobile robots to sea...
Comparative Analysis of Three Metaheuristics For Solving The Travelling Salesman Problem
This research paper aims to do a comparative study of three recent optimization metaheuristic approaches that had been applied to solve the NPhard optimization problem called the travelling salesman problem. The three re...
Optimizing Hadoop for Small File Management
HDFS is one of the most used distributed file systems, that offer a high availability and scalability on lowcost hardware. HDFS is delivered as the storage component of Hadoop framework. Coupled with map reduce, which is...