计算机工程与应用2011，Vol.47Issue(1)：159-161,3.DOI:10.3778/j.issn.1002-8331.2011.01.044
一个计算Skowron差别矩阵核的新算法
New algorithm for computing core of Skowron discernibility matrix
摘要
Abstract
To improve the efficiency of the algorithm for computing the core of the Skowron discernibility matrix,the simplified decision table is first provided.At the same time, the simplified Skowron discernibility matrix and its corresponding core are proposed.And it is proved that the new core is the same as the core of Skowron discernibility matrix.Then a new algorithm for computing the core of Skowron discernibility matrix is designed.The time and space complexity of the new algnrithm are cut down max{O(∣C‖U/C∣2),O(∣C‖U∣)} and max{O(∣U∣), O(∣C∣)} respectively.关键词
粗糙集/Skowron差别矩阵/核/简化Skowron差别矩阵/复杂度Key words
rough set/Skowron discernibility matrix/core/simplified Skowron discernibility matrix/complexity分类
信息技术与安全科学引用本文复制引用
蒙韧,徐章艳,杨炳儒..一个计算Skowron差别矩阵核的新算法[J].计算机工程与应用,2011,47(1):159-161,3.基金项目
广西省自然科学基金(the Natural Science Foundation of Guangxi Province of China uader Grant No.2009AM7013) （the Natural Science Foundation of Guangxi Province of China uader Grant No.2009AM7013）
广西教育厅项目(No.200807MS015) （No.200807MS015）
广西师范大学博士科研基金. （）
