%0 Journal Article
%T Rough Entropy Based on Generalized Rough Sets Covering Reduction<br>基于广义粗集覆盖约简的粗糙熵
%A HUANG Bing
%A HE Xin
%A ZHOU Xian-Zhong
%A <br>黄兵
%A 何新
%A 周献中
%J 软件学报
%D 2004
%I 
%X In generalized rough set covering reduction theory,it is necessary to find a new measure to knowledge and rough set because the upper and lower approximations of rough sets are determined by their covering reduction.In this paper,information entropy is introduced to discuss the rough entropy of knowledge and the roughness of rough set,based on generalized rough set covering reduction.A new kind of measurement about the roughness of knowledge and rough set is presented.The conclusion that the rough entropy of knowledge and rough set decreases monotonously as the generalized rough set covering reduction becomes finer is obtained.This paper presents some useful exploration about the incomplete information system from information views.
%K rough set
%K information entropy
%K reduction
%K covering<br>粗集
%K 信息熵
%K 约简
%K 覆盖
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=C8BA434F73F33752&yid=D0E58B75BFD8E51C&vid=23CCDDCD68FFCC2F&iid=0B39A22176CE99FB&sid=1B64850025D0BBBE&eid=1D67BE204FBF4800&journal_id=1000-9825&journal_name=软件学报&referenced_num=10&reference_num=13