基于粒度计算的覆盖算法  

The Covering Algorithm Based on Granular Computing

作　　者：赵姝[1] 张燕平[1] 张铃[1] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室,合肥230039

出　　处：《计算机科学》2008年第3期225-227,共3页Computer Science

基　　金：国家自然科学基金(项目批准号:60475107)资助;973计划(项目批准号:2004CB318108);国家自然科学基金(项目批准号:60675031)资助;教育部博士基金(项目批准号:20040357002)资助;安徽省教育厅重点自然科学基金(项目批准号:2006KJ015A)资助;安徽省自然科学基金(项目批准号:0504200208)资助

摘　　要：为了更好地解决高维海量数据的分类问题,本文提出一种基于粒度计算的覆盖算法。该算法以粒度计算为理论依据,指出在分析研究某一问题时,可以适当将其属性、论域或者结构粗化,求得某个商空间,在该商空间中抓住事物的本质对其研究,对某些在同一个粗粒度世界无法识别或者彼此特征区别很弱的对象可以换一个粒度世界对其分析,从而全面了解整个问题;以构造性学习算法——覆盖算法为具体实现工具,得到多个商空间中的结果,最终由商空间理论中的函数合成法获得完整结果。实验证明这种基于粒度计算的覆盖算法在解决分类问题时是行之有效的。In order to solve the classification problems of many dimensions and large amount of samples better, a covering algorithm based on granular computing is put forward in this paper. The algorithm, whose theory is granular computing, points out that the domain, characters or structure of a problem can be coarser properly when it is analyzed, and a corresponding quotient space is gotten; in the quotient space, the essence of problems can be studied. Then the samples, which are unidentified or whose features are unconspicuous, are classified in the different granular worlds easily. And with the function synthesis method in quotient space theory, different results by the covering algorithm of the different granular worlds are combined finally. The experiments show the rationality and feasibility of this algorithm when the classification problems are analyzed.

关 键 词：粒度计算 商空间 覆盖算法 分类 

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