基于约束函数的差别矩阵及其求核算法  

Discernibility Matrix Based on Constraint Function and Algorithm of Core-computation

作　　者：周创德[1] 田卫东[1] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009

出　　处：《计算机工程》2008年第15期60-62,66,共4页Computer Engineering

基　　金：安徽省自然科学基金资助项目(050420207)

摘　　要：针对Hu的求核方法在处理某些不一致性决策表时,所得的核属性是错误的问题,提出一种基于约束函数的差别矩阵的定义及求核方法,该方法纠正了Hu方法中由于差别矩阵定义的不完善而造成的核求解错误。理论证明了该求核方法的正确性,并给出了快速求核算法。实验表明,该求核方法时空性能优于叶东毅求核方法。When performing some inconsistent decision tables, the obtained core-attributes are false by the core-computed method of Hu. Therefore, a definition of discernibility and a method of core-computation based on the constraint function are proposed, which correct the error of core solution from its imperfect for the definition of discernibility metrix in Hu＇s method. Besides, the correctness of method is proved in theory and a quick core-computed algorithm is given. Extensive experimental study shows the time and space capability outperforms the core-computed method of Ye Dongyi.

关 键 词：粗糙集 差别矩阵 核属性 

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