CAJ | 학술논문

针对二进制可分辨矩阵属性约简方法在处理大数据集时的不足,首先给出两种二进制可分辨矩阵属性约简的定义,并证明这两个属性约简定义与正区域的属性约简定义是等价的;然后,给出对二进制可分辨矩阵按条件属性垂直划分后进行属性约简的方法;为了进一步降低空间开销,提出将垂直分解的二进制可分辨矩阵存于外部介质中,在约简过程中,仅将所需部分调入内存,由此设计启发式属性约简算法,其时间和空间复杂度的上界分别为??(∣??∣∣??∣2)和??(∣??∣2);最后,理论分析和实验结果验证了该算法的正确性和高效性.
침대이진제가분변구진속성약간방법재처리대수거집시적불족,수선급출량충이진제가분변구진속성약간적정의,병증명저량개속성약간정의여정구역적속성약간정의시등개적;연후,급출대이진제가분변구진안조건속성수직화분후진행속성약간적방법;위료진일보강저공간개소,제출장수직분해적이진제가분변구진존우외부개질중,재약간과정중,부장소수부분조입내존,유차설계계발식속성약간산법,기시간화공간복잡도적상계분별위??(∣??∣∣??∣2)화??(∣??∣2);최후,이론분석화실험결과험증료해산법적정학성화고효성.
@@@@Attribute reduction algorithms based on binary discernibility matrix are disadvantageous to the larger database sets. To overcome above shortcoming, firstly, the two definitions of attribute reduction based on binary discernibility matrix are proposed. It is proved that attribute reductions acquired from the definitions are all equivalent to the attribute reduction based on positive region. Then the method of attribute reduction is present, which is based on the vertically partitioned binary discernibility matrix. In order to decrease the express of space, the partitioned binary attribute columns are all stored on the external space. In the process of reduction, essential part is transferred into the memory merely. Based above, a heuristic attribute reduction algorithm is designed, in which upper bounds of the time and space complexity are??(∣??∣∣??∣2) and??(∣??∣2) respectively. Finally, both of theoretical analysis and experimental results show that the algorithms are correct and efficient.