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

一种信息系统的快速属性约简算法
引用本文:丁军,高学东.一种信息系统的快速属性约简算法[J].计算机工程与应用,2007,43(14):173-176.
作者姓名:丁军  高学东
作者单位:北京科技大学,管理学院,北京,100083
摘    要:在分析目前已有的基于Rough Set的属性约简算法后,认为计算属性的重要性的算法复杂度可以进一步降低,同时给出了一个新的较为合理的度量属性重要性的计算公式,并分析了该计算公式的性质,然后给出了一个时间复杂度为max{O|A‖U|log|U|,O(|A|2|U|)}的快速属性约简算法,最后用一个实例说明了算法的有效性。

关 键 词:粗糙集  信息系统  属性重要度  属性约简  算法复杂度
文章编号:1002-8331(2007)14-0173-04
收稿时间:2006-6-7
修稿时间:2006-09

A Quickly Attribution Reduction Algorithm of Information System
DING Jun,GAO Xue-dong.A Quickly Attribution Reduction Algorithm of Information System[J].Computer Engineering and Applications,2007,43(14):173-176.
Authors:DING Jun  GAO Xue-dong
Affiliation:College of Management,Science and Technology University of Beijing,Beijng 100083,China
Abstract:After analyzed the attribution reduction algorithm based on Rough Set that has arisen at present, we thought that the algorithm complexity of calculating importance degree of attribution could be further descended in existent attribution reduction algorithm. At the same time, a new and relatively reasonable formula measuring the importance of attribution was given, and the property of this formula was analyzed. Then we provided a quickly attribution reduction algorithm . At last, we explained the efficiency of the new algorithm with an example.
Keywords:rough set  information system  attribution importance  attribution reduction  algorithm complexity
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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