全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
软件学报  2004 

Rough Entropy Based on Generalized Rough Sets Covering Reduction
基于广义粗集覆盖约简的粗糙熵

Keywords: rough set,information entropy,reduction,covering
粗集
,信息熵,约简,覆盖

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133