摘要
在粗糙集理论中,知识约简已经成为其核心内容之一。针对相关文献中基于相容矩阵的不完备信息系统属性约简算法,提出了一种新的相容矩阵定义,该矩阵能够减少关注的条件属性。同时,也证明利用该矩阵所求的属性约简与相关文献中的属性约简是等价的。给出了其属性约简算法,提高了属性约简的速度。
In rough set theory,knowledge reduction has been one of the key contents.In this paper a new tolerance matrix is defined relative to tolerance relation-based attribute reduction algorithm under incomplete information systems in related reference.It is able to reduce the number of conditional attributes which need to be concerned.At the same time, it is proved that the attribute reduction acquired from this new method is equivalent to the attribute reduction in related reference. An algorithm for attribute reduction is presented,the speed of attribute reduction in incomplete information systems is increased.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第32期49-50,147,共3页
Computer Engineering and Applications
基金
国家自然科学基金No.60963008~~
关键词
粗糙集
属性约简
不完备信息系统
相容矩阵
rough set
attribute reduction
incomplete information systems
tolerance matrix