| 基于分治的属性约简复杂性分析 |
| |
| 引用本文： | 刘山. 基于分治的属性约简复杂性分析[J]. 计算机工程与应用, 2004, 40(20): 102-103 |
| |
| 作者姓名： | 刘山 |
| |
| 作者单位： | 中国民航学院计算机系,天津,300300 |
| |
| 摘 要： | 属性约简是粗糙集理论研究的主要内容之一,该文采用了分治策略,提出了一个新的属性约简方法,将计算整个全域上的属性约简问题转化为计算相应划分的子区域上属性约简问题。将原有计算POSX0(Y)的算法复杂度O(｜A｜｜U｜2)犤4犦降为O(｜A｜(｜Y1｜2+｜Y2｜2+……+｜Yn｜2)),对于一般比较大的｜U｜来说,明显地提高了属性约简可计算性和计算效率。
|
| 关 键 词： | 粗糙集 属性约简 分治 |
| 文章编号： | 1002-8331-(2004)20-0102-02 |
An Attribute Reduction Complexity Analysis on Divide-and-Conquer |
| |
| Liu Shan. An Attribute Reduction Complexity Analysis on Divide-and-Conquer[J]. Computer Engineering and Applications, 2004, 40(20): 102-103 |
| |
| Authors: | Liu Shan |
| |
| Abstract: | An Attribute Reduction is a mostly content which the Rough sets theory studies.The paper first advances new Attribute Reduction method to adopt divide and conquer.Attribute Reduction problem in macrocosm is translated into Attribute Reduction problem in subdomain.Original calculation POS X 0 (Y)duplicate degree drop s to O(|A|(|Y 1 | 2 +|Y 2 | 2 +......+|Y n | 2 )),for general big|U|,algorithm efficiency increases,the Attribute Reduction computability is improved. |
| |
| Keywords: | Rough sets attribute reduction divide-and-conquer |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
