多目标多优化集成二值优化算法用于ecg识别的最优特征集识别

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Mamata Pandey, Anup Kumar Keshri
{"title":"多目标多优化集成二值优化算法用于ecg识别的最优特征集识别","authors":"Mamata Pandey,&nbsp;Anup Kumar Keshri","doi":"10.1016/j.asoc.2025.113556","DOIUrl":null,"url":null,"abstract":"<div><div>Reducing the number of input features for a machine learning model decreases its complexity and computation time. However, it is crucial to choose the best set of features without compromising the model's performance. There could be several subsets of features with optimal behavior. Evolutionary algorithms are great for feature optimization. However, different evolutionary algorithms may produce different solutions, and their performance is influenced by the size of the data and the types of features. To address these issues, three popular algorithms, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Binary Differential Evolution (BDE) have been adapted to accommodate multiple populations for achieving multiple optima. The BDE algorithm applied here is a novel variant with modified mutation and crossover operators. Then they are combined to create a novel 'Multi-Objective Multi-Optima Ensemble Binary Optimization Algorithm. The algorithm has been tested on 71 fiducial ECG features including temporal, amplitude, distance, slope, angular, and HRV features for ECG-based identification. These 71 features can identify individuals using the SVM classifier with 98 % accuracy. With 71 features, there could be a maximum of <span><math><msup><mrow><mn>2</mn></mrow><mrow><mn>71</mn></mrow></msup></math></span> subsets. The optimization objective is to find all feature subsets that maximize classifier accuracy while minimizing the number of features. The ensemble optimizer has found 190 unique optimized subsets. These subsets have been analyzed to identify critical features for identification. The most optimal subset with the minimum number of features and maximum accuracy has been identified. The practical implementation of an ECG-based identification system requires an efficient system that can process incoming signals, extract features from the signal, and identify individuals in the shortest time possible. To speed up the processing of the input signal, a novel DFA-based algorithm has been proposed to identify fiducial points P, Q, R, S, and T from an ECG signal. The proposed algorithm applies to both recorded and live ECG signals.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"182 ","pages":"Article 113556"},"PeriodicalIF":7.2000,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-objective multi-optima ensemble binary optimization algorithm for identifying optimal set of features for ECG-based identification\",\"authors\":\"Mamata Pandey,&nbsp;Anup Kumar Keshri\",\"doi\":\"10.1016/j.asoc.2025.113556\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Reducing the number of input features for a machine learning model decreases its complexity and computation time. However, it is crucial to choose the best set of features without compromising the model's performance. There could be several subsets of features with optimal behavior. Evolutionary algorithms are great for feature optimization. However, different evolutionary algorithms may produce different solutions, and their performance is influenced by the size of the data and the types of features. To address these issues, three popular algorithms, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Binary Differential Evolution (BDE) have been adapted to accommodate multiple populations for achieving multiple optima. The BDE algorithm applied here is a novel variant with modified mutation and crossover operators. Then they are combined to create a novel 'Multi-Objective Multi-Optima Ensemble Binary Optimization Algorithm. The algorithm has been tested on 71 fiducial ECG features including temporal, amplitude, distance, slope, angular, and HRV features for ECG-based identification. These 71 features can identify individuals using the SVM classifier with 98 % accuracy. With 71 features, there could be a maximum of <span><math><msup><mrow><mn>2</mn></mrow><mrow><mn>71</mn></mrow></msup></math></span> subsets. The optimization objective is to find all feature subsets that maximize classifier accuracy while minimizing the number of features. The ensemble optimizer has found 190 unique optimized subsets. These subsets have been analyzed to identify critical features for identification. The most optimal subset with the minimum number of features and maximum accuracy has been identified. The practical implementation of an ECG-based identification system requires an efficient system that can process incoming signals, extract features from the signal, and identify individuals in the shortest time possible. To speed up the processing of the input signal, a novel DFA-based algorithm has been proposed to identify fiducial points P, Q, R, S, and T from an ECG signal. The proposed algorithm applies to both recorded and live ECG signals.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"182 \",\"pages\":\"Article 113556\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625008671\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625008671","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

减少机器学习模型的输入特征数量可以降低其复杂性和计算时间。然而,在不影响模型性能的情况下选择最佳的特征集是至关重要的。可能有几个具有最佳行为的特征子集。进化算法对于特征优化非常有用。然而,不同的进化算法可能产生不同的解决方案,其性能受到数据大小和特征类型的影响。为了解决这些问题,三种流行的算法,遗传算法(GA),粒子群优化(PSO)和二进制差分进化(BDE)已经适应了多个种群,以实现多个最优。本文采用的BDE算法是一种改进的变异算子和交叉算子。然后将它们组合在一起,创建了一种新的“多目标多优化集成二值优化算法”。该算法已在71个基本心电特征上进行了测试,包括时间、幅度、距离、斜率、角度和HRV特征,用于基于心电的识别。这71个特征可以使用支持向量机分类器识别个体,准确率为98 %。对于71个特性,最多可以有271个子集。优化的目标是在最小化特征数量的同时,找到最大化分类器精度的所有特征子集。集成优化器找到了190个唯一的优化子集。对这些子集进行了分析,以确定用于识别的关键特征。确定了特征数量最少、准确率最高的最优子集。实际实现基于脑电图的识别系统需要一个高效的系统,能够处理输入信号,从信号中提取特征,并在尽可能短的时间内识别个体。为了加快输入信号的处理速度,提出了一种新的基于dfa的心电信号识别基点P、Q、R、S和T的算法。该算法既适用于记录的心电信号,也适用于实时的心电信号。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective multi-optima ensemble binary optimization algorithm for identifying optimal set of features for ECG-based identification
Reducing the number of input features for a machine learning model decreases its complexity and computation time. However, it is crucial to choose the best set of features without compromising the model's performance. There could be several subsets of features with optimal behavior. Evolutionary algorithms are great for feature optimization. However, different evolutionary algorithms may produce different solutions, and their performance is influenced by the size of the data and the types of features. To address these issues, three popular algorithms, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Binary Differential Evolution (BDE) have been adapted to accommodate multiple populations for achieving multiple optima. The BDE algorithm applied here is a novel variant with modified mutation and crossover operators. Then they are combined to create a novel 'Multi-Objective Multi-Optima Ensemble Binary Optimization Algorithm. The algorithm has been tested on 71 fiducial ECG features including temporal, amplitude, distance, slope, angular, and HRV features for ECG-based identification. These 71 features can identify individuals using the SVM classifier with 98 % accuracy. With 71 features, there could be a maximum of 271 subsets. The optimization objective is to find all feature subsets that maximize classifier accuracy while minimizing the number of features. The ensemble optimizer has found 190 unique optimized subsets. These subsets have been analyzed to identify critical features for identification. The most optimal subset with the minimum number of features and maximum accuracy has been identified. The practical implementation of an ECG-based identification system requires an efficient system that can process incoming signals, extract features from the signal, and identify individuals in the shortest time possible. To speed up the processing of the input signal, a novel DFA-based algorithm has been proposed to identify fiducial points P, Q, R, S, and T from an ECG signal. The proposed algorithm applies to both recorded and live ECG signals.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信