Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (1): 38-38.

• 学术探讨 • Previous Articles     Next Articles

A New Discernibility Matrix and the Computation of Core

fengsheng xu   

  1. 山东省德州学院计算机系
  • Received:2005-09-13 Revised:1900-01-01 Online:2007-01-01 Published:2007-01-01
  • Contact: fengsheng xu

一种新的可区分矩阵与求核方法

徐凤生   

  1. 山东省德州学院计算机系
  • 通讯作者: 徐凤生 xfs xfs

Abstract: The problem of calculating the core attributes of a dicision table is studied,a new discernibility matrix and the computation of core is put forward in this paper,and correctness of this method is proved。 This method is the same with consistent and antipathic dicision tables。

Key words: rough set, upper approximation set, lower approximation set, attribute core

摘要: 本文对目前求核方法存在的问题进行了分析,提出了一种新的可区分矩阵与求核方法,并证明了方法的正确性,该方法适用于任何决策表(相容的或不相容的)。

关键词: 粗糙集, 上近似集, 下近似集, 属性核