期刊文献+

一种新的基于粗集的增量式规则提取算法 被引量:1

A New Incremental Rule-Extracting Algorithm Based on Rough Sets
下载PDF
导出
摘要 通过引入属性值通配符,进而将规则表示为带通配符的样本——规则样本,并对粗集的知识约简方法稍作修改,使得加入新样本后更新规则库时能够充分利用已经获得的规则,尽量减小待约简的决策表的数据量,避免每次从庞大的原始决策表开始约简,从而加快更新速度,减小计算量,只作少量修改,而不必再从头约简.最后结合一个实例阐明了该方法的基本思路. 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.
出处 《武汉大学学报(理学版)》 CAS CSCD 北大核心 2002年第3期370-374,共5页 Journal of Wuhan University:Natural Science Edition
基金 国家自然科学基金资助项目(69896240)
关键词 粗集 增量式规则提取算法 决策表 rough sets decision table rule incremental learning
  • 相关文献

参考文献4

二级参考文献9

  • 1王珏,苗夺谦,周育健.关于Rough Set理论与应用的综述[J].模式识别与人工智能,1996,9(4):337-344. 被引量:264
  • 2史忠植.高级人工智能[M].北京:科学出版社,1997.60-100.
  • 3Wang J,J Comput Sci Technol,1998年,13卷,2期,189页
  • 4周育健,硕士学位论文,1996年
  • 5Hu X H,Comput Intell,1995年,11卷,2期,323页
  • 6Shan N,Comput Intell,1995年,11卷,357页
  • 7Hu X H,Fuzzy Sets and Knowledge Discovery,1994年,90页
  • 8Ewa Or?owska. Kripke semantics for knowledge representation logics[J] 1990,Studia Logica(2):255~272
  • 9Alan Bundy. Incidence calculus: A mechanism for probabilistic reasoning[J] 1985,Journal of Automated Reasoning(3):263~283

共引文献289

同被引文献10

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部