CAJ | 학술논문

给出一个简化的二进制差别矩阵的属性约简定义,并证明该属性约简的定义与基于信息熵的属性约简的定义是等价的.为求出简化的二进制差别矩阵,设计了一个快速求简化决策表的算法,其时间复杂度为O(│C││U│).在此基础上,设计了基于信息熵的简化二进制差别矩阵的快速属性约简算法,其时间复杂度和空间复杂度分别为max{O(│C││U│),O(│C│~2│U/C│~2)}和max{O(│C││U/C│~2),O(│U│)},最后用一个实例说明了新算法的高效性.
급출일개간화적이진제차별구진적속성약간정의,병증명해속성약간적정의여기우신식적적속성약간적정의시등개적.위구출간화적이진제차별구진,설계료일개쾌속구간화결책표적산법,기시간복잡도위O(│C││U│).재차기출상,설계료기우신식적적간화이진제차별구진적쾌속속성약간산법,기시간복잡도화공간복잡도분별위max{O(│C││U│),O(│C│~2│U/C│~2)}화max{O(│C││U/C│~2),O(│U│)},최후용일개실례설명료신산법적고효성.
The definition of attribution reduction of simplified binary discernibility matrix is provided.At the same time,it is proved that the above definition of attribution reduction is the same as the definition of attribution reduction based on information entropy.In order to compute simplified binary discernibility matrix,a quick algorithm for simplified decision table is designed，its time complexity is O(│C││U│).In this condition，a quick attribution reduction algorithm based on simplified binary discemibility matrix of information entropy is designed，the time complexity and space complexity of the new algorithm are max{O(│C││U│)，O(│C│~2│U/C│~2)} and max{O(│C││U/C│~2)，O(│U│)} respectively.At last，an example is used to illustrate the efficiency of the new algorithm.