一种对角矩阵快速求正区域的方法  

Diagonal matrix method for fast computing positive region

作　　者：叶军[1] 王磊[1] 

机构地区：[1]南昌工程学院计算机科学与技术系,南昌330099

出　　处：《计算机工程与应用》2013年第8期129-132,共4页Computer Engineering and Applications

基　　金：江西省科技支撑计划资助项目(No.2009ZDG08200);江西省自然科学基金(No.2011ZBAB201005)

摘　　要：正区域是粗糙集理论中的核心概念之一,计算正区域的算法复杂度直接影响到其他算法的实现。借助于正区域的一种等价定义,提出了一种基于对角矩阵的计算正区域的方法。该方法把每次搜索到的相容对象集存放在对角矩阵的对角线上,并把已经搜索的对象进行归零处理,从而减少计算量。实例表明该方法计算方便,简单直观,能提高计算正区域的效率。Positive region is one of the core concepts in rough set theory, and the algorithm complexity for computing positive region affects implementations of the related algorithms directly. With one equivalent definition of positive region, a method for computing positive region is proposed based on diagonal matrix. In this method, every searched compatible object set is stored in the diagonal line of the diagonal matrix and the searched objects are reset to zero so as to reduce the amount of calculation. The example shows that the proposed method has advantages of conveniency for computation, simplicity and intuition, it can improve the efficiency for computation of positive region.

关 键 词：粗糙集 正区域 对角矩阵 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]