摘要
约简与核是粗糙集理论的两个重要概念 ,而直接由定义来计算约简与核是一个典型的 NP难题。发现了分辨矩阵的若干有用性质 ,利用这些性质使粗糙集理论中的求核与约简问题得以解决。进而分别讨论了无决策信息系统的约简和有决策信息系统的约简问题。最后举例说明了所得结果的有效性。
Reduction and core are two important concepts in rough set theory, while computing reductions and core according to the definitions directly is a typical NP problem. A number of useful natures of the discernable matrix is discovered, and used to solve the NP problem. The problems of reducing systems with and without decision are discussed respectively. The effectiveness of the result obtained is demonstrated by an example.
出处
《控制与决策》
EI
CSCD
北大核心
2003年第4期449-452,共4页
Control and Decision
基金
重庆市教委科研基金资助项目 (0 10 90 96 )
关键词
粗糙集
分辨矩阵
求核
约倚
Rough set
Discernable matrix
Finding core
Reduction
