Acceso al sitio web del Consejo de Políticas de Infraestructura

   
ARTÍCULO
TITULO

Computational Algorithms Underlying the Time-Based Detection of Sudden Cardiac Arrest via Electrocardiographic Markers

Annmarie G. Raka    
Ganesh R. Naik and Rifai Chai    

Resumen

Early detection of sudden cardiac arrest (SCA) is critical to prevent serious repercussion such as irreversible neurological damage and death. Currently, the most effective method involves analyzing electrocardiogram (ECG) features obtained during ventricular fibrillation. In this study, data from 10 normal patients and 10 SCA patients obtained from Physiobank were used to statistically compare features, such as heart rate, R-R interval duration, and heart rate variability (HRV) features from which the HRV features were then selected for classification via linear discriminant analysis (LDA) and linear and fine Gaussian support vector machines (SVM) in order to determine the ideal time-frame in which SCA can be accurately detected. The best accuracy was obtained at 2 and 8 min prior to SCA onset across all three classifiers. However, accuracy rates of 75?80% were also obtained at time-frames as early as 50 and 40 min prior to SCA onset. These results are clinically important in the field of SCA, as early detection improves overall patient survival.

PÁGINAS
REVISTAS SIMILARES
Algorithms
Water
Aerospace

 Artículos similares

       
 
Azal Ahmad Khan, Salman Hussain and Rohitash Chandra    
Quantum computing has opened up various opportunities for the enhancement of computational power in the coming decades. We can design algorithms inspired by the principles of quantum computing, without implementing in quantum computing infrastructure. In... ver más
Revista: Algorithms

 
Marco Scutari    
Bayesian networks (BNs) are a foundational model in machine learning and causal inference. Their graphical structure can handle high-dimensional problems, divide them into a sparse collection of smaller ones, underlies Judea Pearl?s causality, and determ... ver más
Revista: Algorithms

 
Frank Klawonn and Georg Hoffmann    
Clustering algorithms are usually iterative procedures. In particular, when the clustering algorithm aims to optimise an objective function like in k-means clustering or Gaussian mixture models, iterative heuristics are required due to the high non-linea... ver más
Revista: Algorithms

 
Jose Luis Vieira Sobrinho, Flavio Henrique Teles Vieira and Alisson Assis Cardoso    
The high dimensionality of real-life datasets is one of the biggest challenges in the machine learning field. Due to the increased need for computational resources, the higher the dimension of the input data is, the more difficult the learning task will ... ver más
Revista: Applied Sciences

 
Bochi Guo, Yu Liu, Hui Zhou, Wei Yan and Shuanggen Zhang    
Automatic modulation recognition (AMR) provides excellent performance advantages over conventional algorithms and plays a key role in modern communication. However, a general challenge is that the channel errors greatly deteriorate the classification cap... ver más
Revista: Applied Sciences