一种核属性快速求解算法  

Quick algorithm for computing core attribute

作　　者：葛浩[1] 李龙澍[2] 杨传健[3] 

机构地区：[1]滁州学院电子信息工程系,安徽滁州239012 [2]安徽大学计算机学院,合肥230039 [3]滁州学院计算机系,安徽滁州239012

出　　处：《控制与决策》2009年第5期738-742,共5页Control and Decision

基　　金：安徽省自然科学基金项目(050420204);安徽高校省级自然科学研究项目(KJ2008B117)

摘　　要：针对求核算法存在所求得的核与基于正区域的核不一致以及算法的时间和空间复杂度不理想的问题,提出一种新的求核方法,并证明了由该方法所获得的核与基于正区域的核是一致的.利用分布计数基数排序方法设计了一种高效的等价类求解算法,在此基础上给出了快速求核算法.实验表明,所提出的算法是正确而高效的.The algorithms for computing the core have following shortcoming： The core acquired from these algorithms is not the core based on positive region, and the time complexity and space complexity are not good. Therefore, a new approach for computing core is provided and proved that the core is equivalent to the core based on positive region. The partition of the equivalence class is the key step for computing the core. An efficient algorithm for computing the equivalence class is designed with the approach based on radix sort by using distributing counting. On the foundation, the quick algorithm for computing the core is designed. The experimental result shows that the algorithm is correct and efficient.

关 键 词：粗糙集 等价类 正区域 核属性 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]