基于知识粒度的不完备决策表求核方法  

Algorithm for Computing Core Based on Knowledge Granulation in Incomplete Decision Table

作　　者：徐章艳[1] 曾艳燕[1] 

机构地区：[1]广西师范大学计算机科学与信息工程学院,广西桂林541004

出　　处：《广西师范大学学报（自然科学版）》2012年第3期154-158,共5页Journal of Guangxi Normal University:Natural Science Edition

基　　金：国家自然科学基金资助项目(60963008);广西自然科学基金资助项目(2011GXNSFA018163)

摘　　要：为降低不完备决策表求核算法的时间复杂度,本文构造了粒度二进制的差别矩阵。然后定义属性重要性及相应的核,由此设计了一个基于不完备决策表的粒度二进制差别矩阵的求核算法,并分析新算法的时间复杂度,其时间复杂度降为max{O(C U Upos),O(K C U)},优于同类算法的时间复杂度,最后用实例说明了该算法的有效性。For cutting down the time complexity of the algorithm for computing core in incomplete information system,the construction of granulation binary discernibility matrix based on knowledge granulation is presented.According to the definition of the attribute importance and the definition of core,a computing core algorithm based on the granulation binary discernibility matrix is designed,and the time complexity of the new algorithm is analyzed.The time complexity of the new algorithm is max{O（｜C｜｜U｜｜Upos｜）,O（K｜C｜｜U｜）},which is better than that of the same kind of algorithms.At last an example is used to illustrate the efficiency of the new algorithm.

关 键 词：粗糙集 不完备决策表 知识粒度 二进制差别矩阵 求核 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]