一种论域递减式计算正区域方法  

Method of computing positive region by universe decrement

作　　者：姚光顺[1] 马丽生[1] 杨传健[1] 

机构地区：[1]滁州学院计算机科学与技术系,安徽滁州239000

出　　处：《计算机工程与应用》2010年第23期47-49,共3页Computer Engineering and Applications

基　　金：安徽省高校优秀青年人才基金项目No.2009SQRZ146;滁州学院自然科学基金项目No.2008kj001B~~

摘　　要：正区域的计算在粗糙集的应用中十分重要。在深入研究粗糙集基本理论的基础上,围绕不可分辨关系,得到了一种计算正区域的等价方法,提出了一种论域递减式的计算正区域的算法。该算法对论域中的样本进行分步分类,同时判断其是否属于正区域,而后将其从论域中删除,从而减轻计算量。理论分析和实例结果验证了该算法的有效性和可行性。The computing of position region is very important in the application of rough set.Based on an in-depth study of rough set theory,mainly focusing on indiscernibility relation,a equivalent method for computing positive region is proposed. Then,the detailed descriptions of the algorithm for computing of positive region is analyzed based on universe decrement. The algorithm classifies samples in universe step by step and determines whether those samples belong to position region and deletes the samples from universe to reduce computational complexity.Finally,in order to test the efficiency of the algorithm,some experiments are made.And the theoretical analysis and experimental results show that this new method is much more efficient and useful in computing.

关 键 词：粗糙集 正区域 不可分辨关系 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]