Interpretable Tsetlin Machine-based Premature Ventricular Contraction Identification
Not on the map. Why?
Abstract (arXiv)
Neural network-based models have found wide use in automatic long-term electrocardiogram (ECG) analysis. However, such black box models are inadequate for analysing physiological signals where credibility and interpretability are crucial. Indeed, how to make ECG analysis transparent is still an open problem. In this study, we develop a Tsetlin machine (TM) based architecture for premature ventricular contraction (PVC) identification by analysing long-term ECG signals. The architecture is transparent by describing patterns directly with logical AND rules. To validate the accuracy of our approach, we compare the TM performance with those of convolutional neural networks (CNNs). Our numerical results demonstrate that TM provides comparable performance with CNNs on the MIT-BIH database. To validate interpretability, we provide explanatory diagrams that show how TM makes the PVC identification from confirming and invalidating patterns. We argue that these are compatible with medical knowledge so that they can be readily understood and verified by a medical doctor. Accordingly, we believe this study paves the way for machine learning (ML) for ECG analysis in clinical practice.
Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Builds on 10 of its 46 references that are in the map. First posted on arXiv 20 Jan 2023.
Builds on
10 of 46 references.
References · 10
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,223
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,321
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,713
- 2018The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logiccited by 72
- 2020On the Convergence of Tsetlin Machines for the IDENTITY- and NOT Operatorscited by 23
- 2020Massively Parallel and Asynchronous Tsetlin Machine Architecture Supporting Almost Constant-Time Scalingcited by 20
- 2021On the Convergence of Tsetlin Machines for the XOR Operatorcited by 16
- 2021Enhancing Interpretable Clauses Semantically using Pretrained Word Representationcited by 10
- 2022Tsetlin Machine for Solving Contextual Bandit Problemscited by 10
- 2021On the Convergence of Tsetlin Machines for the AND and the OR Operatorscited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.