{"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}
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.