| 一种高效的简化可辨识矩阵集成算法 |
| |
| 引用本文： | 张振琳,黄明.一种高效的简化可辨识矩阵集成算法[J].大连交通大学学报,2007,28(1):45-49. |
| |
| 作者姓名： | 张振琳 黄明 |
| |
| 作者单位： | 大连交通大学,软件学院,辽宁,大连,116028 |
| |
| 摘 要： | 基于可辨识矩阵的约简算法,需要生成许多无用的元素,因而算法效率不高.针对这一问题,基于动态思想,设计了一个新的集成算法,新算法在生成可辨识矩阵的过程中不用生成大量的无用元素,减少了存储量和计算量,从而使算法的效率得到提高.最后给出了一个实例说明新算法的高效性.
|
| 关 键 词： | 粗糙集 可辨识矩阵 核 |
| 文章编号： | 1673-9590（2007）01-0045-05 |
| 收稿时间： | 2006-08-20 |
| 修稿时间： | 2006年8月20日 |
An Efficient Algorithm Based on Simplication of Discernibility Matrix |
| |
| ZHANG Zhen-lin,HUANG Ming.An Efficient Algorithm Based on Simplication of Discernibility Matrix[J].Journal of Dalian Jiaotong University,2007,28(1):45-49. |
| |
| Authors: | ZHANG Zhen-lin HUANG Ming |
| |
| Institution: | School of Software, Dalian Jiaotong university, Dalian 116028, China |
| |
| Abstract: | In the attribute reduction algorithm based on discernibility matrix, many unused elements are created and the computing cost is not good. In this paper,a new integrated algorithm is designed based on dynamic considerations. It is unnecessary to create unused elements in discernibility matrix, so the new algorithm can cut down the computing and storing capacity greatly, and the new algorithm efficiency is improved remarkably, the algorithm efficiency is illustrated by an example. |
| |
| Keywords: | rough set discernibility matrix core Rough Set |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
