摘要
粗集是一种处理不确定性知识的重要工具,针对粗集理论中的二进制区分矩阵的空间和时间上的不必要开销,基于动态的思想和概率论,提出了一种可降低二进制区分矩阵空间及时间开销的方法。
Rough sets is an important tool to deal with uncert ain knowledge .There i s plenty of waste of time and space in Binary Discernibility Matrix(BDM) of roug h set theory. In this paper, propose a method to decrease a lot of space and time used in BDM based on theory of probability and dynamic method.
出处
《微机发展》
2003年第6期101-103,共3页
Microcomputer Development
