摘要
为提高基于Skowron差别矩阵的求核算法的效率,引入简化决策表的定义,给出了简化Skowron差别矩阵和相应核的定义,证明了新核与基于Skowron差别矩阵的核是一致的。提出一个基于Skowron差别矩阵的快速求核新算法,其时间复杂度和空间复杂度分别降为max{O(|C||U/C|2)O(|C||U|)}和max{O(|U|)O(|C|)}。
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 algorithm are cut down max{O（｜C｜｜U/C｜2）,O（｜C｜｜U｜）} and max{O（｜U｜）,O（｜C｜）} respectively.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第1期159-161,共3页
Computer Engineering and Applications
基金
广西省自然科学基金No.2009AM7013
广西教育厅项目(No.200807MS015)
广西师范大学博士科研基金~~
