摘要
在随机信息系统中,根据不可辨识关系,提出了不可辨识属性矩阵的概念,证明了不可辨识属性矩阵与可辨识属性矩阵的关系,最后提出了一种基于不可辨识属性矩阵约简算法.实例研究表明,相对于可辨识属性矩阵算法,该算法在时间和存储空间上都有较大的改善和提高.
In random information systems, based on the indiscernibility relation, the concept of indiscernibility attribute matrix is proposed and the relationship between discernibility attribute matrix and indiscernibility attribute matrix is shown. Then a reduction algorithm based on indiscernibility attribute matrix is introduced. Compared with discernibility attribute matrix algorithm, from the example, this algorithm greatly reduces running time and memory space.
出处
《云南民族大学学报（自然科学版）》
CAS
2007年第4期324-326,340,共4页
Journal of Yunnan Minzu University:Natural Sciences Edition
关键词
不可辨识属性矩阵
可辨识属性矩阵
信任测度
似然测度
MASS函数
indiseernibility attribute matrix
discernibility attribute matrix
belief measure
approximation measure
mass function
