| 基于粗糙集理论的一种属性约简算法 |
| |
| 引用本文： | 马光志,吴黎明.基于粗糙集理论的一种属性约简算法[J].计算机工程与应用,2006,42(18):171-172,175. |
| |
| 作者姓名： | 马光志 吴黎明 |
| |
| 作者单位： | 华中科技大学计算机学院,武汉,430074 |
| |
| 摘 要： | MIBARK算法在度量属性的重要性时计算量很大,它需要多次计算不同条件属性组合与决策属性之间的互信息。论文的改进算法以属性的频率作为选择属性的启发信息,由过滤差别矩阵得到属性的频率。实验表明,在获得相同属性约简的前提下,该算法与MIBARK算法相比,属性约简的计算量较少,提高了计算速度。
|
| 关 键 词： | 粗糙集 属性约简 属性重要性 差别矩阵 频率 |
| 文章编号： | 1002-8331-（2006）18-0171-02 |
| 收稿时间： | 2005-09 |
| 修稿时间： | 2005-09 |
A Reduction Algorithm of Attribute Based on Rough Set Theory |
| |
| Ma Guangzhi,Wu Liming.A Reduction Algorithm of Attribute Based on Rough Set Theory[J].Computer Engineering and Applications,2006,42(18):171-172,175. |
| |
| Authors: | Ma Guangzhi Wu Liming |
| |
| Affiliation: | College of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074 |
| |
| Abstract: | In MIBARK algorithm,in order to define the significance of attributes,it requires very big calculating quantity.it is necessary to calculate mutual informations between the combinations of different condition attributes and the decision attributes for many times.In the improved algorithm in this paper,using frequency as the heuristic information of attributes selection,getting frequency of attributes from the filtered discernibility matrix.The experiment shows that this algorithm,obtaining the same reduction as MIBARK algorithm,requires less computational effort than the latter. |
| |
| Keywords: | rough set attribute reduction attribute significance discernibility matrix frequency |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
