计算机应用 ›› 2021, Vol. 41 ›› Issue (8): 2412-2417.DOI: 10.11772/j.issn.1001-9081.2020101562

所属专题: 第八届CCF大数据学术会议(CCF Bigdata 2020)

• 第八届CCF大数据学术会议 • 上一篇    下一篇

结合头脑风暴优化的混合蚁群优化算法

李蒙蒙1,2, 秦伟1,2, 刘艺1,2, 刁兴春1,2   

  1. 1. 中国人民解放军军事科学院 国防科技创新研究院, 北京 100071;
    2. 天津(滨海)人工智能创新中心, 天津 300457
  • 收稿日期:2020-10-10 修回日期:2020-12-04 出版日期:2021-08-10 发布日期:2021-01-27
  • 通讯作者: 刘艺
  • 作者简介:李蒙蒙(1992-),女,河北邯郸人,硕士研究生,主要研究方向:数据质量、演化算法;秦伟(1983-),男,安徽阜阳人,助理研究员,硕士,主要研究方向:智能信息系统管理;刘艺(1990-),男,安徽蚌埠人,助理研究员,博士,主要研究方向:机器人操作系统、数据质量、演化算法;刁兴春(1964-),男,江苏泰兴人,研究员,博士生导师,硕士,主要研究方向:人工智能、机器人操作系统、数据工程。
  • 基金资助:

    国家自然科学基金资助项目(91648204,61802426)。

Hybrid ant colony optimization algorithm with brain storm optimization

LI Mengmeng1,2, QIN Wei1,2, LIU Yi1,2, DIAO Xingchun1,2   

  1. 1. National Innovation Institute of Defense Technology, Academy of Military Sciences PLA China, Beijing 100071, China;
    2. Tianjin Artificial Intelligence Innovation Center, Tianjin 300457, China
  • Received:2020-10-10 Revised:2020-12-04 Online:2021-08-10 Published:2021-01-27
  • Supported by:

    This work is partially supported by the National Natural Science Foundation of China (91648204, 61802426).

摘要:

特征选择能够有效提升数据分类的性能。为了进一步提升蚁群优化(ACO)在特征选择上的求解能力,提出一种结合头脑风暴优化的混合蚁群优化(ABO)算法。该算法利用信息交流档案维护历史较好解,并通过基于松弛因子的时间最久优先方法动态更新档案。当ACO的全局最优解多次未更新时,采用基于Fuch混沌映射方法的路径-想法转换算子将档案中的路径解转换为想法解,并将其作为初始种群,通过头脑风暴优化(BSO)在更广阔的空间中搜索较好解。对所提算法在6组典型的二分类数据集上进行实验,分析了其参数敏感性,并与混合萤火虫粒子群优化(HFPSO)算法、粒子群优化与引力搜索算法(PSOGSA)以及遗传算法(GA) 这三种典型的演化算法进行对比。实验结果表明,相较于对比算法,所提算法在分类正确率上至少可提高2.88%~5.35%,在F1指标上至少可提高0.02~0.05,验证了所提算法的有效性和优越性。

关键词: 蚁群优化算法, 头脑风暴优化, 混合算法, 特征选择, 数据分类

Abstract:

Feature selection can improve the performance of data classification effectively. In order to further improve the solving ability of Ant Colony Optimization (ACO) on feature selection, a hybrid Ant colony optimization with Brain storm Optimization (ABO) algorithm was proposed. In the algorithm, the information communication archive was used to maintain the historical better solutions, and a longest time first method based on relaxation factor was adopted to update archive dynamically. When the global optimal solution of ACO was not updated for several times, a route-idea transformation operator based on Fuch chaotic map was used to transform the route solutions in the archive to the idea solutions. With the obtained solutions as initial population, the Brain Storm Optimization (BSO) was adopted to search for better solutions in wider space. On six typical binary datasets, experiments were conducted to analyze the sensibility of parameters of the proposed algorithm, and the algorithm was compared to three typical evolutionary algorithms:Hybrid Firefly and Particle Swarm Optimization (HFPSO) algorithm, Particle Swarm Optimization and Gravitational Search Algorithm (PSOGSA) and Genetic Algorithm (GA). Experimental results show that compared with the comparison algorithms, the proposed algorithm can improve the classification accuracy by at least 2.88% to 5.35%, and the F1-measure by at least 0.02 to 0.05, which verify the effectiveness and superiority of the proposed algorithm.

Key words: Ant Colony Optimization (ACO) algorithm, Brain Storm Optimization (BSO), hybrid algorithm, feature selection, data classification

中图分类号: