Deep learning and neural architecture search for cardiac arrhythmias classification
Notice bibliographique
Résumé
Cardiovascular disease (CVD) is the primary cause of mortality worldwide. Among people with CVD, cardiac arrhythmias (changes in the natural rhythm of the heart), are a leading cause of death. The clinical routine for arrhythmia diagnosis includes acquiring an electrocardiogram (ECG) and manually reviewing the ECG trace to identify the arrhythmias. However, due to the varying expertise level of clinicians, accurate diagnosis of arrhythmias with similar visual characteristics (that naturally exists in some different types of arrhythmias) can be challenging for some front-line clinicians. In addition, there is a shortage of trained cardiologists globally, and especially in remote areas of Australia, where patients are sometimes required to wait for weeks or months for a visiting cardiologist. This impacts the timely care of patients living in remote areas. Therefore, developing an AI-based model, that assists clinicians in accurate real-time decision-making, is an essential task. This thesis provides supporting evidence that the problem of delayed and/or inaccurate cardiac arrhythmias diagnosis can be addressed by designing accurate deep learning models through Neural Architecture Search (NAS). These models can automatically differentiate different types of arrhythmias in a timely manner. Many different deep learning models and more specifically, Convolutional Neural Networks (CNNs) have been developed for automatic and accurate cardiac arrhythmias detection. However, these models are heavily hand-crafted which means designing an accurate model for a given task, requires significant trial and error. In this thesis, the process of designing an accurate CNN model for 1-dimensional biomedical data classification is automated by applying NAS techniques. NAS is a recent research paradigm in which the process of designing an accurate model (for a given task) is automated by employing a search algorithm over a pre-defined search space of possible operations in a deep learning model. In this thesis, we developed a CNN model for detection of ‘Atrial Fibrillation’ (AF) among ‘normal sinus rhythm’, ‘noise’, and ‘other arrhythmias. This model is designed by employing a well-known NAS method, Efficient Neural Architecture Search (ENAS) which uses Reinforcement Learning (RL) to perform a search over common operations in a CNN structure. This CNN model outperformed state-of-the-art deep learning models for AF detection while minimizing human intervention in CNN structure design. In order to reduce the high computation time that was required by ENAS (and typically by RL-based NAS), in this thesis, a recent NAS method called DARTS was utilized to design a CNN model for accurate diagnosis of a wider range of cardiac arrhythmias. This method employs Stochastic Gradient Descent (SGD) to perform the search procedure over a continuous and therefore differentiable search space. The search space (operations and building blocks) of DARTS was tailored to implement the search procedure over a public dataset of standard 12-lead ECG recordings containing 111 types of arrhythmias (released by the PhysioNet challenge, 2020). The performance of DARTS was further studied by utilizing it to differentiate two major sub-types of Wide QRS Complex Tachycardia (Ventricular Tachycardia- VT vs Supraventricular Tachycardia- SVT). These sub-types have similar visual characteristics, which makes differentiating between them challenging, even for experienced clinicians. This dataset is a unique collection of Wide Complex Tachycardia (WCT) recordings, collected by our medical collaborator (University of Ottawa heart institute) over the course of 11 years. The DARTS-derived model achieved 91% accuracy, outperforming cardiologists (77% accuracy) and state-of-the-art deep learning models (88% accuracy). Lastly, the efficacy of the original DARTS algorithm for the image classification task is empirically studied. Our experiments showed that the performance of the DARTS search algorithm does not deteriorate over the search course; however, the search procedure can be terminated earlier than what was designated in the original algorithm. In addition, the accuracy of the derived model could be further improved by modifying the original search operations (excluding the zero operation), making it highly valuable in a clinical setting.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,000 |
| Bibliométrie | 0,001 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,002 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,001 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».