No self-introduction
Loading
Profile
Follow
codes (1)
Matlab code of rough set attribute reduction based on genetic algorithm
no vote
Mainofusln. M this is the main script of your solution, and it is also the entrance to execute the whole program. The algorithm of the paper is regarded as an optimization problem from changing the script. The model is as follows: Min targetoptfcn (R) & nbsp; Rsub to. 0 & lt; = R & lt; = 1; Because R is required to be 0 or 1 in this paper, genetic algorithm can solve the 0-1 programming problem by modifying its objective function. Adding a target 3 in the targetoptfcn function can make r as close to 0 or 1 as possible. The final output r of genetic algorithm GA is floating-point type. Add a round to get several regular 0-1 variables. The final reduction result is put in R_ The script findbestreduce. M in result uses the exhaustive method to find out the optimal reduction result. The algorithm idea is: because r changes from [0 000] to [1 1 1 1], there are a total of 512 cases with 2 ^ 9 = 512, and the optimal result is naturally obtained by calculating the objective function value in each case through cyclic processing. In fact, the optimal result is that the chromosome code is r_ Best = [00100110], that is, C3, C6, C7, C8. There is also a result r = [00110101], that is, C3, C4, C6, C7, C9. The difference between these two results is not big, so the genetic algorithm may sometimes fall into the latter local optimum
lxl252577586883 7 0
1
No more~
Follows0
Fans0