首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种快速属性约简算法
引用本文:丁军,李凡,冯嘉礼.一种快速属性约简算法[J].华中科技大学学报(自然科学版),2006,34(8):40-42.
作者姓名:丁军  李凡  冯嘉礼
作者单位:1. 北京科技大学,管理学院,北京,海淀,100083
2. 华中科技大学,计算机科学与技术学院,湖北,武汉,430074
3. 上海海运学院,计算机系,上海,200135
摘    要:基于差别矩阵的属性约简算法,先要求出差别矩阵,随着问题的规模增大,存放差别矩阵的空间和算法的执行时间过大和过长,让计算机难以承受.针对这一问题,提出了差别对象对集的定义,给出了基于差别对象对的属性约简定义,并证明了该定义等价于基于差别矩阵的属性约简定义.利用差别对象对,设计了一个新的属性约简算法.由于这一算法在求属性约简的过程中不用生成差别矩阵和大量的无用元素,因而大大减少了存储量和计算量,从而提高了算法的效率.计算实例说明了新算法的高效性.

关 键 词:粗糙集  差别矩阵  属性约简  差别对象对
文章编号:1671-4512(2006)08-0040-03
收稿时间:2005-04-29
修稿时间:2005年4月29日

Speeded attribute reduce algorithm
Ding Jun,Li Fan,Feng Jiali.Speeded attribute reduce algorithm[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2006,34(8):40-42.
Authors:Ding Jun  Li Fan  Feng Jiali
Abstract:In the attribute reduction algorithm based on discernibility matrix, the discernibility matrix must be acquired firstly. But the space of storing the discernibility matrix in computer is very difficulty when the scale of the problem is very large. On the other hand, the computing cost with the algorithm is not good. The definitions of discernibility object pair set were provided. And the attribute reduction based on discernibility object pair was also provided. At the same time, it is proved that this definition is equal to the definition based on discernibility matrix. A new algorithm of attribution reduction based on the discernibility object pair was designed, and it need not create the discernibility matrix and not making those unused elements in the attribution reduction progress. So it cari cut down the computing and storing capacity greatly and the new algorithm efficiency is improved remarkably. The algorithm efficiency was illustrated with an example.
Keywords:rough set  discernibility matrix  attribution reduction  discernibility object pair
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号