论文部分内容阅读
序信息系统的属性约简是粗糙集理论与信息系统知识发现中的重要问题.现已有学者给出了粗糙集理论中概念与运算的布尔矩阵表示.在此基础上,介绍了序信息系统的布尔矩阵表示,并定义了布尔矩阵表示下序信息系统中属性的区分能力.给出了序信息系统上的一种基于布尔矩阵的属性约简方法,并证明了该方法与基于辨识矩阵的传统约简方法的等价性,同时还给出了判断核的等价命题以及求核方法.最后给出了基于布尔矩阵的属性约简的具体算法并通过实例分析证实了其有效性.
Attribute reduction of sequential information systems is an important issue in rough set theory and information system knowledge discovery. Now some scholars have given the Boolean matrix representation of concepts and operations in rough set theory. On this basis, , And defines the ability of Boolean matrix to distinguish the attributes in the next-level information system.An attribute reduction method based on Boolean matrix is given in order information system, and it is proved that this method is similar to that based on the recognition matrix The equivalence of the traditional reduction method and the equivalence propositions and the method of kernel checking are also given.At last, a concrete algorithm of attribute reduction based on Boolean matrix is given and its validity is proved through case analysis.