| 基于分明矩阵的属性约简启发式算法 |
| |
| 引用本文： | 侯利娟,史长琼. 基于分明矩阵的属性约简启发式算法[J]. 计算机工程与设计, 2007, 28(18): 4466-4468 |
| |
| 作者姓名： | 侯利娟 史长琼 |
| |
| 作者单位： | 长沙理工大学,计算机与通信工程学院,湖南,长沙,410076;长沙理工大学,计算机与通信工程学院,湖南,长沙,410076 |
| |
| 摘 要： | 提出了基于分明矩阵的启发式知识约简算法.该算法以分明矩阵中属性出现的频率作为启发信息,通过构造新的决策表,每次选取出现个数最多的属性,直到选取的属性能够保持原决策表的分类能力,此时得到的集合即是一个约简.试验结果表明,该算法在大多数情况下都能够找到最小约简或令人满意的次优解.
|
| 关 键 词： | 粗糙集理论 决策表 分明矩阵 属性约简 启发式算法 |
| 文章编号： | 1000-7024（2007）18-4466-03 |
| 修稿时间： | 2006-10-12 |
Heuristic algorithm to rough set attribute reduction based on discernibility matrix |
| |
| HOU Li-juan,SHI Chang-qiong. Heuristic algorithm to rough set attribute reduction based on discernibility matrix[J]. Computer Engineering and Design, 2007, 28(18): 4466-4468 |
| |
| Authors: | HOU Li-juan SHI Chang-qiong |
| |
| Affiliation: | Institute of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha 410076, China |
| |
| Abstract: | An algorithm to heuristic knowledge reduction based on discernibility matrix is proposed. According to the frequency of at- tribute in discernibility matrix, a new information system is designed and the maximum attribute every time is selected, until the selected attribute can discern information system, then all selected attribute is a reduction. The practical results show that in the most cases the minimum or a feasible solution reduction is obtained using the proposed method. |
| |
| Keywords: | rough set theory decision table discernibility matrix attribute reduction heuristic Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
