%0 Journal Article
%T The Covering Algorithm Based on Granular Computing<br>基于粒度计算的覆盖算法
%A ZHA shu
%A ZHANG Yan-Ping
%A ZHANG Ling
%A <br>赵姝
%A 张燕
%A 平张铃
%J 计算机科学
%D 2008
%I 
%X 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 uncons...
%K Granular computing
%K Quotient space
%K Covering algorithm
%K Classification<br>粒度计算
%K 商空间
%K 覆盖算法
%K 分类
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=C9AA761D5EF5467BB1CE1C50486B9A72&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=38B194292C032A66&sid=4966445AEEBA9556&eid=0DEB7A8A66C33AAD&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=12