Incremental Rule-extraction Algorithms Based on Variable Precision Rough Set and Search Tree

摘要：

The incrementaI rule extraction is one of the main problems of KDD.In this paper,a novel rule extract algorithm-Rule Derivation Based on Variable Precision Rough Set and Search Tree(RDBVPRST) is pro-posed.It is a depth first heuristic search algorithm. Based on this algorithm,the incremental rules are extracted and a known rule set is updated by updating the rules’confidence degree.At last,some examples are given to illustrate the characteristics of this new incremental algorithm.

作者: Ke Xu Chuanzhen Chen

会议类型: 国际会议

会议名称: The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)

会议地点: 成都

会议语种:英文

页码: 1282-1284

在线出版日期: 2007-12-19（万方平台首次上网日期，不代表论文的发表时间）