基于粒计算的属性约简改进算法  

Improved Algorithm of Attribute Reduction Based on Granular Computing

作　　者：唐孝[1,2] 舒兰[1] 

机构地区：[1]四川师范大学数学与软件科学学院,成都610068 [2]电子科技大学数学科学学院,成都611731

出　　处：《计算机科学》2014年第B11期313-315,346,共4页Computer Science

基　　金：四川师范大学科研项目(13KYL15)资助

摘　　要：粒计算是基于问题求解、模式分类及信息处理的多层次粒结构分析方法,它是粗糙集、模糊集、数据挖掘以及人工智能等多领域交叉的一门新学科。在讨论知识粒度的基本概念和性质后,介绍了通过计算属性对约简核的重要度SigCore(A)(a)来进行信息系统约简的方法。考虑到有的信息系统没有约简核,提出了基于粒计算的约简算法的改进。改进后的算法既可以用于有约简核的系统,也可以用于没有约简核的系统。数值实验证实了算法的有效性。Granular computing is a method of multilayer granular structure analysis based on problem solving,pattern classification and information processing.It is a new multidisciplinary cross discipline between rough sets,fuzzy sets,data mining and artificial intelligence.Some important properties of granular computing were discussed as well as the reduction algorithm.The traditional reduction algorithm based on granular computing is gradually calculated with reduction Core（A）,but some information systems may have no reduction core.In this case,an improved reduction algorithm based on attribute significance of granular computing was proposed.The algorithm can be used in system with both reduction core and no reduction core.Finally,experiments show the feasibility of the algorithm.

关 键 词：粒计算 知识粒度 属性重要度 属性约简 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]