• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种使用新型多视图哈里斯鹰优化算法的焦虑障碍分析特征选择框架。

A feature selection framework for anxiety disorder analysis using a novel multiview harris hawk optimization algorithm.

机构信息

Department of Computer Science, Faculty of Computers and Information, Damanhour University, 22511, Damanhour, Egypt.

Department of Computer Science, Faculty of Computers and Informatics, Suez Canal University, 41522, Ismailia, Egypt.

出版信息

Artif Intell Med. 2023 Sep;143:102605. doi: 10.1016/j.artmed.2023.102605. Epub 2023 Jun 7.

DOI:10.1016/j.artmed.2023.102605
PMID:37673574
Abstract

Machine learning (ML) has demonstrated its ability to exploit important relationships within data collection, which can be used in the diagnosis, treatment, and prediction of outcomes in a variety of clinical contexts. Anxiety mental disorder analysis is one of the pending difficulties that ML can help with. A thorough study is demanded to gain a better understanding of this illness. Since the anxiety data is generally multidimensional, which complicates processing and as a result of technology improvements, medical data from several perspectives, known as multiview data (MVD), is being collected. Each view has its own data type and feature values, so there is a lot of diversity. This work introduces a novel preprocessing feature selection (FS) approach, multiview harris hawk optimization (MHHO), which has the potential to reduce the dimensionality of anxiety data, hence reducing analytical effort. The uniqueness of MHHO originates from combining a multiview linking methodology with the power of the harris hawk optimization (HHO) method. The HHO is used to identify the lowest optimal MVD feature subset, while multiview linking is utilized to find a promising fitness function to direct the HHO FS while accounting for all data views' heterogeneity. The complexity of MHHO is O(THL), where T is the number of iterations, H is the number of involved harris hawks, and L is the number of objects. Using two publicly available anxiety MVDs, MHHO is validated against ten recent rivals in its category. The experimental findings show that MHHO has a considerable advantage in terms of convergence speed (converging in less than ten iterations), subset size (removing 75% of the views; reducing feature size by 66%), and classification accuracy (approaching 100%). Furthermore, statistical analyses reveal that MHHO is statistically different from its competitors, bolstering its applicability. Finally, feature importance is evaluated, shedding light on the most anxiety-inducing characteristics. The likelihood of developing additional disorders (such as depression or stress) is also investigated.

摘要

机器学习(ML)已经证明了其在挖掘数据集中重要关系方面的能力,可用于各种临床环境下的诊断、治疗和结果预测。焦虑症的分析是 ML 可以帮助解决的待解决问题之一。需要进行深入研究以更好地了解这种疾病。由于焦虑数据通常是多维的,这使得处理变得复杂,并且随着技术的进步,从多个角度收集了称为多视图数据(MVD)的医学数据。每个视图都有自己的数据类型和特征值,因此存在很多差异。这项工作引入了一种新颖的预处理特征选择(FS)方法,即多视图哈里斯鹰优化(MHHO),它有可能降低焦虑数据的维度,从而减少分析工作量。MHHO 的独特之处在于结合了多视图链接方法和哈里斯鹰优化(HHO)方法的优势。HHO 用于识别最低的最优 MVD 特征子集,而多视图链接用于找到有前途的适应度函数,以指导 HHO FS,同时考虑到所有数据视图的异质性。MHHO 的复杂性为 O(THL),其中 T 是迭代次数,H 是参与的哈里斯鹰的数量,L 是对象的数量。使用两个公开的焦虑 MVD,MHHO 与该类别中的十个最新竞争对手进行了比较。实验结果表明,MHHO 在收敛速度(不到十次迭代即可收敛)、子集大小(删除 75%的视图;将特征大小减少 66%)和分类精度(接近 100%)方面具有明显优势。此外,统计分析表明 MHHO 在统计学上与竞争对手不同,从而增强了它的适用性。最后,评估了特征重要性,揭示了最能引起焦虑的特征。还研究了发展其他疾病(如抑郁或压力)的可能性。

相似文献

1
A feature selection framework for anxiety disorder analysis using a novel multiview harris hawk optimization algorithm.一种使用新型多视图哈里斯鹰优化算法的焦虑障碍分析特征选择框架。
Artif Intell Med. 2023 Sep;143:102605. doi: 10.1016/j.artmed.2023.102605. Epub 2023 Jun 7.
2
An analytical study of modified multi-objective Harris Hawk Optimizer towards medical data feature selection.基于改进多目标哈里斯鹰优化算法的医学数据特征选择分析研究。
Comput Biol Med. 2021 Aug;135:104558. doi: 10.1016/j.compbiomed.2021.104558. Epub 2021 Jun 12.
3
Modified Harris Hawks optimization for the 3E feasibility assessment of a hybrid renewable energy system.用于混合可再生能源系统3E可行性评估的改进型哈里斯鹰优化算法
Sci Rep. 2024 Aug 29;14(1):20127. doi: 10.1038/s41598-024-70663-5.
4
Harris Hawk Optimization: A Survey onVariants and Applications.哈里斯鹰优化算法:变体与应用综述。
Comput Intell Neurosci. 2022 Jun 27;2022:2218594. doi: 10.1155/2022/2218594. eCollection 2022.
5
A path planning method using modified harris hawks optimization algorithm for mobile robots.一种用于移动机器人的基于改进型哈里斯鹰优化算法的路径规划方法。
PeerJ Comput Sci. 2023 Jul 18;9:e1473. doi: 10.7717/peerj-cs.1473. eCollection 2023.
6
Crisscross Harris Hawks Optimizer for Global Tasks and Feature Selection.用于全局任务和特征选择的交叉哈里斯鹰优化器。
J Bionic Eng. 2023;20(3):1153-1174. doi: 10.1007/s42235-022-00298-7. Epub 2022 Nov 30.
7
A New Algorithm for Cancer Biomarker Gene Detection Using Harris Hawks Optimization.基于哈里斯鹰优化算法的癌症生物标志物基因检测新算法
Sensors (Basel). 2022 Sep 26;22(19):7273. doi: 10.3390/s22197273.
8
An improved harris hawks optimization algorithm based on chaotic sequence and opposite elite learning mechanism.基于混沌序列和反向精英学习机制的改进型哈里斯鹰优化算法。
PLoS One. 2023 Feb 22;18(2):e0281636. doi: 10.1371/journal.pone.0281636. eCollection 2023.
9
A new parallel multi-objective Harris hawk algorithm for predicting the mortality of COVID-19 patients.一种用于预测新冠肺炎患者死亡率的新型并行多目标哈里斯鹰算法。
PeerJ Comput Sci. 2023 Jun 14;9:e1430. doi: 10.7717/peerj-cs.1430. eCollection 2023.
10
Enhanced Harris hawks optimization-based fuzzy k-nearest neighbor algorithm for diagnosis of Alzheimer's disease.基于增强型哈里斯鹰优化的模糊 K-最近邻算法在阿尔茨海默病诊断中的应用。
Comput Biol Med. 2023 Oct;165:107392. doi: 10.1016/j.compbiomed.2023.107392. Epub 2023 Aug 31.

引用本文的文献

1
ONE3A: one-against-all authentication model for smartphone using GAN network and optimization techniques.ONE3A:一种使用生成对抗网络(GAN)和优化技术的智能手机一对一认证模型。
PeerJ Comput Sci. 2024 Apr 29;10:e2001. doi: 10.7717/peerj-cs.2001. eCollection 2024.