The briefest reduct of rough sets by genetic algorithm

被引：0
|
作者：
Guan Hong-bo [1 ]
Tian Da-gang [1 ]
Yang Bao-an [1 ]
机构：
[1] Donghua Univ, Glorious Sun Sch Business & Management, Shanghai 200051, Peoples R China
来源：
Proceedings of 2006 Chinese Control and Decision Conference | 2006年
关键词：
rough sets; the briefest rule extraction; the relying degree; genetic algorithm;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
It focuses on the discussion about the briefest reduct of Rough Sets by genetic algorithm. The fitting function designed by the combination of the relying degree and sum of seeds and the algorithm tested by UCT database. After the analysis and discussion,, RS_GA and RS_GA_2 have been proved available. In the discussion, crossover and mutation probability has got a experienced number. Increasing the sum of seeds. and saving the last generation optimised. seeds can, improve the. efficiency of algorithm.
引用
收藏
页码：1033 / 1036
页数：4
相关论文
共 12 条
  • [1] [Anonymous], 2002, KNOWLEDGE DISCOVERY
  • [2] [Anonymous], ROUGH SET THEORETICA
  • [3] BJORVAND AT, ROUGH ENOUGH SYSTEM
  • [4] [管红波 Guan Hongbo], 2004, [系统工程与电子技术, Systems engineering & electronics], V26, P334
  • [5] HAN JW, 2001, DATAMING CONCEPTS TE
  • [6] HU X, 1995, KNOWLEDGE DISCOVERY
  • [7] HUANG ZL, 1996, ROUGH SETS THEORY AP
  • [8] LU RQ, 2001, KNOWLEDGE ENG SCI CE
  • [9] PAN ZJ, 2000, EVOLVEMENT COMPUTING
  • [10] Analysis on attribute reduction strategies of rough set
    Jue Wang
    Duoqian Miao
    [J]. Journal of Computer Science and Technology, 1998, 13 (2): : 189 - 192
12