计算机工程2011，Vol.37Issue(11)：56-58,3.DOI:10.3969/j.issn.1000.3842.2011.11.019
不完备信息系统中一种新的求核算法
New Core Computing Algorithm in Incomplete Information System
摘要
Abstract
In incomplete information system, objects of the tolerance class and maximal consistent block in the attribute reduction algorithm based on discernibility matrix are uncertain.Aiming at the problem, this paper presents a new definition discernibility matrix and its core.And it proves that the core of this discernibility matrix is equivalent to the core based on positive region in incomplete information system.An algorithm of compute core is provided.An example illustrates that the elements of discernibility matrix in this algorithm reduce and the efficiency of computing core is improved.关键词
不完备信息系统/差别矩阵/核/属性约简/正区域Key words
incomplete information system/ discernibility matrix/ core/ attribute reduction/ positive region分类
自科综合引用本文复制引用
李晓瑜,徐章艳,王炜,杨炳儒..不完备信息系统中一种新的求核算法[J].计算机工程,2011,37(11):56-58,3.基金项目
国家自然科学基金资助项目(60963008) （60963008）
广西研究生教育创新计划基金资助项目 （）
