Condition for neighborhoods in covering based rough sets to form a partition

09/25/2012
by   Hua Yao, et al.
0

Neighborhood is an important concept in covering based rough sets. That under what condition neighborhoods form a partition is a meaningful issue induced by this concept. Many scholars have paid attention to this issue and presented some necessary and sufficient conditions. However, there exists one common trait among these conditions, that is they are established on the basis of all neighborhoods have been obtained. In this paper, we provide a necessary and sufficient condition directly based on the covering itself. First, we investigate the influence of that there are reducible elements in the covering on neighborhoods. Second, we propose the definition of uniform block and obtain a sufficient condition from it. Third, we propose the definitions of repeat degree and excluded number. By means of the two concepts, we obtain a necessary and sufficient condition for neighborhoods to form a partition. In a word, we have gained a deeper and more direct understanding of the essence over that neighborhoods form a partition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2012

Condition for neighborhoods induced by a covering to be equal to the covering itself

It is a meaningful issue that under what condition neighborhoods induced...
research
07/10/2013

Applications of repeat degree on coverings of neighborhoods

In covering based rough sets, the neighborhood of an element is the inte...
research
07/04/2019

Consistent Regression using Data-Dependent Coverings

In this paper, we introduce a novel method to generate interpretable reg...
research
10/23/2019

Necessary and sufficient conditions for Boolean satisfiability

The study in this article seeks to find conditions that are necessary an...
research
09/17/2018

On Minimal Copulas under the Concordance Orde

In the present paper, we study extreme negative dependence focussing on ...
research
02/02/2023

Partitioning into common independent sets via relaxing strongly base orderability

The problem of covering the ground set of two matroids by a minimum numb...
research
09/17/2018

On Minimal Copulas under the Concordance Order

In the present paper, we study extreme negative dependence focussing on ...

Please sign up or login with your details

Forgot password? Click here to reset