Random Forest Classifier Based ECG Arrhythmia Classification

Random Forest Classifier Based ECG Arrhythmia Classification

C. Vimal, B. Sathish
DOI: 10.4018/jhisi.2010040101
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Heart Rate Variability (HRV) analysis is a non-invasive tool for assessing the autonomic nervous system and for arrhythmia detection and classification. This paper presents a Random Forest classifier based diagnostic system for detecting cardiac arrhythmias using ECG data. The authors use features extracted from ECG signals using HRV analysis and DWT for classification. The experimental results indicate that a prediction accuracy of more than 98% can be obtained using the proposed method. This system can be further improved and fine-tuned for practical applications.
Article Preview
Top

Introduction

Electrocardiography is a commonly used, non-invasive procedure for recording the electrical activity of the heart. The record, which is called an electrocardiogram (ECG or EKG), shows the series of waves that relate to the electrical impulses which occur during each beat of the heart. The information present in ECG characteristic wave peaks and time intervals between them are important. The waves in a normal record are named P, Q, R, S, and T. Any abnormality in shape and variation in the time interval of these waves is considered as arrhythmia. Detection of abnormal ECG signals is a critical step in administering aid to patients. Often, patients are hooked up to cardiac monitors in hospital continuously. This requires continuous monitoring by the physicians. Due to the large number of patients in intensive care units and the need for continuous observation of them, several methods for automated arrhythmia detection have been developed in the past few decades to attempt simplify the monitoring task. Notably Palreddy et al. (1997) employed a multiple-classifier architecture composed of Self Organizing Maps (SOM) and Learning Vector Quantization (LMQ) to classify premature ventricular contraction (PVC) beats and the non-PVC beats. Acharya et al. (2004) used fuzzy equivalence classifier to classify four cardiac arrhythmias using certain parameters extracted from heart rate signals. Babak Mohammadzadeh-Asl et al. (2006) used both linear and non-linear parameter extracted from heart rate signals with multilayer feed forward neural networks to classify five types of arrhythmias. Chazal et al. (2006) proposed a method for automatic classification of heartbeats using ECG morphology, heartbeat interval features and RR intervals to discriminate five different beat types. Dingfie et al. (2002) classified six arrhythmias using autoregressive modeling and Generalized Linear Model (GLM). Linh et al. (2006) selected the Hermite Function Expansion as the feature extraction method to represent the QRS complex. They proposed a fuzzy neural network where Hermite coefficients served as the features to classify seven different types of arrhythmias. Kannathal et al. (2005) used three non-linear parameters as inputs to the proposed ANF classifier for classification of ten different types of arrhythmias. Kadbi et al. (2006) used wavelet parameters along with RR interval and Form Factor as inputs to an ANN classifier to discriminate ten different arrhythmias. There is always a growing need to develop new detection schemes with a high level of accuracy, or equivalently, with low false-positive and false-negative results, for them to be useful in practical applications. In this direction a new approach based on Random Forests classifier is presented in this paper. Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. A random forest is a multi-way classifier consisting of a number of trees, with each tree grown using some form of randomization. The leaf nodes of each tree are labeled by estimates of the posterior distribution over the arrhythmia classes. Each internal node contains a test that best splits the space of data to be classified. An arrhythmia is classified by sending it down every tree and aggregating the leaf distributions reached.

Complete Article List

Search this Journal:
Reset
Volume 19: 1 Issue (2024)
Volume 18: 1 Issue (2023)
Volume 17: 2 Issues (2022)
Volume 16: 4 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing