Suppr超能文献

基于改进型灰狼优化算法的链式混合特征选择算法。

Chain hybrid feature selection algorithm based on improved Grey Wolf Optimization algorithm.

机构信息

School of Mathematics and Computer, Jilin Normal University, Siping, Jilin, China.

出版信息

PLoS One. 2024 Oct 8;19(10):e0311602. doi: 10.1371/journal.pone.0311602. eCollection 2024.

Abstract

Hybrid feature selection algorithm is a strategy that combines different feature selection methods aiming to overcome the limitations of a single feature selection method and improve the effectiveness and performance of feature selection. In this paper, we propose a new hybrid feature selection algorithm, to be named as Tandem Maximum Kendall Minimum Chi-Square and ReliefF Improved Grey Wolf Optimization algorithm (TMKMCRIGWO). The algorithm consists of two stages: First, the original features are filtered and ranked using the bivariate filter algorithm Maximum Kendall Minimum Chi-Square (MKMC) to form a subset of candidate features S1; Subsequently, S1 features are filtered and sorted to form a candidate feature subset S2 by using ReliefF in tandem, and finally S2 is used in the wrapper algorithm to select the optimal subset. In particular, the wrapper algorithm is an improved Grey Wolf Optimization (IGWO) algorithm based on random disturbance factors, while the parameters are adjusted to vary randomly to make the population variations rich in diversity. Hybrid algorithms formed by combining filter algorithms with wrapper algorithms in tandem show better performance and results than single algorithms in solving complex problems. Three sets of comparison experiments were conducted to demonstrate the superiority of this algorithm over the others. The experimental results show that the average classification accuracy of the TMKMCRIGWO algorithm is at least 0.1% higher than the other algorithms on 20 datasets, and the average value of the dimension reduction rate (DRR) reaches 24.76%. The DRR reached 41.04% for 12 low-dimensional datasets and 0.33% for 8 high-dimensional datasets. It also shows that the algorithm improves the generalization ability and performance of the model.

摘要

混合特征选择算法是一种结合不同特征选择方法的策略,旨在克服单一特征选择方法的局限性,提高特征选择的有效性和性能。在本文中,我们提出了一种新的混合特征选择算法,命名为串联最大 Kendall 最小卡方和 ReliefF 改进灰狼优化算法(TMKMCRIGWO)。该算法由两个阶段组成:首先,使用二元过滤器算法最大 Kendall 最小卡方(MKMC)对原始特征进行过滤和排序,形成候选特征子集 S1;随后,通过串联 ReliefF 对 S1 特征进行过滤和排序,形成候选特征子集 S2,最后使用包装器算法选择最优子集。特别是,包装器算法是一种基于随机干扰因素的改进灰狼优化(IGWO)算法,同时调整参数以随机变化,使种群变化多样化。通过串联过滤器算法和包装器算法组合形成的混合算法在解决复杂问题方面表现出比单一算法更好的性能和结果。进行了三组对比实验,以证明该算法优于其他算法。实验结果表明,在 20 个数据集上,TMKMCRIGWO 算法的平均分类准确率至少比其他算法高 0.1%,降维率(DRR)的平均值达到 24.76%。对于 12 个低维数据集,DRR 达到 41.04%,对于 8 个高维数据集,DRR 达到 0.33%。这也表明该算法提高了模型的泛化能力和性能。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3977/11460688/39d21eff941e/pone.0311602.g001.jpg

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验