基于强化学习的变维多目标寿命约束量子粒子群算法用于高维患者数据聚类

IF 3.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Chen Guo, Heng Tang, Huifen Zhong, Hua Xiao, Ben Niu
{"title":"基于强化学习的变维多目标寿命约束量子粒子群算法用于高维患者数据聚类","authors":"Chen Guo,&nbsp;Heng Tang,&nbsp;Huifen Zhong,&nbsp;Hua Xiao,&nbsp;Ben Niu","doi":"10.1155/int/5521043","DOIUrl":null,"url":null,"abstract":"<div>\n <p>Ming potential patterns from patient data are usually treated as a high-dimensional data clustering problem. Evolutionary multiobjective clustering algorithms with feature selection (FS) are widely used to handle this problem. Among the existing algorithms, FS can be performed either before or during the clustering process. However, research on performing FS at both stages (hybrid FS), which can yield robust and credible clustering results, is still in its infancy. This paper introduces an improved high-dimensional patient data clustering algorithm with hybrid FS called variable dimensional multiobjective lifetime constrained quantum PSO with reinforcement learning (VLQPSOR). VLQPSOR consists of two main independent stages. In the first stage, a dimensionality reduction ensemble strategy is developed before clustering to reduce the patient dataset’s dimensionality, resulting in subdatasets of varying dimensions. In the second stage, an improved multiobjective QPSO clustering algorithm is proposed to simultaneously conduct dimensionality reduction and clustering. To accomplish this, several strategies are employed. Firstly, the variable dimensional lifetime constrained particle learning strategy, the continuous-to-binary encoding transformation strategy, and multiple external archives elite learning strategy are introduced to further reduce the dimensionality of the subdatasets and mitigate the risk of QPSO getting trapped in local optima. Secondly, an improved reinforcement learning–based clustering method selection strategy is proposed to adaptively select the optimal classical clustering algorithm. Experimental results demonstrate that VLQPSOR outperforms five representative comparative algorithms across four validity indexes and clustering partitions for most patient datasets. Ablation experiments confirm the effectiveness of the proposed strategies in enhancing the performance of QPSO.</p>\n </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7000,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/5521043","citationCount":"0","resultStr":"{\"title\":\"Variable Dimensional Multiobjective Lifetime Constrained Quantum PSO With Reinforcement Learning for High-Dimensional Patient Data Clustering\",\"authors\":\"Chen Guo,&nbsp;Heng Tang,&nbsp;Huifen Zhong,&nbsp;Hua Xiao,&nbsp;Ben Niu\",\"doi\":\"10.1155/int/5521043\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>Ming potential patterns from patient data are usually treated as a high-dimensional data clustering problem. Evolutionary multiobjective clustering algorithms with feature selection (FS) are widely used to handle this problem. Among the existing algorithms, FS can be performed either before or during the clustering process. However, research on performing FS at both stages (hybrid FS), which can yield robust and credible clustering results, is still in its infancy. This paper introduces an improved high-dimensional patient data clustering algorithm with hybrid FS called variable dimensional multiobjective lifetime constrained quantum PSO with reinforcement learning (VLQPSOR). VLQPSOR consists of two main independent stages. In the first stage, a dimensionality reduction ensemble strategy is developed before clustering to reduce the patient dataset’s dimensionality, resulting in subdatasets of varying dimensions. In the second stage, an improved multiobjective QPSO clustering algorithm is proposed to simultaneously conduct dimensionality reduction and clustering. To accomplish this, several strategies are employed. Firstly, the variable dimensional lifetime constrained particle learning strategy, the continuous-to-binary encoding transformation strategy, and multiple external archives elite learning strategy are introduced to further reduce the dimensionality of the subdatasets and mitigate the risk of QPSO getting trapped in local optima. Secondly, an improved reinforcement learning–based clustering method selection strategy is proposed to adaptively select the optimal classical clustering algorithm. Experimental results demonstrate that VLQPSOR outperforms five representative comparative algorithms across four validity indexes and clustering partitions for most patient datasets. Ablation experiments confirm the effectiveness of the proposed strategies in enhancing the performance of QPSO.</p>\\n </div>\",\"PeriodicalId\":14089,\"journal\":{\"name\":\"International Journal of Intelligent Systems\",\"volume\":\"2025 1\",\"pages\":\"\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/5521043\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/int/5521043\",\"RegionNum\":2,\"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":"International Journal of Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/int/5521043","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

从患者数据中识别潜在模式通常被视为一个高维数据聚类问题。基于特征选择的进化多目标聚类算法被广泛用于处理这一问题。在现有的算法中,FS可以在聚类之前或聚类过程中执行。然而,在这两个阶段执行聚类(混合聚类)的研究仍然处于起步阶段,它可以产生鲁棒和可信的聚类结果。本文介绍了一种改进的基于混合FS的高维患者数据聚类算法——变维多目标寿命约束量子粒子群算法(VLQPSOR)。VLQPSOR由两个主要的独立级组成。在第一阶段,在聚类之前开发降维集成策略,以降低患者数据集的维数,从而产生不同维数的子数据集。第二阶段,提出一种改进的多目标QPSO聚类算法,同时进行降维和聚类。为了实现这一点,采用了几种策略。首先,引入变维寿命约束粒子学习策略、连续到二值编码转换策略和多外部档案精英学习策略,进一步降低子数据集的维数,降低QPSO陷入局部最优的风险;其次,提出了一种改进的基于强化学习的聚类方法选择策略,自适应地选择最优的经典聚类算法;实验结果表明,对于大多数患者数据集,VLQPSOR在4个有效性指标和聚类划分上优于5种代表性的比较算法。烧蚀实验证实了所提策略在提高QPSO性能方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Variable Dimensional Multiobjective Lifetime Constrained Quantum PSO With Reinforcement Learning for High-Dimensional Patient Data Clustering

Variable Dimensional Multiobjective Lifetime Constrained Quantum PSO With Reinforcement Learning for High-Dimensional Patient Data Clustering

Ming potential patterns from patient data are usually treated as a high-dimensional data clustering problem. Evolutionary multiobjective clustering algorithms with feature selection (FS) are widely used to handle this problem. Among the existing algorithms, FS can be performed either before or during the clustering process. However, research on performing FS at both stages (hybrid FS), which can yield robust and credible clustering results, is still in its infancy. This paper introduces an improved high-dimensional patient data clustering algorithm with hybrid FS called variable dimensional multiobjective lifetime constrained quantum PSO with reinforcement learning (VLQPSOR). VLQPSOR consists of two main independent stages. In the first stage, a dimensionality reduction ensemble strategy is developed before clustering to reduce the patient dataset’s dimensionality, resulting in subdatasets of varying dimensions. In the second stage, an improved multiobjective QPSO clustering algorithm is proposed to simultaneously conduct dimensionality reduction and clustering. To accomplish this, several strategies are employed. Firstly, the variable dimensional lifetime constrained particle learning strategy, the continuous-to-binary encoding transformation strategy, and multiple external archives elite learning strategy are introduced to further reduce the dimensionality of the subdatasets and mitigate the risk of QPSO getting trapped in local optima. Secondly, an improved reinforcement learning–based clustering method selection strategy is proposed to adaptively select the optimal classical clustering algorithm. Experimental results demonstrate that VLQPSOR outperforms five representative comparative algorithms across four validity indexes and clustering partitions for most patient datasets. Ablation experiments confirm the effectiveness of the proposed strategies in enhancing the performance of QPSO.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Intelligent Systems
International Journal of Intelligent Systems 工程技术-计算机:人工智能
CiteScore
11.30
自引率
14.30%
发文量
304
审稿时长
9 months
期刊介绍: The International Journal of Intelligent Systems serves as a forum for individuals interested in tapping into the vast theories based on intelligent systems construction. With its peer-reviewed format, the journal explores several fascinating editorials written by today''s experts in the field. Because new developments are being introduced each day, there''s much to be learned — examination, analysis creation, information retrieval, man–computer interactions, and more. The International Journal of Intelligent Systems uses charts and illustrations to demonstrate these ground-breaking issues, and encourages readers to share their thoughts and experiences.
×
引用
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学术官方微信