图形卷积网络支持阿尔茨海默病诊断的多图组合筛选策略

IF 5.6 2区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Instrumentation and Measurement Pub Date : 2024-10-23 DOI:10.1109/TIM.2024.3485439
Huabin Wang;Dongxu Shang;Zhe Jin;Fei Liu
{"title":"图形卷积网络支持阿尔茨海默病诊断的多图组合筛选策略","authors":"Huabin Wang;Dongxu Shang;Zhe Jin;Fei Liu","doi":"10.1109/TIM.2024.3485439","DOIUrl":null,"url":null,"abstract":"Alzheimer’s disease (AD) is a degenerative disorder that encompasses multiple stages during its onset. There are certain shared characteristics among patients at various stages of AD, which results in the presence of incorrect edges in the graph structure constructed using graph convolutional network (GCN) for AD diagnosis. Due to the presence of incorrect edges, a singular graph structure faces challenges in accurately capturing the relationships between nodes. To tackle such a problem, this article proposes a screening strategy that constructs a large number of graphs, and selects an optimal graph combination. For each graph, the model adaptively aggregates lesion area features of similar nodes. Such a graph-selecting strategy alleviates the impact of incorrect edges and yields better performance. First, a multiscale composition module is designed to find the potential relationship between nodes, and the graph structure at different scales is constructed by extracting the significant pathogenic features from the node features. Second, a multihop node aggregation (MHNA) algorithm is proposed to find the correlation between multihop nodes in the same category, and highly correlated multihop nodes are found by traversing the features of different hop nodes. Third, an optimal multigraph combination screening strategy is proposed to select the optimal multihop graph combinations under the optimal multiscale combinations, and further adaptive fusion by using the multigraph attention mechanism. This enables the whole model to capture the distinctive features of AD while enhancing aggregation among similar nodes. The proposed model achieves an average accuracy of 90.21% and 94.10% on the NACC and Tadpole datasets, respectively, surpassing state-of-the-art results.","PeriodicalId":13341,"journal":{"name":"IEEE Transactions on Instrumentation and Measurement","volume":"73 ","pages":"1-19"},"PeriodicalIF":5.6000,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Multigraph Combination Screening Strategy Enabled Graph Convolutional Network for Alzheimer’s Disease Diagnosis\",\"authors\":\"Huabin Wang;Dongxu Shang;Zhe Jin;Fei Liu\",\"doi\":\"10.1109/TIM.2024.3485439\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Alzheimer’s disease (AD) is a degenerative disorder that encompasses multiple stages during its onset. There are certain shared characteristics among patients at various stages of AD, which results in the presence of incorrect edges in the graph structure constructed using graph convolutional network (GCN) for AD diagnosis. Due to the presence of incorrect edges, a singular graph structure faces challenges in accurately capturing the relationships between nodes. To tackle such a problem, this article proposes a screening strategy that constructs a large number of graphs, and selects an optimal graph combination. For each graph, the model adaptively aggregates lesion area features of similar nodes. Such a graph-selecting strategy alleviates the impact of incorrect edges and yields better performance. First, a multiscale composition module is designed to find the potential relationship between nodes, and the graph structure at different scales is constructed by extracting the significant pathogenic features from the node features. Second, a multihop node aggregation (MHNA) algorithm is proposed to find the correlation between multihop nodes in the same category, and highly correlated multihop nodes are found by traversing the features of different hop nodes. Third, an optimal multigraph combination screening strategy is proposed to select the optimal multihop graph combinations under the optimal multiscale combinations, and further adaptive fusion by using the multigraph attention mechanism. This enables the whole model to capture the distinctive features of AD while enhancing aggregation among similar nodes. The proposed model achieves an average accuracy of 90.21% and 94.10% on the NACC and Tadpole datasets, respectively, surpassing state-of-the-art results.\",\"PeriodicalId\":13341,\"journal\":{\"name\":\"IEEE Transactions on Instrumentation and Measurement\",\"volume\":\"73 \",\"pages\":\"1-19\"},\"PeriodicalIF\":5.6000,\"publicationDate\":\"2024-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Instrumentation and Measurement\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10731868/\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Instrumentation and Measurement","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10731868/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

阿尔茨海默病(AD)是一种退行性疾病,发病过程包含多个阶段。处于不同阶段的阿尔茨海默病患者具有某些共同特征,这导致在使用图卷积网络(GCN)构建的用于诊断阿尔茨海默病的图结构中存在不正确的边。由于存在错误的边,奇异图结构在准确捕捉节点之间的关系方面面临挑战。为解决这一问题,本文提出了一种筛选策略,即构建大量图,并选择最佳图组合。对于每个图,该模型会自适应地汇总相似节点的病变区域特征。这种图选择策略可减轻错误边缘的影响,并产生更好的性能。首先,设计了一个多尺度组成模块,以发现节点之间的潜在关系,并通过从节点特征中提取重要的致病特征来构建不同尺度的图结构。其次,提出了多跳节点聚合(MHNA)算法,通过遍历不同跳节点的特征,找到同类多跳节点之间的相关性,从而找到高度相关的多跳节点。第三,提出最优多图组合筛选策略,在最优多尺度组合下选择最优多跳图组合,并利用多图关注机制进一步自适应融合。这使得整个模型能够捕捉到 AD 的显著特征,同时加强相似节点之间的聚合。所提出的模型在 NACC 和 Tadpole 数据集上的平均准确率分别达到了 90.21% 和 94.10%,超过了最先进的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Multigraph Combination Screening Strategy Enabled Graph Convolutional Network for Alzheimer’s Disease Diagnosis
Alzheimer’s disease (AD) is a degenerative disorder that encompasses multiple stages during its onset. There are certain shared characteristics among patients at various stages of AD, which results in the presence of incorrect edges in the graph structure constructed using graph convolutional network (GCN) for AD diagnosis. Due to the presence of incorrect edges, a singular graph structure faces challenges in accurately capturing the relationships between nodes. To tackle such a problem, this article proposes a screening strategy that constructs a large number of graphs, and selects an optimal graph combination. For each graph, the model adaptively aggregates lesion area features of similar nodes. Such a graph-selecting strategy alleviates the impact of incorrect edges and yields better performance. First, a multiscale composition module is designed to find the potential relationship between nodes, and the graph structure at different scales is constructed by extracting the significant pathogenic features from the node features. Second, a multihop node aggregation (MHNA) algorithm is proposed to find the correlation between multihop nodes in the same category, and highly correlated multihop nodes are found by traversing the features of different hop nodes. Third, an optimal multigraph combination screening strategy is proposed to select the optimal multihop graph combinations under the optimal multiscale combinations, and further adaptive fusion by using the multigraph attention mechanism. This enables the whole model to capture the distinctive features of AD while enhancing aggregation among similar nodes. The proposed model achieves an average accuracy of 90.21% and 94.10% on the NACC and Tadpole datasets, respectively, surpassing state-of-the-art results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Instrumentation and Measurement
IEEE Transactions on Instrumentation and Measurement 工程技术-工程:电子与电气
CiteScore
9.00
自引率
23.20%
发文量
1294
审稿时长
3.9 months
期刊介绍: Papers are sought that address innovative solutions to the development and use of electrical and electronic instruments and equipment to measure, monitor and/or record physical phenomena for the purpose of advancing measurement science, methods, functionality and applications. The scope of these papers may encompass: (1) theory, methodology, and practice of measurement; (2) design, development and evaluation of instrumentation and measurement systems and components used in generating, acquiring, conditioning and processing signals; (3) analysis, representation, display, and preservation of the information obtained from a set of measurements; and (4) scientific and technical support to establishment and maintenance of technical standards in the field of Instrumentation and Measurement.
期刊最新文献
Front Cover A Lightweight Reprogramming Framework for Cross-Device Fault Diagnosis in Edge Computing First Arrival Picking of Aircraft-Excited Seismic Waves Based on Energy Distribution DMPDD-Net: An Effective Defect Detection Method for Aluminum Profiles Surface Defect C-DHV: A Cascaded Deep Hough Voting-Based Tracking Algorithm for LiDAR Point Clouds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1