摘要
决策表是粗集理论的处理对象,其核属性的计算往往是决策信息约简过程的出发点和关键.大多数决策表的求核方法是基于差别矩阵的,具有较高的时间复杂度和空间复杂度.基于区分表,提出一种效率更高的计算核属性的算法,并验证了算法的正确性.
The decision table is an object of rough set theory. The attribute core of a decision table is often the start point and key of many decision information system reduction procedures. Most algorithms for counting core of decision table based on discernibility matrix. They are still very complex on the demand of auxiliary space and running time. A new efficient algorithm based on distinction table is put forward to find out the core in this paper and its correctness is test.
出处
《安徽大学学报（自然科学版）》
CAS
北大核心
2007年第6期24-27,共4页
Journal of Anhui University(Natural Science Edition)
关键词
粗集
决策表
差别矩阵
区分表
核
rough set
decision table
discernibility matrix
distinction table
core
