Search arXivSearch

arXiv · 2009.13232

ECGDetect: Detecting Ischemia via Deep Learning

Abstract

Coronary artery disease(CAD) is the most common type of heart disease and the leading cause of death worldwide[1]. A progressive state of this disease marked by plaque rupture and clot formation in the coronary arteries, also known as an acute coronary syndrome (ACS), is a condition of the heart associated with sudden, reduced blood flow caused due to partial or full occlusion of coronary vasculature that normally perfuses the myocardium and nerve bundles, compromising the proper functioning of the heart. Often manifesting with pain or tightness in the chest as the second most common cause of emergency department visits in the United States, it is imperative to detect ACS at the earliest. This is particularly relevant to diabetic patients at home, that may not feel classic chest pain symptoms, and are susceptible to silent myocardial injury. In this study, we developed the RCE- ECG-Detect algorithm, a machine learning model to detect the morphological patterns in significant ST change associated with myocardial ischemia. We developed the RCE- ECG-Detect using data from the LTST database which has a sufficiently large sample set to train a reliable model. We validated the predictive performance of the machine learning model on a holdout test set collected using RCE's ECG wearable. Our deep neural network model, equipped with convolution layers, achieves 90.31% ROC-AUC, 89.34% sensitivity, 87.81% specificity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Atandra Burman, Jitto Titus, David Gbadebo, Melissa Burman. 2020-09-28. ECGDetect: Detecting Ischemia via Deep Learning. https://arxiv.org/abs/2009.13232

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG