The Briefest Reduct of Rough Sets Based On Genetic Algorithm

摘要：

This paper focuses on the discussion about the briefest reduct of Rough Sets which is extracted by genetic algorithm. The fitting fimction is designed by the combination of the relying degree of RS and sum of seeds which is the attributes of data. Genetic Algorithm operator is applied and the algorithm is tested by UCI database. After the analysis and discussion, RGA and RGA_2 have been proved available. In the discussion, crossover and mutation probability have got a experienced number. Increasing the sum of seeds, and saving the last generation optimized seeds can be improving the efficiency of algorithm

作者: GUAN Hong-bo YANG Bao-an

作者单位: Glorious Sun School of Business and Management,Donghua University,200051,Shanghai,China; College of Glorious Sun School of Business and Management,Donghua University,200051,Shanghai,China

会议类型: 国际会议

会议名称: 2008 IEEE International Symposium on IT in Medicine and Education(2008信息技术在医学和教育中的应用国际研讨会)(ITME 2008)

会议地点: 厦门

会议语种:英文

页码: 23-27

在线出版日期: 2008-12-12（万方平台首次上网日期，不代表论文的发表时间）