Next Article in Journal
Cognitive Function and the Ability to Operate Long-Term Oxygen Therapy Equipment: An Exploratory Study
Next Article in Special Issue
Improving Water Quality Index Prediction Using Regression Learning Models
Previous Article in Journal
Stress, Burnout, Anxiety and Depression among Teachers: A Scoping Review
Previous Article in Special Issue
Methodological Issues in Analyzing Real-World Longitudinal Occupational Health Data: A Useful Guide to Approaching the Topic
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Developing Graph Convolutional Networks and Mutual Information for Arrhythmic Diagnosis Based on Multichannel ECG Signals

by
Bahare Andayeshgar
1,
Fardin Abdali-Mohammadi
2,
Majid Sepahvand
2,
Alireza Daneshkhah
3,*,
Afshin Almasi
4 and
Nader Salari
1,5,*
1
Department of Biostatistics, School of Health, Kermanshah University of Medical Sciences, Kermanshah 6715847141, Iran
2
Department of Computer Engineering and Information Technology, Razi University, Kermanshah 6714967346, Iran
3
Research Centre for Computational Science and Mathematical Modelling, Coventry University, Coventry CV1 2JH, UK
4
Clinical Research Development Center, Imam Khomeini and Mohammad Kermanshahi and Farabi Hospitals, Kermanshah University of Medical Sciences, Kermanshah 6715847141, Iran
5
Sleep Disorders Research Center, Kermanshah University of Medical Sciences, Kermanshah 6715847141, Iran
*
Authors to whom correspondence should be addressed.
Int. J. Environ. Res. Public Health 2022, 19(17), 10707; https://doi.org/10.3390/ijerph191710707
Submission received: 22 June 2022 / Revised: 22 August 2022 / Accepted: 25 August 2022 / Published: 28 August 2022
(This article belongs to the Special Issue Data Science for Environment and Health Applications)

Abstract

:
Cardiovascular diseases, like arrhythmia, as the leading causes of death in the world, can be automatically diagnosed using an electrocardiogram (ECG). The ECG-based diagnostic has notably resulted in reducing human errors. The main aim of this study is to increase the accuracy of arrhythmia diagnosis and classify various types of arrhythmias in individuals (suffering from cardiovascular diseases) using a novel graph convolutional network (GCN) benefitting from mutual information (MI) indices extracted from the ECG leads. In this research, for the first time, the relationships of 12 ECG leads measured using MI as an adjacency matrix were illustrated by the developed GCN and included in the ECG-based diagnostic method. Cross-validation methods were applied to select both training and testing groups. The proposed methodology was validated in practice by applying it to the large ECG database, recently published by Chapman University. The GCN-MI structure with 15 layers was selected as the best model for the selected database, which illustrates a very high accuracy in classifying different types of rhythms. The classification indicators of sensitivity, precision, specificity, and accuracy for classifying heart rhythm type, using GCN-MI, were computed as 98.45%, 97.89%, 99.85%, and 99.71%, respectively. The results of the present study and its comparison with other studies showed that considering the MI index to measure the relationship between cardiac leads has led to the improvement of GCN performance for detecting and classifying the type of arrhythmias, in comparison to the existing methods. For example, the above classification indicators for the GCN with the identity adjacency matrix (or GCN-Id) were reported to be 68.24%, 72.83%, 95.24%, and 92.68%, respectively.

1. Introduction

Cardiovascular diseases are one of the main causes of mortality across the world, which impose a heavy burden on society [1,2,3]. Cardiac arrhythmia, which is known as an abnormal heart rhythm, is considered as a very important category of cardiovascular disorders [4]. There are different types of arrhythmias with different symptoms such as a heartbeat that is too slow or fast (sinus bradycardia (SB) and atrial tachycardia (AT)), and irregular rhythms with missing or distorted sections and intervals (premature ventricular contraction (AVC)). Atrial fibrillation (AFIB), as the most common and dangerous type of arrhythmia, is associated with a significant increase in the risk of severe heart failure and stroke [5]. Other types of arrhythmias include Sinus Tachycardia (ST), Sinus Irregularity (SI), Supraventricular Tachycardia (ST), Atrioventricular Node Reentrant Tachycardia (AVNRT), Atrioventricular Reentrant Tachycardia (AVRT), and Sinus Atrium to Atrial Wandering Rhythm (SAAWR).
Diagnostic methods of arrhythmia include electrocardiograms, Holter and event monitors, implantable loop recorders, stress tests, echocardiograms (ECGs), and angiography. Despite the development of many advanced non-invasive measurement technologies in the last 100 years, the 12-lead ECG has still been widely used worldwide and become established as the de facto standard for the non-invasive assessment of a wide range of heart diseases [1]. Accessibility and affordability are the other merits of non-invasive ECGs [6]. In the 12-lead ECG, 10 electrodes are placed on the surface of the patient’s chest. The total electrical potential of the heart is then measured from 12 different points and recorded over a period (usually 10 s) [7].
The type of arrhythmia is diagnosed according to the waveform of the electrocardiogram. Correct and quick diagnosis of cardiac arrhythmias is very important for the prevention and treatment of heart diseases [6]. Misinterpretations of ECGs may lead to incorrect clinical decisions and adverse outcomes [8]. Interpretation by ECG requires sufficient expertise and training, and the observer’s knowledge directly influences the accuracy, so applying automatic diagnosis of arrhythmias using ECG signals, can be useful in preventing human errors [3,9,10]. Recently, the use of neural network and deep learning techniques, to analyze and extract features of the ECG data, has received significant attention [11,12,13].
Traditional machine learning schemes are heavily influenced by data, which requires complex preprocessing such as noise cancellation and data normalization. Additionally, they are vulnerable to over-extraction of unnecessary features, filter design, and additional trait sorting, and eventually introduce another classification algorithm [14]. A type of neural network that partially alleviates these problems is the convolutional neural network (CNN), which automatically detects important features without human supervision [15]. The convolutional neural network (CNN) is a class of artificial neural networks that has widely been used in various computer vision and machine learning applications and has received considerable attraction across a variety of medical fields, including radiology, cancer pathology, diagnosis of cardiovascular disease, etc. The CNN is constructed to learn spatial hierarchies of features automatically and adaptively [15,16] through backpropagation by using multiple building blocks, such as convolution layers, pooling layers, and fully connected layers. The CNN is also a useful tool for solving the problem of pattern recognition [17], which has wide applications such as image, sound, and signal analysis, etc.
There are several studies that used convolutional networks with various architectures for diagnosing cardiac arrhythmias by deeply learning ECG data [4,18,19,20,21,22,23,24]. In each of these studies, the adjusted convolutional network plays an important role to increase the diagnosis accuracy. The size of data used in these studies was not adequate due to limited subject records and particularly the ECG beats extracted from the same individuals. This data scarcity would reduce the generalizability of the constructed models. Furthermore, since the ECG examines heart function from different angles (leads), these leads have common and useful information that can be measured and should be included in the developed deep learning methods reported in [4,18,19,20,21,22,23,24]. In other words, it is very important to consider the structure of 12-leads ECG data, or the relationship between the leads, to better train the CNNs and thus efficiently learn about the ECG data.
The main aim of this study is to learn the lead structures and use them to increase accuracy of the diagnosis and classification of cardiac arrhythmias. Therefore, this study proposed the GCN as an effective deep learning modeling tool, which enables us to include the lead structures to enhance the accuracy of arrhythmia diagnosis and classify various types of arrhythmias.
One of the strengths of the GCNs is their ability to learn complex structures, by performing convolution operations on graphs instead of pixel images [25], which make them very effective in modeling graph-structured data [26]. A graph, as a type of data structure, consists of nodes and connections which can be used when modeling complex real-world phenomena. Unlike the CNN which should use fixed square kernels when learning the data, GCNs can use correlations between adjacent nodes and perform a flexible convolution in randomly irregular areas [27].
In this study, the ECG data collected for each person are considered as a graph and the heart leads as nodes. The shared information between the common leads data is measured with the mutual information index (MI) and the connection weights are provided to the network to improve learning performance. For the data with a complex dependence structure, the Pearson correlation indices can be used since the electrical potential records of each lead are represented as a time series and their dependencies are measured using autocorrelation indices. However, the MI can measure both linear and nonlinear relationships between two time series and calculate the common information between them using the entropy function [28]. In this study, the MI index was used to measure the correlation between leads and then construct a graph between them, which is required to effectively learn the GCN. The GCN-MI-based model constructed in this study will be then used to diagnose and classify the type of arrhythmia in individuals suffering from cardiovascular diseases.
In brief, the main contributions of this study are:
  • Representing an individual’s ECG information as a graph.
  • Using the MI index to measure the relationship of leads and structure the graph.
  • Proposing the GCN-MI, for the first time, to diagnose and classify the type of arrhythmia.
  • Examining a very recent ECG dataset with a considerably large size (at least 10,000 times larger than the datasets used in [4,18,19,20,21,22,23,24]).

2. Materials and Methods

2.1. Data

The study used a newly opened research database for 12-lead electrocardiogram signals under the supervision of Chapman University and the Public Hospital (Medical School of Zhejiang University in Shaoxing Hospital). The database’s aim is to enable the scientific community to conduct new research on arrhythmias and other cardiovascular diseases, and it contains 12 ECGs from 10,646 patients at a 500 Hz sampling rate with 11 normal rhythms and 67 additional cardiovascular diseases. The ECG samples are labeled by professionals and taken within 10 s for each person, where each ECG sample contains 5000 rows and 12 columns.
Statistically speaking, the number of samples is equal to 10,646 people whose ECG results are measured as 10,646 12-lead variable time series with 5000 points. In each variable (lead), the intensity of the electric current is recorded in 5000 turns (every 10 s).
The data included 5956 men and 4690 women, of which 17% had a normal sinus rhythm and 83% had at least one abnormality (Table 1) [5]. The relative frequency of rhythm types is shown in this dataset (Figure 1). Figure 2 shows the frequency of each rhythm by gender.

2.2. Graph Convolutional Network

2.2.1. Introduction to the GCN

Graph neural network was introduced in 2009, which is based on graph theory and forms the basis of various types of graph networks. GCNs, as one of the most popular graph networks, mainly use the combination of the Fourier transform and the Taylor expansion formula to improve filter performance, and with their excellent performance have been widely used in the classification of diseases [29]. GCNs are a group of deep neural networks that perform mathematical operations called convolution on graphs, and their purpose is to categorize graphs, nodes, or connections [30].
The graph can be represented by G = ( V ,   A ) ,   V R N × f   is the matrix of the vertex signal which displays N nodes that each have ƒ features. A R N × N   indicates the adjacency matrix that shows edge information and the relationship between nodes. If there is an edge between node i and node   j ,   A   ( i ,   j ) indicates the weight of that edge i = 1 ,   2   N , and   j = 1 ,   2   N , otherwise A   ( i ,   j ) = 0 .

2.2.2. Convolution Graph

Graph data can briefly display information on edges and vertices, in which, in order to process and learn this information, a convolutional filtering method must be considered to filter both edge and vertex information. This is a spatial approach to the graph convolution method that follows the local neighborhood graph filtering strategy.
The convolution function of a graph is based on matrix polynomials in proximity to the graph (see also Zhang et al., 2019 [25], for further details).
H = h 0 I + h 1 A 1 + h 2 A 2 + h 3 A 3 + + h k A k
This filter is defined as polynomials of the degree k of the graph adjacency matrix. A is the proximity matrix and its power represents the number of steps of a given vertex multiplied by the assumed filter coefficients. Scalar coefficients h i control the participation of neighbors of one vertex during convolution operation, so the filter matrix is obtained as H   N×N. The convolution of vertices V with filter H , defined in (1), is a matrix multiplication shown below.
V o u t = H V i n
where V o u t ,   V i n   N, V i n is the input vertex matrix and V o u t is the vertex matrix after the filter operation. Further details about how this model can be adjusted and how the convolution filter of the selected graph (i.e., H ) can be computed are provided in Appendix A.

2.2.3. The Architecture for the Proposed GCN

The first step is preparing the input graph in a way that active and inactive nodes are equated and considered equal. Additionally, a separate entry will be considered as a label next to it, and the output of this step will be entered as the graph z 0 in the next step.
In the second step, convolution operation will be performed on this graph in several layers, in a way so that the desired filter will be applied on each node according to its neighboring edge (Figure 3). This architecture shows a GCN with two layers of convection and graphs with 12 nodes. In the convolution layers, this position is indicated by red nodes at each stage. The output of the first layer of convolution z 1 is given to the second layer of the convolution, and z 2 is generated as the output of the second layer.
In the third step, a decision is made about the response variable by linearizing the created properties and delivering them to a Softmax layer. To do this, first by putting together all the created graphs from their different permutations from z 0 to z 2 , several linear vectors will be generated, and each of these vectors is called a property vector. Figure 3 displays the two steps of the concatenate operation in the third step. The output of these two stages will be a linear vector that will enter the fully connected neural network at the last level. Eventually, using this network, known as Softmax, the decision boundary will be then created.

2.3. Mutual Information

The ECG examines the heart function from different angles (leads), and these leads have common information (communication) that can be measured. This study measured this relationship using the MI index and introduced it to the GCN under the adjacency matrix.
In the following, each lead is assumed as a variable, and the method of calculating MI between two variables ( X , Y ) is explained.
Mutual information is a measure of the dependence between two variables which is the amount of information obtained by observing Y from X . MI comes from the definition of entropy. In the discrete mode, the mutual information of two variables X and Y is obtained as follows.
I ( X ;   Y )   = x X , y Y   Pr [ X   =   x , Y   =   y ] ·   log   ( Pr [ X   =   x , Y   =   y ] Pr [ X   =   x ] · Pr [ Y   =   y ] )
This can be seen as the Kullback–Leibler divergence measure between the joint distribution Pr [ X = x ,   Y = y ] and the product distribution Pr [ X = x ] .   Pr [ Y = y ] . As a result, the mutual information can similarly be expressed as the expected value, over X , of the divergence between the conditional probability Pr [ Y = y |   X = x ] and the marginal probability Pr [ Y = y ] :
I ( X ;   Y ) = x X Pr [ X   =   x ] y Y Pr [ Y   =   y | X   =   x ]   · log ( Pr [ Y   =   y | X   =   x ] Pr [ Y   =   y ] )
The mutual information is always greater than or equal to zero. In fact, if X and Y are independent, it becomes zero.
For the case that both variables X and Y are continuous, the corresponding relationships can be expressed in terms of integrals [31,32,33]. These relationships are computed and stored in the MI N × N matrix (where, N is equal to 12) for 12 ECG leads data considered in this study, using R software (R Foundation for Statistical Computing, Vienna, Austria).

2.4. Methodology

This study aimed to diagnose and classify the type of heart rhythm using a GCN with an MI proximity matrix. For this purpose, the newly opened research database of Chapman University, which has electrocardiogram signals from more than 10,000 people, was used.
The steps required to conduct the proposed method for ECG analysis and classify heart rhythm type are: (1) data collection; (2) data pre-processing; (3) model building, training, and tuning; and finally, validation and classification.
The data used in this paper were originally collected and introduced by Zheng et al. [5]. As discussed in Section 2.1, in the data collection phase, first, each subject was exposed to a 12-lead resting ECG for 10 s. The collected data were stored in a GE MUSE ECG system. Then, a licensed physician labeled the rhythms. Another licensed physician performed secondary validation. If there was a dispute, a senior physician intervened and made the final decision. The ECG data and diagnostic information from the GE MUSE system were then transferred into XML segments and encoded with a specific nomenclature defined by General Electric (GE). Finally, a conversion tool was used to extract ECG data and diagnostic information from the XML file and transfer them into CSV format [5].
In the second stage (pre-processing), the noise reduction operation was carried out. The sources of noise contamination in the ECG data, as reported in [5] and used in this study, would include power line interference, motion artifacts, electrode contact noise, baseline wandering, muscle contraction, and random noise. In order to statistically analyze the ECG data, the noise should be removed from the data.
Zhang et al. [5] proposed and implemented a sequential denoising approach for removing the noise from the raw ECG data. Since the normal range of the ECG frequency is from 0.5 to 50 Hz, a Butterworth low pass filter was used to remove the signal above 50 Hz. In order to clear the effects of baseline wandering, a LOESS smoother was then utilized. Finally, the non-local means technique was used to handle the remaining noise (see also “§. Data denoising method” and Figure 3, Figure 4 and Figure 5 presented in [5], for the details of data pre-processing steps for the dataset analyzed in this study).
The third step, which would be one the main contributions of this study, is to construct or learn a graph for each ECG by calculating the MI matrix and setting up and training the GCN network, as demonstrated in Figure 4. The details of this step are discussed below.
In order to construct the graph, a graph was first shown to each expert to show heart leads and 12 nodes represent 12 heart leads. Considering that each lead contains 5000 samples of the heart’s electrical potential, the feature matrix measures 12 × 5000. The relationship of the leads was calculated with the MI matrix and used as the adjacency matrix (12 × 12) in the GCN (Figure 4).
There are 11 rhythms in the data set, but the number of samples for 4 types of these rhythms is less than 2%, AT ( n = 121; 1.14%), AVNRT ( n = 16; 0.15%), AVRT ( n = 8; 0.07%), and SAA ( n = 7; 0.07%). Therefore, information about the other 7 rhythms was used for training and testing (10,494 people). These 7 rhythms included AF, AFIB, SI, SB, SR, ST, and SVT. In the first stage, the appropriate GCN-MI was selected, and this model was trained with 5, 10, and 15 layers. For this purpose, cross-validation methods with k = 2, 3, 4, 5-fold and leave-one-out cross-validation methods were used. These CV methods were also used to select the training and testing groups of the GCN-MI networks with 5, 10, and 15 different layers. The performance of these networks was assessed using standard evaluation criteria, such as accuracy, specificity, precision, and sensitivity, in the testing set. To select the most appropriate accuracy network, three networks were compared in pairs by t-independent test. A network was then selected, and all data were categorized by it. To evaluate this classification, a confusion matrix was prepared, and evaluation criteria were estimated.
Finally, in order to show the novelty of this article in improving the performance of the GCN-MI network in the diagnosis of arrhythmias and classifying different types of rhythms, the results were compared with those in which no structure between cardiac leads was considered. In the unstructured state, the identity matrix was considered as the adjacency matrix. The results of this study were also compared with other studies that have used different methods to diagnose arrhythmias in this dataset.
Considering true positive (TP), true negative (TN), false positive (FP), and false negative (FN), the accuracy, sensitivity, specificity, and precision, as performance criteria, of the proposed CGN-based classification method, are defined as follows:
Accuracy = TP + TN TP + TN + FP + FN
Sensitivity = TP TP + FN
Specificity = TN FP + TN
Precision = TP TP + FP

3. Experimental Results

The MI matrix was calculated using R software to measure the relationship of 12 heart leads for all individuals and was introduced as a proximity matrix in the GCN using Python software. GCN-MI-10 and GCN-MI-15 were formed to find an optimal network of GCN-MI-5 (convolution layers) and their performance was also evaluated under leave-one-out cross-validation with k = 2, 3, 4, 5. Accuracy, specificity, sensitivity, and precision indices were used to assess the performance of these networks in a test-set with cross-validation methods (Table 2). From Figure 5, it can be observed that the graph of GCN-MI-15 evaluation indicators is always higher than the other two networks. However, the t-independent test was used to assess the significance of this difference. The results, presented in Table 2 and Figure 5, showed that the accuracy of the GCN-MI-15 network for leave-one-out and for the cross-validation method with k = 2, 3, 4, 5 is significantly higher than the accuracy of GCN-MI-5 and GCN-MI-10 networks.
A statistical test was used to select the appropriate number of folds for cross-validation. The result of the t-independent test with 95% confidence showed that the accuracy of fold = 3 and 4 was higher than other selections.
However, it is obvious that adding more layers will help us to extract more features, but we should be aware of the possible overfitting by adding more layers and computational layers. Based on the above benchmark study between the accuracy and other predictive performance values of the GCN-MI with different layers, and negligible increased computational cost, the GCN-MI with 15 intermediate layers was thus selected and configured using cross-validation method and with 4 folds. In the selected spatial GCN model, for each convolution layer, as explained in Section 2.2.2, the convolution operation is performed based on matrix polynomials in proximity to the graph. The output of each layer of the convolution is given to the next layer. The parameters of the selected GCN network with 15 convolution layers and the MI adjacency matrix are shown in Table 3.
The function of the middle layers of this network was ReLU and the subordinate of the last layer was Softmax. The learning curve shows that the training accuracy is at a high level and the model fits are good. It also shows that after 600 epochs, the cross-validation accuracy converged to the training accuracy (Figure 6).
In the next step, using the tuned network, the type of rhythm of all individuals was identified and classified. The results showed that 100% of people classified by the selected network in SB were correctly identified. The results showed that the accuracy of the GCN-MI-15 network in the testing set with the cross-validation method was higher than other networks. Therefore, in the end, all data were classified by the GCN-MI network. The results showed that 99.6%, 98.1%, 99.5%, 95.5%, 92.5%, and 100% of people who were classified in SR, AFIB, ST, AF, SI, and SVT, respectively, were correctly diagnosed, and for the rest another type of arrhythmia was given. The confusion matrix shows how this classification works. The network with the identity matrix gave poor results (Figure 7).
In SB detection, this network had sensitivity, precision, specificity, and accuracy equal to 99.35%, 100%, 100%, and 99.76%, respectively, and these values for SR were equal to 98.79%, 99.61%, 99.92%, and 99.72%. The classification performance criteria result of other classes can be seen in Table 4. The results show that the sensitivity, precision, specificity, and accuracy of the GCN network with the proposed structure (MI) were considerably higher than the GCN network with the identity structure. The results also show that the overall values of sensitivity, precision, specificity, and accuracy of GCN-MI in diagnosing the type of arrhythmia are equal to 98.45%, 97.89%, 99.85%, and 99.71%, respectively. This network had the highest sensitivity (99.73%) for ST rhythm classification and the highest accuracy of 99.95% for SVT classification. Additionally, the highest precision and specificity were related to the classification of SB and SVT rhythms (100%). In contrast, the overall values of sensitivity, precision, specificity, and accuracy of GCN-Id are equal to 68.24%, 72.83%, 95.24%, and 92.68, respectively. The GCN-Id network had the highest sensitivity (90.21%) and precision (84.36%) for SB rhythm classification and the highest accuracy of 94.56 for SVT classification. Furthermore, the highest specificity was related to the classification of SI rhythms (98.05%) (Table 4).
An independent t-test was used to compare the accuracy of two GCN-MI models with the mean and standard deviation equal to 0.9971 ± 0.3210 and GCN-Id with the mean and standard deviation equal to 0.9268 ± 0.4774. The results of this test showed that the accuracy of the GCN-MI model in detecting and classifying the seven types of arrhythmias mentioned is significantly (p-value < 0.001) higher than the GCN-Id method.
The comparison of the results of the present study with other studies showed that the accuracy of the proposed method (99.71%) was higher than that of the DNN (92.24%), CNN Trees (97.60%), Meta CNN Trees (98.29%), Single Classifier (92.89%), 1-D CNN (94.01%), RNN (96.21%), XGBoost (89.40%), Teacher Model (98.96%), Student Model (98.13%), and GCN-MI (99.71%) models in arrhythmic diagnosis (Figure 8).

4. Discussion

This research aimed to distinguish and categorize different types of heart rhythms. To date, neither ECGs as a graph nor GCNs have been used directly to detect and classify cardiac arrhythmias, and this study is the first to consider the relationship of cardiac leads to the MI matrix and provide it to the network under the adjacency matrix. In this way, the new large ECG database of Chapman University was used. Our study recommended a 15-layer GCN-MI to detect and classify seven types of rhythms based on a 12-lead ECG involving more than 10,000 individuals. Comparing the evaluation indicators of the proposed network (GCN-MI) with GCN-Id showed that considering the MI index to measure the relationship between cardiac leads led to an improvement in GCN performance. The accuracy of the proposal model was 99.71%, while the accuracy of the GCN network with the identity structure was 92.68%. Many researchers, applying different sources and different approaches, have tried to create an arrhythmia detection system using a deep learning architecture.
In a similar work conducted by Zheng Jiang et al., two CNN networks and then the GCN were used to diagnose multiple cardiac disorders. The developed GCN, in this work, is used to examine the relationship between arrhythmia classes when there is more than one cardiac disorder during ECG signal collection, and binary cross-entropy loss is used for correlation between labels. As it is evident, the inter-dependency of the heart leads is neglected in this study. This could be another strength of our proposed method where each ECG is defined as a graph and directly expressed by the GCN (with inter-dependency relationships between the leads determined using MI structure) to detect and classify arrhythmia type [34].
Shaker et al. also recommended the Generative Adversarial Networks to distinguish and classify rhythm types based on 15 different classes of MIT-BIH arrhythmic datasets, in which the overall accuracy was only 98.30% [35], in comparison to 99.71% of the proposed method in this paper.
Yao et al., in 2020, introduced an ATI-CNN to detect arrhythmic type based on a multi-channel ECG signal, which included 6877 12-lead ECG records, and classified a total of 8 types of arrhythmias. This study showed that ATI-CNN reached an overall accuracy of 81.2%. Comparing to a classic 16-layer CNN called VGG-net, the accuracy increased by an average of 7.7%, and in the detection of paroxysmal arrhythmias by 26.8% [22]. In 2020, Zhao and Ban proposed a way to combine a CNN and an extreme learning machine with the aim of automatically identifying and classifying ECG signals. Data from the MIT-BIH database was used in this study, which contained 48 ECG data, and resulted in an accuracy rate of 97.50% [24].
In 2019, Gao et al., in order to accurately detect the ECG, recommended the LSTM network with FL using the data in the MIT-BIH arrhythmia database and the accuracy was 99.26% [36]. Hannun et al., in 2019, developed the DNN to classify 12 rhythm classes applying 91,232 single-lead ECGs from 53,877 patients, with an AUC (below rock curve level) of 0.97 [37]. In 2019, Oh et al. suggested a modified U-net for automatically detecting and encoding five types of ECG arrhythmias. They used the MIT-BIH arrhythmia database, and the accuracy of their recommendation system was 97.32% [38]. Li et al., in 2019, introduced a residual network (ResNet) to identify five different types of heart rhythm using a 2-lead ECG, with an accuracy of 99.38%. The data were obtained from the MIT-BIH arrhythmia database [39]. Yildirim et al., in 2018, designed a 16-layer 1D-CNN to determine 17 classes of heart rhythm, using the MIT-BIH arrhythmia database, with a network accuracy of 91.33% [40].
In 2018, utilizing the ECGs of 47 individuals from the MIT-BIH arrhythmia database, Xu et al. suggested a DNN to classify five classes of arrhythmias, with an accuracy of 93.1% [41]. Acharya et al., in 2017, using a CNN network with nine layers, with an accuracy of 94.03%, categorized the arrhythmic type into five types of arrhythmias. The data were related to the MIT-BIH arrhythmia database [42].
Several studies have proposed models for the diagnosis of arrhythmias using Chapman data also used in the present study. The accuracy of DNN [43], CNN Trees [44], Meta CNN Trees [45], Single Classifier [46], 1-D CNN [47], RNN [48], XGBoost [49], Teacher and Student [50] models was 92.24%, 97.60%, 98.29%, 92.89%, 94.01%, 96.21%, 89.40%, 98.96%, and 98.13%, respectively. While our proposed GCN-MI had a higher accuracy (99.71%) this may be due to the consideration of the structure of leads.
These studies used a limited number of subject records besides using many extracted beats from the same people. This situation can reduce the generalizability of the models, but our study used more than 10,000 people and each ECG record was obtained exclusively from one person. This set of data is available to the public, and one of its advantages is that our results are comparable to future studies on this database. None of the previous studies have considered the relationship of leads. Statistically, there is a type of linear or nonlinear correlation amongst heart leads, and calculating and using it for network training, as additional information, can be useful to categorize different types of heart rhythms.
In our study, to use this additional information, we configured the GCN and calculated the relationship amongst cardiac leads using the MI matrix and provided it to the network as the adjacency matrix for the first time. Our network accuracy is high (99.71%) and this model has a good generalization ability for detecting ECG arrhythmias. Table 5 indicates the results of these studies.

5. Conclusions

Enhancing accuracy of the diagnosis tools for cardiac arrhythmias is very important to prevent the exacerbation of disease and possibly death. In recent years, the deep learning algorithms (with various network structures) have widely been used in the automatic detection of various arrhythmia types. In order to achieve high accuracy, constructing a network structure, which includes relationship between the ECG leads, plays an important role. This study provides a novel way to consider the structure between ECG data by constructing an efficient GCN model augmented with the adjacent matrix of MI. It was then illustrated that the constructed GCN-MI is very effective in diagnosing and classifying different types of arrhythmias and is significantly more accurate than the existing methods.

Author Contributions

B.A., F.A.-M., M.S. and N.S. designed study; data were analyzed by B.A. and M.S.; B.A., F.A.-M., M.S., N.S., A.D. and A.A. contributed to original draft preparation, review, and editing. All authors have read and agreed to the published version of the manuscript.

Funding

The study was funded and supported by the Kermanshah University of Medical Sciences (Grant number: 4000903).

Institutional Review Board Statement

The study was approved by the research ethics committee of Kermanshah University of medical sciences with ID: IR.KUMS.REC.1400.726 and data were extracted from publicly available databases.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data are available at https://figshare.com/collections/ChapmanECG/4560497/2 (accessed on 25 September 2020).

Acknowledgments

The study was approved by the research deputy of Kermanshah University of medical sciences, so we appreciate all the officials of the mentioned research deputy.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Appendix A. Computation of the Convolution Filter in the GCN

The model presented for the convolution graph in Section 2.2.2 can be adjusted in three stages. First, the exponentiation of proximity matrix, A is prevented and the proximity polynomial in Equation (1) is simplified in the following linear form:
H h 0 + h 1 A
This would be useful since a large number of filters can efficiently estimate the receiving area of a larger filter.
In the next step, we then need to construct the proximity tensor A. This tensor contains several adjacency matrices A e as cuts of the adjacency tensor. Each cut encodes a specific edge feature. As a result, the linear filter matrix from (A1) can then be written as
H = h 0 I + h 1 A 1 + h 2 A 2 + + h L A L = e = 0 L h e A e .      
The adjacency matrices will be used to encode the edge features, each encodes one feature. In this study, the connection between the vertices (leads) was without direction, so the same filter was used for all adjacent vertices. Considering that this filter is used to encode the vertex feature, Equation (A2) can be modified as follows for the vertex feature c.
H c = e = 0 L h e c A e ,                                                                            
where scalar coefficients   h e c control the participation of neighbors of vertex c during the convolution operation associated with adjacency matrices A e .
Therefore, the convolution of V vertices with an H filter can be written as follows:
V o u t = c H c V i n c + b ,
where V i n c is a column of V i n containing only the feature of vertex c. We also add a bias b R . In this way, graph convolution is defined on a graph with several vertex features and edge features (see also Zhang et al., 2019 [25], for further details about computing the convolution filter for the GCN model).

References

  1. Pereira, H.; Niederer, S.; Rinaldi, C.A. Electrocardiographic imaging for cardiac arrhythmias and resynchronization therapy. Europace 2020, 22, 1447–1462. [Google Scholar] [CrossRef] [PubMed]
  2. Shomanova, Z.; Ohnewein, B.; Schernthaner, C.; Höfer, K.; Pogoda, C.A.; Frommeyer, G.; Wernly, B.; Brandt, M.C.; Dieplinger, A.-M.; Reinecke, H.; et al. Classic and Novel Biomarkers as Potential Predictors of Ventricular Arrhythmias and Sudden Cardiac Death. J. Clin. Med. 2020, 9, 578. [Google Scholar] [CrossRef] [PubMed]
  3. Xie, L.; Li, Z.; Zhou, Y.; He, Y.; Zhu, J. Computational Diagnostic Techniques for Electrocardiogram Signal Analysis. Sensors 2020, 20, 6318. [Google Scholar] [CrossRef]
  4. Murat, F.; Yildirim, O.; Talo, M.; Baloglu, U.B.; Demir, Y.; Acharya, U.R. Application of deep learning techniques for heartbeats detection using ECG signals-analysis and review. Comput. Biol. Med. 2020, 120, 103726. [Google Scholar] [CrossRef]
  5. Zheng, J.; Zhang, J.; Danioko, S.; Yao, H.; Guo, H.; Rakovski, C. A 12-lead electrocardiogram database for arrhythmia research covering more than 10,000 patients. Sci. Data 2020, 7, 48. [Google Scholar] [CrossRef] [PubMed]
  6. Nielsen, J.C.; Lin, Y.J.; de Oliveira Figueiredo, M.J.; Sepehri Shamloo, A.; Alfie, A.; Boveda, S.; Dagres, N.; Di Toro, D.; Eckhardt, L.L.; Ellenbogen, K.; et al. European Heart Rhythm Association (EHRA)/Heart Rhythm Society (HRS)/Asia Pacific Heart Rhythm Society (APHRS)/Latin American Heart Rhythm Society (LAHRS) expert consensus on risk assessment in cardiac arrhythmias: Use the right tool for the right outcome, in the right population. Europace 2020, 22, 1147–1148. [Google Scholar] [PubMed]
  7. Baty, F. Special Issue: ECG Monitoring System. Sensors 2021, 21, 651. [Google Scholar] [CrossRef] [PubMed]
  8. Viljoen, C.A.; Millar, R.S.; Manning, K.; Burch, V.C. Effectiveness of blended learning versus lectures alone on ECG analysis and interpretation by medical students. BMC Med. Educ. 2020, 20, 488. [Google Scholar] [CrossRef]
  9. Baloglu, U.B.; Talo, M.; Yildirim, O.; San Tan, R.; Acharya, U.R. Classification of myocardial infarction with multi-lead ECG signals and deep CNN. Pattern Recognit. Lett. 2019, 122, 23–30. [Google Scholar] [CrossRef]
  10. Gliner, V.; Keidar, N.; Makarov, V.; Avetisyan, A.I.; Schuster, A.; Yaniv, Y. Automatic classification of healthy and disease conditions from images or digital standard 12-lead electrocardiograms. Sci. Rep. 2020, 10, 16331. [Google Scholar] [CrossRef]
  11. Kwon, J.-m.; Kim, K.-H.; Jeon, K.-H.; Lee, S.Y.; Park, J.; Oh, B.-H. Artificial intelligence algorithm for predicting cardiac arrest using electrocardiography. Scand. J. Trauma Resusc. Emerg. Med. 2020, 28, 98. [Google Scholar] [CrossRef]
  12. Cho, Y.; Kwon, J.M.; Kim, K.H.; Medina-Inojosa, J.R.; Jeon, K.H.; Cho, S.; Lee, S.Y.; Park, J.; Oh, B.H. Artificial intelligence algorithm for detecting myocardial infarction using six-lead electrocardiography. Sci. Rep. 2020, 10, 20495. [Google Scholar] [CrossRef] [PubMed]
  13. Salari, N.; Shohaimi, S.; Najafi, F.; Nallappan, M.; Karishnarajah, I. Application of pattern recognition tools for classifying acute coronary syndrome: An integrated medical modeling. Theor. Biol. Med. Model. 2013, 10, 57. [Google Scholar] [CrossRef] [PubMed]
  14. Gao, X. Diagnosing abnormal electrocardiogram (ECG) via deep learning. In Electrocardiography; IntechOpen: London, UK, 2019. [Google Scholar]
  15. Yamashita, R.; Nishio, M.; Do, R.K.G.; Togashi, K. Convolutional neural networks: An overview and application in radiology. Insights Imaging 2018, 9, 611–629. [Google Scholar] [CrossRef] [PubMed]
  16. Toğaçar, M.; Ergen, B.; Cömert, Z. Detection of lung cancer on chest CT images using minimum redundancy maximum relevance feature selection method with convolutional neural networks. Biocybern. Biomed. Eng. 2020, 40, 23–39. [Google Scholar] [CrossRef]
  17. Valueva, M.V.; Nagornov, N.; Lyakhov, P.A.; Valuev, G.V.; Chervyakov, N.I. Application of the residue number system to reduce hardware costs of the convolutional neural network implementation. Math. Comput. Simul. 2020, 177, 232–243. [Google Scholar] [CrossRef]
  18. Rim, B.; Sung, N.-J.; Min, S.; Hong, M. Deep Learning in Physiological Signal Data: A Survey. Sensors 2020, 20, 969. [Google Scholar] [CrossRef]
  19. Huerta Herraiz, Á.; Martínez-Rodrigo, A.; Bertomeu-González, V.; Quesada, A.; Rieta, J.J.; Alcaraz, R. A Deep Learning Approach for Featureless Robust Quality Assessment of Intermittent Atrial Fibrillation Recordings from Portable and Wearable Devices. Entropy 2020, 22, 733. [Google Scholar] [CrossRef]
  20. Silva, P.; Luz, E.; Silva, G.; Moreira, G.; Wanner, E.; Vidal, F.; Menotti, D. Towards better heartbeat segmentation with deep learning classification. Sci. Rep. 2020, 10, 20701. [Google Scholar] [CrossRef]
  21. Belo, D.; Bento, N.; Silva, H.; Fred, A.; Gamboa, H. ECG Biometrics Using Deep Learning and Relative Score Threshold Classification. Sensors 2020, 20, 4078. [Google Scholar] [CrossRef]
  22. Yao, Q.; Wang, R.; Fan, X.; Liu, J.; Li, Y. Multi-class Arrhythmia detection from 12-lead varied-length ECG using Attention-based Time-Incremental Convolutional Neural Network. Inf. Fusion 2020, 53, 174–182. [Google Scholar] [CrossRef]
  23. Panda, R.; Jain, S.; Tripathy, R.; Acharya, U.R. Detection of shockable ventricular cardiac arrhythmias from ECG signals using FFREWT filter-bank and deep convolutional neural network. Comput. Biol. Med. 2020, 124, 103939. [Google Scholar] [CrossRef] [PubMed]
  24. Zhou, S.; Tan, B. Electrocardiogram soft computing using hybrid deep learning CNN-ELM. Appl. Soft Comput. 2020, 86, 105778. [Google Scholar] [CrossRef]
  25. Zhang, S.; Tong, H.; Xu, J.; Maciejewski, R. Graph convolutional networks: A comprehensive review. Comput. Soc. Netw. 2019, 6, 11. [Google Scholar] [CrossRef]
  26. Jin, H.; Shi, Z.; Peruri, V.J.S.A.; Zhang, X. Certified Robustness of Graph Convolution Networks for Graph Classification under Topological Attacks. Adv. Neural Inf. Process. 2020, 33, 8463–8474. [Google Scholar]
  27. Liu, Q.; Xiao, L.; Yang, J.; Wei, Z. CNN-enhanced graph convolutional network with pixel-and superpixel-level feature fusion for hyperspectral image classification. IEEE Trans. Geosci. Remote Sens. 2020, 59, 8657–8671. [Google Scholar] [CrossRef]
  28. Mohammadi, S.; Azemi, G. Phase synchrony detection in multichannel newborn EEG signals using a mutual information based method. IJBME 2015, 9, 215–227. [Google Scholar]
  29. Liang, X.; Zhang, Y.; Wang, J.; Ye, Q.; Liu, Y.; Tong, J. Diagnosis of COVID-19 Pneumonia Based on Graph Convolutional Network. Front. Med. 2021, 7, 1071. [Google Scholar] [CrossRef]
  30. Wu, Z.; Pan, S.; Chen, F.; Long, G.; Zhang, C.; Philip, S.Y. A comprehensive survey on graph neural networks. IEEE Trans. Geosci. Remote Sens. 2021, 32, 4–24. [Google Scholar] [CrossRef]
  31. Batina, L.; Gierlichs, B.; Prouff, E.; Rivain, M.; Standaert, F.-X.; Veyrat-Charvillon, N. Mutual information analysis: A comprehensive study. J. Cryptol. 2011, 24, 269–291. [Google Scholar] [CrossRef]
  32. Veyrat-Charvillon, N.; Standaert, F.-X. (Eds.) Mutual Information Analysis: How, When and Why? In Proceedings of the 11th International Workshop, Lausanne, Switzerland, 6–9 September 2009; pp. 429–443. [Google Scholar]
  33. Whitnall, C.; Oswald, E. (Eds.) A comprehensive evaluation of mutual information analysis using a fair evaluation framework. In Proceedings of the 31st Annual Cryptology Conference, Santa Barbara, CA, USA, 14–18 August 2011; pp. 316–334. [Google Scholar]
  34. Jiang, Z.; Almeida, T.P.; Schlindwein, F.S.; Ng, G.A.; Zhou, H.; Li, X. (Eds.) Diagnostic of multiple cardiac disorders from 12-lead ECGs using Graph Convolutional Network based multi-label classification. In Proceedings of the 2020 Computing in Cardiology, Rimini, Italy, 13–16 September 2020. [Google Scholar]
  35. Shaker, A.M.; Tantawi, M.; Shedeed, H.A.; Tolba, M.F. Generalization of convolutional neural networks for ECG classification using generative adversarial networks. IEEE Access 2020, 8, 35592–35605. [Google Scholar] [CrossRef]
  36. Gao, J.; Zhang, H.; Lu, P.; Wang, Z. An effective LSTM recurrent network to detect arrhythmia on imbalanced ECG dataset. J. Healthc. Eng. 2019, 13, 6320651. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  37. Hannun, A.Y.; Rajpurkar, P.; Haghpanahi, M.; Tison, G.H.; Bourn, C.; Turakhia, M.P.; Ng, A.Y. Cardiologist-level arrhythmia detection and classification in ambulatory electrocardiograms using a deep neural network. Nat. Med. 2019, 25, 65–69. [Google Scholar] [CrossRef]
  38. Oh, S.L.; Ng, E.Y.; San Tan, R.; Acharya, U.R. Automated beat-wise arrhythmia diagnosis using modified U-net on extended electrocardiographic recordings with heterogeneous arrhythmia types. Comput. Biol. Med. 2019, 105, 92–101. [Google Scholar] [CrossRef] [PubMed]
  39. Li, Z.; Zhou, D.; Wan, L.; Li, J.; Mou, W. Heartbeat classification using deep residual convolutional neural network from 2-lead electrocardiogram. J. Electrocardiol. 2020, 58, 105–112. [Google Scholar] [CrossRef]
  40. Yıldırım, Ö.; Pławiak, P.; Tan, R.-S.; Acharya, U.R. Arrhythmia detection using deep convolutional neural network with long duration ECG signals. Comput. Biol. Med. 2018, 102, 411–420. [Google Scholar] [CrossRef] [PubMed]
  41. Xu, S.S.; Mak, M.-W.; Cheung, C.-C. Towards end-to-end ECG classification with raw signal extraction and deep neural networks. IEEE J. Biomed. Health Inform. 2018, 23, 1574–1584. [Google Scholar] [CrossRef]
  42. Acharya, U.R.; Oh, S.L.; Hagiwara, Y.; Tan, J.H.; Adam, M.; Gertych, A.; San Tan, R. A deep convolutional neural network model to classify heartbeats. Comput. Biol. Med. 2017, 89, 389–396. [Google Scholar] [CrossRef]
  43. Yildirim, O.; Talo, M.; Ciaccio, E.J.; Tan, R.S.; Acharya, U.R. Accurate deep neural network model to detect cardiac arrhythmia on more than 10,000 individual subject ECG records. Comput. Methods Programs Biomed. 2020, 197, 105740. [Google Scholar] [CrossRef]
  44. Meqdad, M.N.; Abdali-Mohammadi, F.; Kadry, S. A New 12-Lead ECG Signals Fusion Method Using Evolutionary CNN Trees for Arrhythmia Detection. Mathematics 2022, 10, 1911. [Google Scholar] [CrossRef]
  45. Meqdad, M.N.; Abdali-Mohammadi, F.; Kadry, S. Meta Structural Learning Algorithm with Interpretable Convolutional Neural Networks for Arrhythmia Detection of Multi-Session ECG. IEEE Access 2022, 10, 61410–61425. [Google Scholar] [CrossRef]
  46. Mehari, T.; Strodthoff, N. Self-supervised representation learning from 12-lead ECG data. Comput. Biol. Med. 2022, 141, 105114. [Google Scholar] [CrossRef]
  47. Rahul, J.; Sharma, L.D. Automatic cardiac arrhythmia classification based on hybrid 1-D CNN and Bi-LSTM model. Biocybern. Biomed. Eng. 2022, 42, 312–324. [Google Scholar] [CrossRef]
  48. Kang, J.; Wen, H. A study on several critical problems on arrhythmia detection using varying-dimensional electrocardiography. Physiol. Meas. 2022, 43, 064007. [Google Scholar] [CrossRef] [PubMed]
  49. Domazetoski, V.; Gligoric, G.; Marinkovic, M.; Shvilkin, A.; Krsic, J.; Kocarev, L.; Ivanovic, M.D. The influence of atrial flutter in automated detection of atrial arrhythmias-are we ready to go into clinical practice? Comput. Methods Programs Biomed. 2022, 221, 106901. [Google Scholar] [CrossRef]
  50. Sepahvand, M.; Abdali-Mohammadi, F. A novel method for reducing arrhythmia classification from 12-lead ECG signals to single-lead ECG with minimal loss of accuracy through teacher-student knowledge distillation. Inf. Sci. 2022, 593, 64–77. [Google Scholar] [CrossRef]
Figure 1. The distribution rate graph of rhythm classes across all records.
Figure 1. The distribution rate graph of rhythm classes across all records.
Ijerph 19 10707 g001
Figure 2. Frequency of rhythm by sex.
Figure 2. Frequency of rhythm by sex.
Ijerph 19 10707 g002
Figure 3. The network architecture for the GCN with two layers of convolution.
Figure 3. The network architecture for the GCN with two layers of convolution.
Ijerph 19 10707 g003
Figure 4. The proposed methodology and required materials for this study.
Figure 4. The proposed methodology and required materials for this study.
Ijerph 19 10707 g004
Figure 5. The performance values (including Accuracy, Sensitivity, Specificity and Precision) for GCN-MI-5, GCN-MI-10, and GCN-MI-15 using various k-fold CVs, are illustrated in subfigures (ad), respectively.
Figure 5. The performance values (including Accuracy, Sensitivity, Specificity and Precision) for GCN-MI-5, GCN-MI-10, and GCN-MI-15 using various k-fold CVs, are illustrated in subfigures (ad), respectively.
Ijerph 19 10707 g005
Figure 6. Learning curve for the GCN-MI with 15 layers.
Figure 6. Learning curve for the GCN-MI with 15 layers.
Ijerph 19 10707 g006
Figure 7. Confusion matrix for all records using GCN-MI and GCN-Id.
Figure 7. Confusion matrix for all records using GCN-MI and GCN-Id.
Ijerph 19 10707 g007
Figure 8. Comparison of deep learning models for arrhythmic diagnosis using the Chapman dataset.
Figure 8. Comparison of deep learning models for arrhythmic diagnosis using the Chapman dataset.
Ijerph 19 10707 g008
Table 1. Rhythm information and basic characteristics of the participants.
Table 1. Rhythm information and basic characteristics of the participants.
Acronym
Name
Full NameFrequency, n (%)Age, Mean ± SDMale, n (%)
SBSinus Bradycardia3889 (36.53)58.34 ± 13.952481 (58.48%)
SRSinus Rhythm1826 (17.15)54.35 ± 16.331024 (56.08%)
AFIBAtrial Fibrillation1780 (16.72)73.36 ± 11.141041 (58.48%)
STSinus Tachycardia1568 (14.73)54.57 ± 21.06799 (50.96%)
AFAtrial Flutter445 (4.18)71.07 ± 13.5257 (57.75%)
SISinus Irregularity399 (3.75)34.75 ± 23.03223 (55.89%)
SVTSupraventricular Tachycardia587 (5.51)55.62 ± 18.53308 (52.47%)
ATAtrial Tachycardia121 (1.14)65.72 ± 19.364 (52.89%)
AVNRTAtrioventricular Node Reentrant Tachycardia16 (0.15)57.88 ± 17.3412 (75%)
AVRTAtrioventricular Reentrant Tachycardia8 (0.07)57.5 ± 16.845 (62.5%)
SAASinus Atrium to Atrial Wandering Rhythm7 (0.07)51.14 ± 31.836 (85.71%)
All 10,646 (100)51.19 ± 18.035956 (55.95%)
Table 2. The performance values for GCN-MI-5, GCN-MI-10, and GCN-MI-15 in the testing set with the k-fold cross-validation method.
Table 2. The performance values for GCN-MI-5, GCN-MI-10, and GCN-MI-15 in the testing set with the k-fold cross-validation method.
Accuracy (%)Sensitivity (%)Specificity (%)Precision (%)
GCN-MIGCN-MIGCN-MIGCN-MI
5
Layer
10
Layer
15
Layer
5
Layer
10
Layer
15
Layer
5
Layer
10
Layer
15
Layer
5
Layer
10
Layer
15
Layer
Leave-one-out96.5796.8299.3995.7695.3299.2298.7899.6610095.0897.6899.94
k = 298.5397.4099.6399.8196.0310098.9299.8210097.6998.85100
k = 396.9398.5699.8395.4096.0699.1597.7010010097.0998.5099.98
k = 496.8396.3999.8396.1296.3099.7699.9499.7910097.5394.7599.11
k = 596.9696.6399.2495.3497.8798.5299.4699.3910095.5597.9798.87
Table 3. The parameter values of the fitted GCN-MI network with 15 layers.
Table 3. The parameter values of the fitted GCN-MI network with 15 layers.
ParameterValue
Learning Rate0.02
Epochs600
Hidden layers15
Dropout0.2
Weight Decay10,000
Early Stopping10
Table 4. The performance values for all records separately for each class using GCN-MI and GCN-Id.
Table 4. The performance values for all records separately for each class using GCN-MI and GCN-Id.
Sensitivity Precision Specificity Accuracy
SBGCN-MI99.3510010099.76
GCN-Id90.2184.3689.0289.49
SRGCN-MI98.7999.6199.9299.72
GCN-Id81.4379.7394.8092.12
AFIBGCN-MI98.8898.1099.6199.48
GCN-Id78.1472.9293.4890.67
STGCN-MI99.4399.5599.9299.85
GCN-Id83.8879.6595.6293.62
AFGCN-MI94.8395.4799.8099.59
GCN-Id42.8864.2798.0393.83
SIGCN-MI98.7592.4999.6899.65
GCN-Id)42.8060.4098.0594.47
SVTGCN-MI99.1510010099.95
GCN-Id58.3468.4897.6894.56
OverallGCN-MI98.4597.8999.8599.71
GCN-Id68.2472.8395.2492.68
Table 5. Performance comparison of the proposed method with other state-of-the-art methods.
Table 5. Performance comparison of the proposed method with other state-of-the-art methods.
Refs.StudyDatasetNum.
of Subjects
YearMethodClassesPerformance
[34]Jiang et al.PhysioNet/CinC Challenge 20205122022CNN+GCN9F-Score = 0.603
[35]Shaker et al.MIT-BIH472020GAN15Acc = 98.30%
[22]Yao et al.--2020ATI-CNN8Acc = 81.2%
[24]Zhao & TanMIT-BIH472020CNN+ELM4Acc = 97.5%
[36]Gao et al.MIT-BIH472019LSTM, FL8Acc = 99.26%
[37]Hannun et al.-535492019DNN12AUC = 97%
[38]Oh et al.MIT-BIH472019Modified U-net5Acc = 97.32%
[39]Li et al.MIT-BIH472019ResNet5Acc = 99.38%
[40]Yildirim et al.MIT-BIH472018CNN17Acc = 91.33%
[41]Xu et al.MIT-BIH472018DNN5Acc = 93.1%
[42]Acharya et al.MIT-BIH472017CNN5Acc = 94.03%
[43]Yildirim et al.Chapman10,5882020DNN4Acc = 96.13%
10,4367Acc = 92.24%
[44]Meqdad et al.Chapman10,6462022CNN Trees7Acc = 97.60%
[45]Meqdad et al.Chapman10,6462022Meta CNN Trees7Acc = 98.29%
[46]Mehari et al.Chapman10,6462022Single Classifier7Acc = 92.89%
[47]Rahul et al.Chapman10,64620221-D CNN7Acc = 94.01%
[48]Kang et al.Chapman10,6462022RNN7Acc = 96.21%
[49]Domazetoski et al.Chapman10,6462022XGBoost-Acc = 89.40%
[50]Sepahvand et al.Chapman10,6462022Teacher model7Acc = 98.96%
Student model7Acc = 98.13%
ProposedChapman10,4942022GCN-MI7Acc = 99.71%
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Andayeshgar, B.; Abdali-Mohammadi, F.; Sepahvand, M.; Daneshkhah, A.; Almasi, A.; Salari, N. Developing Graph Convolutional Networks and Mutual Information for Arrhythmic Diagnosis Based on Multichannel ECG Signals. Int. J. Environ. Res. Public Health 2022, 19, 10707. https://doi.org/10.3390/ijerph191710707

AMA Style

Andayeshgar B, Abdali-Mohammadi F, Sepahvand M, Daneshkhah A, Almasi A, Salari N. Developing Graph Convolutional Networks and Mutual Information for Arrhythmic Diagnosis Based on Multichannel ECG Signals. International Journal of Environmental Research and Public Health. 2022; 19(17):10707. https://doi.org/10.3390/ijerph191710707

Chicago/Turabian Style

Andayeshgar, Bahare, Fardin Abdali-Mohammadi, Majid Sepahvand, Alireza Daneshkhah, Afshin Almasi, and Nader Salari. 2022. "Developing Graph Convolutional Networks and Mutual Information for Arrhythmic Diagnosis Based on Multichannel ECG Signals" International Journal of Environmental Research and Public Health 19, no. 17: 10707. https://doi.org/10.3390/ijerph191710707

APA Style

Andayeshgar, B., Abdali-Mohammadi, F., Sepahvand, M., Daneshkhah, A., Almasi, A., & Salari, N. (2022). Developing Graph Convolutional Networks and Mutual Information for Arrhythmic Diagnosis Based on Multichannel ECG Signals. International Journal of Environmental Research and Public Health, 19(17), 10707. https://doi.org/10.3390/ijerph191710707

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop