首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于增量式遗传算法的粗糙集分类规则挖掘
引用本文:何明,冯博琴,马兆丰,傅向华.基于增量式遗传算法的粗糙集分类规则挖掘[J].西安交通大学学报,2004,38(6):579-582.
作者姓名:何明  冯博琴  马兆丰  傅向华
作者单位:西安交通大学电子与信息工程学院,710049,西安
基金项目:国家高技术研究发展计划资助项目 (2 0 0 3AA1Z2 61 0 ).
摘    要:从规则获取和优化两个方面研究了基于遗传算法(GA)的增量式粗糙集分类规则挖掘方法.通过研究决策表和决策规则系数,建立了基于粗糙集表示和度量的知识理论,将GA和粗糙集分类规则挖掘算法相结合,在保持原有知识完备的前提下,利用GA对以增量形式获得的分类规则进行优化,获取最优分类规则.试验结果表明,执行增量式GA所需时间较执行一般GA所需时间要少,可有效完成分类规则优化的任务,同时还可提高分类的精度,使分类结果具有更好的可理解性.

关 键 词:粗糙集  数据挖掘  增量式遗传算法  分类规则
文章编号:0253-987X(2004)06-0579-04
修稿时间:2003年9月12日

Rough Set Classification Rules Mining Based on Incremental Genetic Algorithm
He Ming,Feng Boqin,Ma Zhaofeng,Fu Xianghua.Rough Set Classification Rules Mining Based on Incremental Genetic Algorithm[J].Journal of Xi'an Jiaotong University,2004,38(6):579-582.
Authors:He Ming  Feng Boqin  Ma Zhaofeng  Fu Xianghua
Abstract:The rough set classification rules mining based on incremental genetic algorithm (GA) is studied from two aspects: decision rules acquisition and optimization. Knowledge theory based on rough set representation and measure is constructed according to coefficients of the decision rule and decision table. To acquire optimal classification rules, the proposed method combines GA with the rough set classification rules mining algorithm. Furthermore, the rules, in incremental form, acquired by GA are optimized. Experimental results show that it performs well in the task of optimization. Comparing with the general GA it enhances the classification precision, performs task with less run time, and more understandable result can be obtained.
Keywords:rough set  data mining  incremental genetic algorithm  classification rule
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号