节点文献
最优近似粗糙集的矩阵计算
Matrix Computation for Optimal Approximation Rough Set
【摘要】 在粗糙集理论与应用研究中,由近似空间导出粗糙集的上、下近似集是它的核心基础。但是这种刻画只是给出一个范围,为了更精确刻画目标概念,推广粗糙集的应用,针对粗糙集的最优近似集的计算问题,提出一种基于矩阵的计算方法,为此引入布尔矩阵、关系矩阵、集合矩阵、集合相似度矩阵等定义,通过对目标概念与其近似集之间相似度讨论,得到它们之间相似度变化规律,由此建立粗糙集最优近似集的矩阵新判断与算法。最后通过实例对上述结论作进一步说明。
【Abstract】 The upper and lower approximation sets of rough sets derived from approximate space are the core foundation of the rough set theory and its applied research. However, this description only gives a range of rough sets. To depict the target concept and promote rough set application more accurately, this paper, according to the computation problem of the optimal approximate set of rough sets, proposed a calculation method based on matrixes. Then, some concepts such as Boolean matrix, relation matrix, set matrix and similarity degree matrix were introduced. By discussing the similarity degree between the target concept and its approximate set, some relevant rules were obtained. A new judgment and algorithm of optimal approximate set based on matrix for rough set was eventually established. Finally, a practical example was given to further illustrate results above.
【Key words】 rough set; optimal approximation set; similarity degree; matrix;
- 【文献出处】 华东交通大学学报 ,Journal of East China Jiaotong University , 编辑部邮箱 ,2018年04期
- 【分类号】O151.21;TP18
- 【被引频次】2
- 【下载频次】103