摘要
目前,基于二进制差别矩阵的属性约简算法有以下不足:所得到的属性约简与基于正区域的属性约简不一致。文献[7]中给出一种基于简化的二进制差别矩阵的快速属性约简算法,但该算法不完备。分析了算法不完备的原因,在此基础上,提出了一种改进的完备算法,该算法的时间复杂度为max(O(∣C||U∣),O(∣C∣2∣U pos||U/C))。
At present, the attributes reduction algorithm based on binary discernibility matrix has the following shortcomings： The attributes reduction acquired from this algorithm is not the one acquired from positive region. Xu zhang-yan given a quick attributes reduction based on simple binary discernibility matrix, but this algorithm is not complete. Based on analyzed the reason of this, an improved complete algorithm is presented. The time complexity of the algorithm is max （O（｜C｜｜U｜）,O（｜C｜^2｜U′pos｜｜U/C｜））.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第16期3971-3973,共3页
Computer Engineering and Design
基金
湛江师范学院科研基金项目(L0602)
关键词
属性约简
正区域
决策表
简化的二进制差别矩阵
完备算法
attribute reduction
positive region
decision table
simple binary discernibility matrix
complete algorithm
