ECG Classification Combining Conventional Signal Analysis, Random Forests and Neural Networks - a Stacked Learning Scheme

Martin Baumgartner, M. Kropf, L. Haider, S. Veeranki, D. Hayn, G. Schreier
{"title":"ECG Classification Combining Conventional Signal Analysis, Random Forests and Neural Networks - a Stacked Learning Scheme","authors":"Martin Baumgartner, M. Kropf, L. Haider, S. Veeranki, D. Hayn, G. Schreier","doi":"10.23919/cinc53138.2021.9662777","DOIUrl":null,"url":null,"abstract":"This year's Physionet Challenge focused on the question how many leads are required to develop a high-quality ECG classification algorithm. We (team name: easyG) propose a stacked learning scheme combining conventional signal analysis, random forests and neural networks. Highly specialized regression random forest models were trained with classical ECG processing where features were derived for each channel of each signal. The outputs were then used in a neural network to achieve a 1D regression vector, which was used to optimize classification thresholds. We present offline validation results for each lead set and class-specific classification scores to allow for insights into the question how many leads are sufficient. Due to technical issues, we only achieved a score of -0.46 (all-lead) in the official leaderboard (rank 37). We have found that lead reduction leads to a minor loss in overall performance. However, variation in class-specific performance with lead reduction exists. Some classes were recognized better with more leads, but in rare cases, the opposite was true. The results suggest that the optimal number of used channels is depending on the setting and goals of the classification.","PeriodicalId":126746,"journal":{"name":"2021 Computing in Cardiology (CinC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Computing in Cardiology (CinC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/cinc53138.2021.9662777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This year's Physionet Challenge focused on the question how many leads are required to develop a high-quality ECG classification algorithm. We (team name: easyG) propose a stacked learning scheme combining conventional signal analysis, random forests and neural networks. Highly specialized regression random forest models were trained with classical ECG processing where features were derived for each channel of each signal. The outputs were then used in a neural network to achieve a 1D regression vector, which was used to optimize classification thresholds. We present offline validation results for each lead set and class-specific classification scores to allow for insights into the question how many leads are sufficient. Due to technical issues, we only achieved a score of -0.46 (all-lead) in the official leaderboard (rank 37). We have found that lead reduction leads to a minor loss in overall performance. However, variation in class-specific performance with lead reduction exists. Some classes were recognized better with more leads, but in rare cases, the opposite was true. The results suggest that the optimal number of used channels is depending on the setting and goals of the classification.
结合传统信号分析、随机森林和神经网络的心电分类——一种堆叠学习方案
今年的Physionet挑战赛关注的问题是,开发高质量的心电分类算法需要多少导联。我们(团队名称:easyG)提出了一种结合传统信号分析、随机森林和神经网络的堆叠学习方案。高度专门化的回归随机森林模型与经典的心电处理训练,其中每个信号的每个通道都衍生出特征。然后将输出用于神经网络以获得一维回归向量,该回归向量用于优化分类阈值。我们提供了每个线索集的离线验证结果和特定类别的分类分数,以便深入了解多少线索是足够的问题。由于技术问题,我们在官方排行榜(第37名)上只获得了-0.46分(全领先)。我们发现铅的减少会导致整体性能的轻微损失。然而,随着铅的减少,班级的具体表现存在差异。一些班级被更多的领导更好地识别,但在极少数情况下,情况正好相反。结果表明,使用通道的最佳数量取决于分类的设置和目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信