首页 | 官方网站   微博 | 高级检索  
     

优势信息系统中的启发式属性约简算法
引用本文:莫京兰,朱广生,吕跃进.优势信息系统中的启发式属性约简算法[J].计算机工程,2012,38(8):150-152.
作者姓名:莫京兰  朱广生  吕跃进
作者单位:广西工学院鹿山学院基础教学部;广西工学院机械工程系;广西大学数学与信息科学学院
基金项目:广西自然科学基金资助项目(桂科自0991027)
摘    要:在优势信息系统中引入粒度熵概念,定义其相关的性质和定理,并以优势关系下的粒度熵为启发式信息,给出属性的重要性度量。在此基础上提出一种基于粒度熵的启发式属性约简算法,并分析该算法的时间复杂度。通过实例说明该算法的有效性,为进一步研究优势目标信息系统的规则提取提供理论基础。

关 键 词:粗糙集  优势关系  粒度熵  属性约简  启发式算法
收稿时间:2011-09-13

Heuristic Algorithm for Attribute Reduction in Dominance Information Systems
MO Jing-lan,ZHU Guang-sheng,LV Yue-jin.Heuristic Algorithm for Attribute Reduction in Dominance Information Systems[J].Computer Engineering,2012,38(8):150-152.
Authors:MO Jing-lan  ZHU Guang-sheng  LV Yue-jin
Affiliation:1.Department of Basic Teaching,Lushan College of Guangxi University of Technology,Liuzhou 545616,China;2.Department of Mechanical Engineering,Guangxi University of Technology,Liuzhou 545006,China;3.College of Mathematics and Information Science,Guangxi University,Naning 530004,China)
Abstract:The concept of granular entropy is introduced in dominance information systems,the granular entropy based on dominance relation is defined,its related properties and theorems are gained,the significance of attribute is defined through granular entropy,with the significance of attribute as heuristic information.On this basis,a heuristic algorithm based on granular entropy for reduction of attribute is proposed,and the time complexity of the algorithm is analyzed.It illustrates that this algorithm is effective through an example,which puts forward new theoretical basis for further researching of rule extraction in target information systems based on dominance relation.
Keywords:rough set  dominance relation  granular entropy  attribute reduction  heuristic algorithm
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号