Rough集理论与KDD中属性约简算法

Rough sets theory and attribute reduction algorithm in KDD

针对数据库中知识发现 (KDD)的信息处理问题 ,给出了信息系统中的Rough集理论基本概念的形式化描述 ,并且提出了一种KDD中属性约简算法 (AR) ,实例表明该算法十分有效 .

A formalized description of the basic conception of Rough sets theory in information systems is given first, then an attribute reduction algorithm (AR) in knowledge discovery in database (KDD) is proposed along with an example, the results of the examples prove the efficiency of the AR algorithm.