| 基于粗糙集理论的属性约简新算法 |
| |
| 引用本文： | 张永平,李娜.基于粗糙集理论的属性约简新算法[J].数字社区&智能家居,2009,5(5):3524-3526. |
| |
| 作者姓名： | 张永平 李娜 |
| |
| 作者单位： | 中国矿业大学计算机科学与技术学院,江苏徐州221008 |
| |
| 摘 要： | 以属性在可分辨矩阵中出现的频率作为启发，对HORAFA算法做了一些改进。引入二进制可辨识矩阵，利用二进制可辨识矩阵求出相对核。以相对核为基础，依次加入属性重要度大的属性，直到不能再加。
|
| 关 键 词： | 粗糙集 属性约简 二进制可辨识矩阵 |
A New Algorithm of Attribute Reduction Based on Discernibly Matrix |
| |
| ZHANG Yong-ping,LI Na.A New Algorithm of Attribute Reduction Based on Discernibly Matrix[J].Digital Community & Smart Home,2009,5(5):3524-3526. |
| |
| Authors: | ZHANG Yong-ping LI Na |
| |
| Affiliation: | (School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221008, China) |
| |
| Abstract: | The paper learns something from the frequency of attributes appeared in the discernibly matrix, and makes progress on the HORAFA. Lead binary discernibly matrix in, and make the discernibly function more simplify, and then find the core. The algorithm adds the most important attribute into the core until can＇t add anymore. |
| |
| Keywords: | rough sets attribute reduction binary discernibly matrix |
| 本文献已被 维普 等数据库收录！ |
