...
首页> 外文期刊>Information Sciences: An International Journal >A more efficient attribute self-adaptive co-evolutionary reduction algorithm by combining quantum elitist frogs and cloud model operators
【24h】

A more efficient attribute self-adaptive co-evolutionary reduction algorithm by combining quantum elitist frogs and cloud model operators

机译:结合量子精英青蛙和云模型算子的高效属性自适应共进化约简算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In order to further improve the adaptability of attribute reduction and enhance its application performance in large-scale attribute reduction, a more efficient attribute self-adaptive co-evolutionary reduction algorithm by combining quantum elitist frogs and cloud model operators (QECMASCR) is proposed in this paper. Firstly, quantum chromosome is used to encode the evolutionary population, and a multilevel elitist pool of quantum frogs is constructed in which quantum elitist frogs can fast guide the evolutionary population into the optimal area. Secondly, a reversible cloud mode based on attribute entropy weight is designed to adjust the quantum cloud revolving angle, so that the scope of search space can be adaptively controlled under the guidance of qualitative knowledge. In addition, both the quantum cloud mutation operator and quantum cloud entanglement operator are used to make quantum frogs be adaptive to get the optimal set of attribute reduction fast. Thirdly, an improved decomposition framework of attribute self-adaptive co-evolution is adopted to capture interdependencies of decision variables. It can decompose the largescale attribute set into reasonable-scale subsets according to two kinds of the best performance fitness and assignment credit. Thus, some optimal elitists in different memeplexes of multilevel elitist pool are selected out to evolve their representing attribute subsets, which can increase the cooperation and efficiency of attribute reduction. So the global minimum attribute reduction can be achieved steadily and efficiently. Experimental results indicate the proposed QECMASCR algorithm achieves the better superior performance than existing representative algorithms. Moreover it is applied into MRI segmentation, and the effective and robust segmentation results further demonstrate its stronger applicability. (C) 2014 Elsevier Inc. All rights reserved.
机译:为了进一步提高属性约简的适应性,提高其在大规模属性约简中的应用性能,提出了一种结合量子精英青蛙和云模型算子(QECMASCR)的高效属性自适应共进化约简算法。纸。首先,利用量子染色体对进化种群进行编码,建立了多层次的量子青蛙精英种群,其中量子精英青蛙可以快速地将进化种群引导到最优区域。其次,设计了一种基于属性熵权的可逆云模式来调节量子云的旋转角度,从而可以在定性知识的指导下自适应地控制搜索空间的范围。另外,量子云突变算子和量子云纠缠算子都可以使量子青蛙具有适应性,从而快速获得最优的属性约简集。第三,采用改进的属性自适应协同进化分解框架来捕获决策变量的相互依赖关系。它可以根据两种最佳性能适合度和分配功劳将大型属性集分解为合理规模的子集。因此,从多层次精英群的不同memeplex中选择了一些最佳精英,以演化其代表属性子集,从而可以提高属性约简的协作性和效率。因此,可以稳定高效地实现全局最小属性约简。实验结果表明,提出的QECMASCR算法比现有的代表性算法具有更好的优越性能。此外,将其应用于MRI分割,有效且鲁棒的分割结果进一步证明了其较强的适用性。 (C)2014 Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号