摘要
基于粗糙集理论提出了一种新的规则提取算法:基于粗糙集和搜索树的规则提取算法。该算法是以现有规则集中的信息为启发信息,通过对解空间进行宽度优先启发式搜索,产生新规则。以该算法为基础,产生关于新增对象的规则,并对现有规则进行更新。
The incremental rules extraction is a focus problem of KDD. A novel rules extraction algorithm which is called ＂RDBRST＂ （Rule Derivation Based on Rough set and Search Tree） was proposed. It was one kind of width first heuristic search algorithms. The incremental rules were extracted and the current rule set was updated based on this algorithm. An example was given to illustrate the characteristics of this new incremental algorithm.
出处
《计算机应用》
CSCD
北大核心
2005年第11期2621-2623,共3页
journal of Computer Applications
基金
国家科技型中小企业技术创新基金项目(O2C26214400224)
广东省计划项目(2002A1020104)
关键词
粗糙集
搜索树
宽度优先启发式搜索
规则提取
rough set
search tree
width first heuristic search algorithm
rule derivation
