%0 Journal Article
%T Rough Entropy of Rough Fuzzy Sets Based on Covering<br>基于覆盖的粗糙模糊集的粗糙熵
%A XU Fei-Fei
%A MIAO Duo-Qian
%A LI Dao-Guo
%A WEI Lai
%A <br>徐菲菲
%A 苗夺谦
%A 李道国
%A 魏莱
%J 计算机科学
%D 2006
%I 
%X Covering reduction is an efficient way of research on simplifying covering problem. On the basis of study on generalized rough sets covering reduction, roughness and rough entropy are introduced to discuss the uncertainty of rough fuzzy sets based on covering reduction, and their properties are established. Moreover, we give an example to show that, as an accuracy measure, rough entropy is better than roughness.
%K Rough fuzzy sets
%K Covering reduction
%K Roughness
%K Rough entropy<br>粗糙模糊集
%K 最简覆盖
%K 粗糙度
%K 粗糙熵
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=5D245219CE9AC3A3&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=F3090AE9B60B7ED1&sid=E114CF9BB47B65BE&eid=7EBE588F611589FC&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=11