期刊文献+

基于改进混合蛙跳算法的粗糙属性交叉熵优化约简 被引量:4

Rough attribute reduction with cross-entropy based on improved shuffled frog-leaping algorithm
下载PDF
导出
摘要 结合粗糙集属性约简二进制优化模型,提出一种基于改进混合蛙跳算法的粗糙属性交叉熵优化约简算法,该算法将粗糙集属性划分至不同蛙群进化模因组内,每个模因组内属性集设计成以精英个体为中心力的蛙群并行演化方式,并采用交叉熵最小原理进行精英个体寻优全局最优约简集,快速而有效地处理大规模信息系统的属性约简.UCI仿真实验结果表明本文提出的算法在搜索全局最小属性约简解效率和精度方面具有明显优势,该算法应用于含噪音的人脑核磁共振图像MRI分割实验,其对MRI图像分割的高效性进一步表明该算法具有较强的适用性. According to the binary optimization model of attribute reduction in Rough Sets,a novel and efficient rough attribute reduction with cross-entropy based on improved shuffled frog-leaping algorithm (named SFCEAR)was proposed in this paper.In the proposed algorithm,the rough attribute set was grouped into different frogs evolutionary memeplexes.An especial kind of frog structure with the central force as their respective evolutionary elitist was designed in each attribute memeplex space,and the minimal principle of cross-entropy method was adopted to carry on the elitist frog optimization for attribute reduction.The algorithm could make efficient reduction for an information system with a large number of attributes.Experimental results on UCI data sets demonstrated the proposed algorithm outperformed other existing similar algorithms in both efficiency and accuracy of minimum attributes reduction.Moreover the proposed approach is applied into magnetic resonance images(MRI)segmentation, and the effective and robust segmentation results further indicate it has stronger applicability.
出处 《南京大学学报(自然科学版)》 CSCD 北大核心 2014年第2期159-166,共8页 Journal of Nanjing University(Natural Science)
基金 国家自然科学基金(61300167) 计算机软件新技术国家重点实验室(南京大学)开放课题(KFKT2012B28) 江苏省高校自然科学研究资助项目(12KJB520013) 南通市科技计划应用研究项目(BK2012038,BK2013043)
关键词 属性约简 蛙群模因组 中心力算法 交叉熵 MRI分割 attribute reduction frogs memeplex central force algorithm cross-entropy MRI segmentation
  • 相关文献

参考文献9

二级参考文献80

共引文献296

同被引文献36

  • 1彭宏,杨立洪,郑咸义,雷秀仁.计算工程优化问题的进化策略[J].华南理工大学学报(自然科学版),1997,25(12):17-21. 被引量:13
  • 2Eusuff M M, Lansey K E. Optimization of water distribution network design using the shuffled frog leaping algorithm[J]. Journal of Water Resources Planning and Management, 2003, 129(3):210-225.
  • 3Sun J, Wu X J, Vasile P, et al. Convergence analysis and improvements of quantum-behaved particle swarm optimization[J]. Information Sciences, 2012, 193:81-103.
  • 4Lu T C, Yu G R. An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0/1 knapsack problems[J]. Information Sciences, 2013, 243:39-56.
  • 5Abdesslem L. A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems[J]. Journal of Computational and Applied Mathematics, 2013, 253:14-25.
  • 6Jiaquan G, Jun W. A hybrid quantum-inspired immune algorithm for multi-objective optimization[J]. Applied Mathematics and Computation, 2011, 217:4754-4770.
  • 7Han K H, Kim J H. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(6):580-593.
  • 8Benenti G, Casati G, Strini G. Principles of quantum computation and information (Column I:Basic concepts)[M]. Singapore:World Scientific Publishing Company, 2004:99-187.
  • 9王珏,王任,苗夺谦,郭萌,阮永韶,袁小红,赵凯.基于Rough Set理论的“数据浓缩”[J].计算机学报,1998,21(5):393-400. 被引量:239
  • 10刘勇,熊蓉,褚健.Hash快速属性约简算法[J].计算机学报,2009,32(8):1493-1499. 被引量:35

引证文献4

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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