变论域知识约简算法  

Variable Universal Knowledge Reduction Algorithm

作　　者：王亚英[1] 张春慨[1] 邵惠鹤[1] 

机构地区：[1]上海交通大学自动化系,上海200030

出　　处：《上海交通大学学报》2002年第4期566-569,共4页Journal of Shanghai Jiaotong University

摘　　要：从论域的角度出发 ,提出了一种变论域知识约简算法 .该算法需要多次计算属性重要度 .在计算过程中 ,不但论域逐步减少 ,有助于减少计算量 ,而且相对属性集不断增加 ,有助于选择出反映特征的重要属性来 .实验证明 。From the viewpoint of the universal this paper proposed an algorithm which is called the variable universal reduction algorithm. The algorithm needs to compute the significance of the attributes many times. During computing, the universal is decreasing, which helps to decrease the computing complexity, and the relative attributes set is increasing, which conduces to select the attributes that reflect the characteristic of the system. The experimental results show that this algorithm can usually find the better relative reduction of a decision system.

关 键 词：知识约简算法 粗集 论域 属性重要度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]