摘要
针对信息表中相对核的计算采用分治策略提出了一个新的属性约简方法,将在计算整个全域上的属性约简问题转化为计算在相应划分的子区域上属性约简问题.将原有计算POSX0(Y)的算法复杂度O(|A||U|2),降为O(|A|(|Y1|2+|Y2|2+…+|Yn|2)),对于一般比较大的|U|说,效率提高非常明显,提高了属性约简的可计算性.
The paper advances a new calculation method of relative core to adopt divide and conquer. The attribute reduction problem in macrocosm is translated into the attribute reduction problem in subdomain. Original calculation of complicated degree of POS X_(0) (Y) drops to O(|A|(|Y_1|^(2)+|Y_2|^(2)+…+|Y_n|^(2))). For a comparatively big |U|, the algorithm efficiency increases very evidently and the attribute reduction computability is also improved.
出处
《海军工程大学学报》
CAS
2004年第5期68-70,共3页
Journal of Naval University of Engineering
基金
教育部科学技术研究重点项目(02038)
关键词
粗糙集
属性约简
分治
rough sets
attribute reduction
divide and conquer
