电子学报 ›› 2018, Vol. 46 ›› Issue (12): 3044-3049.DOI: 10.3969/j.issn.0372-2112.2018.12.031

• 学术论文 • 上一篇    下一篇

基于免疫克隆选择的最优ECOC编码输出

雷蕾1, 余晓东2, 王晓丹1, 罗玺3, 王艺菲1   

  1. 1. 空军工程大学防空反导学院, 陕西西安 710051;
    2. 空军研究院系统工程研究所, 北京 100076;
    3. 空军工程大学信息与导航学院, 陕西西安 710077
  • 收稿日期:2017-03-16 修回日期:2017-12-14 出版日期:2018-12-25 发布日期:2018-12-25
  • 作者简介:雷蕾 女,1988年生于四川南充.讲师,博士.主要研究方向为智能信息处理和目标识别.E-mail:wendyandpaopao@163.com;余晓东 男,1989年生于江西九江.工程师,博士.主要研究方向为目标识别、直觉模糊理论.E-mail:1438894571@qq.com;王晓丹 女,1966年生于陕西汉中.教授,博士.研究方向为模式识别、深度学习.E-mail:afeu_wang@163.com
  • 基金资助:
    国家自然科学基金(No.61806219,No.61876189,No.61503407)

An Optimization Strategy of ECOC Coding Matrix-Based on Immune Clonal Selection Algorithm

LEI Lei1, YU Xiao-dong2, WANG Xiao-dan1, LUO Xi3, WANG Yi-fei1   

  1. 1. The Air and Missile Defense Institute, Air Force Engineering University, Xi'an, Shaanxi 710051, China;
    2. The Systems Engineering Institute, AIR Force Research Institute, Beijing 10076, China;
    3. The Information and Navigation Institute, Air Force Engineering University, Xi'an, Shaanxi 710077, China
  • Received:2017-03-16 Revised:2017-12-14 Online:2018-12-25 Published:2018-12-25

摘要: 纠错输出编码(Error Correcting Output Codes,ECOC)是解决模式识别领域多类分类问题的有效工具。在寻找最优编码输出的问题上,现有方法忽略了样本类别之间的相关性,导致学习效率和分类效果低下。为构造数据感知的编码矩阵,提出基于免疫克隆选择(Immune Clonal Selection Algorithm,ICSA)的最优纠错输出编码方法,将矩阵构造的多约束NP(Non-deterministic Polynomial,NP)难问题转换为优化搜索问题.首先基于分类精度和编码长度定义亲合度函数,然后结合样本知识改进变异交叉算子,根据约束性条件对矩阵进行搜索,从而快速有效地构建最优ECOC编码.实验表明该方法能够在提升多类分类精度的同时加快算法效率,而且输出的编码矩阵更加紧凑.

关键词: 多类分类, 纠错编码, 免疫克隆选择, 数据感知, 编码矩阵, 多约束优化

Abstract: Error correcting output codes (ECOC) is a powerful tool to solve multi-classification problem.The existing methods of seeking the optimal coding matrix ignore the correlation between classes,which leads to bad performance in learning speed and classification accuracy.In order to construct data-driven coding matrix,an optimization strategy of coding matrix based on immune clonal selection algorithm (ICSA) is presented.The strategy reduces the multiple constraints non-deterministic polynomial problem (NP) of finding the optimal coding matrix to a finite heuristic search problem.Firstly,the affinity function based on accuracy and coding length is defined.Then,the mutation,crossover and selection operator are modified respectively.Meanwhile,the validity constraints are combined to execute the quick search.The experiment results based on UCI and traffic data prove that the proposed strategy can enhance the classification performance and accelerated the speed.The output coding matrix is more compact as well.

Key words: multi-classification, ECOC, immune clonal selection algorithm, data driven, coding matrix, multiple constraints optimization

中图分类号: