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

一种新的基于粗集的增量式规则提取算法
引用本文:左敏,郭成城,晏蒲柳.一种新的基于粗集的增量式规则提取算法[J].武汉大学学报(理学版),2002,48(3):370-374.
作者姓名:左敏  郭成城  晏蒲柳
作者单位:武汉大学,电子信息学院,湖北,武汉,430072
基金项目:国家自然科学基金资助项目(69896240)
摘    要:通过引入属性值通配符,进而将规则表示为带通配体的样本--规则样本,并对粗集的知识约简方法稍作修改,使得加入新样本后更新规则库时能够充分利用已经获得的规则,尽量减小待简的决策表的数据量,避免每次从庞大的原始决策表开始约简,从而加快更新速度,减小计算量,只作少量修改,而不必再从头约简,最后结合个实例阐明了该方法的基本思路。

关 键 词:粗集  增量式规则提取算法  决策表
文章编号:0253-9888(2002)03-0370-05
修稿时间:2001年7月23日

A New Incremental Rule-Extracting Algorithm Based on Rough Sets
ZUO Min,GUO Cheng-cheng,YAN Pu-liu.A New Incremental Rule-Extracting Algorithm Based on Rough Sets[J].JOurnal of Wuhan University:Natural Science Edition,2002,48(3):370-374.
Authors:ZUO Min  GUO Cheng-cheng  YAN Pu-liu
Abstract:By defining the attribute-value wildcard, each rule is expressed in a form called "Rule Sample", which contains wildcards (as compared with the original "experimental sample",with a definite value for each attribute ). Then with the classical RS rule-extracting algorithm slightly modified, rules can be easily refreshed whenever new samples are added to the decision table, because the application of wildcard can help to avoid processing from the original decision table(usually contains extremely large amount of da ta) every time. Therefore time and efforts are saved greatly when the rules need to be refreshed. An example is given to demonstrate the main idea of this improved algorithm.
Keywords:rough sets  decision table  rule  incremental learning
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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