期刊文献+

具有混合策略的樽海鞘群特征选择算法

Salp swarm feature selection algorithm with a hybrid strategy
下载PDF
导出
摘要 近年来,随着计算机和数据库技术的快速发展,大规模数据集迅速增长,利用特征选择技术来筛选信息量大的特征已经变得非常重要。本文提出了一种具有混合策略的樽海鞘群特征选择算法(salp swarm feature selection algorithm with hybrid strategy,HS-SSA)。首先,本文生成一张基于互信息的排序表,并由排序表提出了新的初始化策略。其次,提出一个新颖的并且有条件调用的动态搜索算法。最后在位置更新上结合瞬态搜索算法(transient search algorithm,TSO),改进勘探和开发步骤的效率,增加解空间的灵活性和多样性,从而使算法能够快速定位到全局最优位置。为了验证算法的性能,实验选取14个UCI的数据集,并且与樽海鞘群算法(SSA)以及近几年樽海鞘群的改进算法等多种优化算法进行比较,结果表明HS-SSA在特征选择上具有更强的竞争力。 In recent years,with the rapid development of computer and database technologies,the number of large-scale datasets has rapidly increased.Thus,the use of feature selection technology is important to screen features with massive amounts of information.In this study,a salp swarm feature selection algorithm with a hybrid strategy(HS-SSA)is proposed.Initially,a sorted table based on mutual information is generated,and a new initialization strategy is proposed on the basis of this sorted table.Furthermore,a novel dynamic search algorithm with conditional call is proposed.With respect to location updates,the efficiency of exploration and development steps is improved,and the flexibility and diversity of the solution space are increased by combining the transient search algorithm(TSO).Consequently,the algorithm can rapidly locate the global optimal location.To verify algorithm performance,14 UCI datasets were selected for the test.In addition,the proposed algorithm was compared with the salp swarm algorithm(SSA),the improved SSA,and many other improved algorithms in recent years.The results show that HS-SSA is more competitive in feature selection.
作者 余紫康 董红斌 YU Zikang;DONG Hongbin(School of Computer Science and Technology,Harbin Engineering University,Harbin 150001,China)
出处 《智能系统学报》 CSCD 北大核心 2024年第3期757-765,共9页 CAAI Transactions on Intelligent Systems
基金 黑龙江自然科学基金项目(LH2020F023).
关键词 特征选择 樽海鞘群算法 瞬态搜索算法 启发式算法 互信息 动态搜索算法 秩和检验 K近邻 feature selection salp swarm algorithm transient search algorithm heuristic algorithm mutual information dynamic search algorithm rank sum test K-nearest neighbor
  • 相关文献

参考文献3

二级参考文献30

  • 1Fukuyama Y.Fundamentals of particle swarm techniques [A].Lee K Y,El-Sharkawi M A.Modern Heuristic Optimization Techniques With Applications to Power Systems [M].IEEE Power Engineering Society,2002.45~51
  • 2Eberhart R C,Shi Y.Particle swarm optimization:developments,applications and resources [A].Proceedings of the IEEE Congress on Evolutionary Computation [C].Piscataway,NJ:IEEE Service Center,2001.81~86
  • 3van den Bergh F.An analysis of particle swarm optimizers [D].South Africa:Department of Computer Science,University of Pretoria,2002
  • 4Kennedy J,Eberhart R C.A discrete binary version of the particle swarm algorithm [A].Proceedings of the World Multiconference on Systemics,Cybernetics and Informatics [C].Piscataway,NJ:IEEE Service Center,1997.4104~4109
  • 5Yoshida H,Kawata K,Fukuyama Y,et al.A particle swarm optimization for reactive power and voltage control considering voltage stability [A].Proceedings of the International Conference on Intelligent System Application to Power System [C].Rio de Janeiro,Brazil,1999.117~121
  • 6Angeline P.Using selection to improve particle swarm optimization [A].Proceedings of IJCNN99[C].Washington,USA,1999.84~89
  • 7Shi Y,Eberhart R C.A modified particle swarm optimizer [R].IEEE International Conference of Evolutionary Computation,Anchorage,Alaska,May 1998
  • 8Shi Y,Eberhart R C.Empirical study of particle swarm optimization [A].Proceeding of Congress on Evolutionary Computation [C].:Piscataway,NJ:IEEE Service Center,1999.1945~1949
  • 9Shi Y,Eberhart R C.Fuzzy adaptive particle swarm optimization [A].Proceedings of the Congress on Evolutionary Computation[C].Seoul,Korea,2001
  • 10Lovbjerg M,Rasmussen T K,Krink T.Hybrid particle swarm optimiser with breeding and subpopulations [A].Proceedings of the Genetic and Evolutionary Computation Conference[C].San Francisco,USA,July 2001

共引文献395

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部