基于遗传算法和粗糙集的属性约简

Huang Song, Qiu Jianlin
{"title":"基于遗传算法和粗糙集的属性约简","authors":"Huang Song, Qiu Jianlin","doi":"10.1109/IICSPI.2018.8690390","DOIUrl":null,"url":null,"abstract":"To solve the problem that low efficiency and slow convergence speed of traditional attribute reduction algorithm, we propose an attribute reduction algorithm which based on the genetic algorithm and rough sets. To obtain the minimum attribute reduction, attribute dependence and hamming distance as constrains is introduced in population initialization. When the fitness function is designed, the average attribute importance is introduced as the correction factor, and the fitness function is dynamically adjusted. The improved adaptive crossover and mutation probability are adopted, and in the cross-operation, a small-scale competition strategy is used. Experimental results prove the efficiency of the proposed algorithm in attribute reduction for high dimensionality and big data.","PeriodicalId":6673,"journal":{"name":"2018 IEEE International Conference of Safety Produce Informatization (IICSPI)","volume":"189 1","pages":"788-792"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Attribute Reduction Based on Genetic Algorithm and Rough Sets\",\"authors\":\"Huang Song, Qiu Jianlin\",\"doi\":\"10.1109/IICSPI.2018.8690390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To solve the problem that low efficiency and slow convergence speed of traditional attribute reduction algorithm, we propose an attribute reduction algorithm which based on the genetic algorithm and rough sets. To obtain the minimum attribute reduction, attribute dependence and hamming distance as constrains is introduced in population initialization. When the fitness function is designed, the average attribute importance is introduced as the correction factor, and the fitness function is dynamically adjusted. The improved adaptive crossover and mutation probability are adopted, and in the cross-operation, a small-scale competition strategy is used. Experimental results prove the efficiency of the proposed algorithm in attribute reduction for high dimensionality and big data.\",\"PeriodicalId\":6673,\"journal\":{\"name\":\"2018 IEEE International Conference of Safety Produce Informatization (IICSPI)\",\"volume\":\"189 1\",\"pages\":\"788-792\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference of Safety Produce Informatization (IICSPI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IICSPI.2018.8690390\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference of Safety Produce Informatization (IICSPI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IICSPI.2018.8690390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对传统属性约简算法效率低、收敛速度慢的问题,提出了一种基于遗传算法和粗糙集的属性约简算法。为了获得最小的属性约简,在种群初始化中引入属性依赖和汉明距离作为约束。在设计适应度函数时,引入平均属性重要度作为校正因子,对适应度函数进行动态调整。采用改进的自适应交叉和变异概率,在交叉操作中采用小规模竞争策略。实验结果证明了该算法在高维大数据属性约简中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Attribute Reduction Based on Genetic Algorithm and Rough Sets
To solve the problem that low efficiency and slow convergence speed of traditional attribute reduction algorithm, we propose an attribute reduction algorithm which based on the genetic algorithm and rough sets. To obtain the minimum attribute reduction, attribute dependence and hamming distance as constrains is introduced in population initialization. When the fitness function is designed, the average attribute importance is introduced as the correction factor, and the fitness function is dynamically adjusted. The improved adaptive crossover and mutation probability are adopted, and in the cross-operation, a small-scale competition strategy is used. Experimental results prove the efficiency of the proposed algorithm in attribute reduction for high dimensionality and big data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信