2004Unpublished venueRequires access

Rough Entropy Based on Generalized Rough Sets Covering Reduction

Bing Huang

Open publisher page 27 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Rough set, Dominance-based rough set approach, Entropy (arrow of time), Computer science, Reduction (mathematics), Data mining, Rough surface, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Rough Entropy Based on Generalized Rough Sets Covering Reduction — Research Paper | ScholarLens