摘要
针对可辨识矩阵求核方法无法兼顾正确性与高效性的问题,首先从理论上证明了可辨识矩阵中单个元素与核的关系,在此基础上,设计了一种Skowron可辨识矩阵的改进方法以及基于这种改进的Skow-ron可辨识矩阵的属性核求解方法,该方法不仅适用于任何决策表信息系统,而且有效降低了计算代价.
To calueulate the core in rough set theory based on discernibility matrix with an inconsistent decision table quickly, the relationship of a single attribute of discernibility matrix and its core is discovered. An algorithm for computing the core based on an improved discernibility matrix is presented. Theoretical that the algorithm is suitable for any decision tables, and it is effective in computing the core.
出处
《大连交通大学学报》
CAS
2009年第4期55-59,共5页
Journal of Dalian Jiaotong University
关键词
粗糙集
可辨识矩阵
核
修正
rough set
discernibility matrix
core
improvement analysis show