Rough Entropy Based on Generalized Rough Sets Covering Reduction
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

黄兵,何新,周献中.基于广义粗集覆盖约简的粗糙熵.软件学报,2004,15(2):215-220

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 10,2002
  • Revised:May 10,2002
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063