Results 1 to 10 of about 702,978 (335)
The Lattice of Rough Subsets of a Rough Set. The Category of Rough Sets [PDF]
The paper deals with algebraic structures related to rough sets, introduced by Pawlak in 1982. It is proved that the lattice of all rough subsets of a given rough set is a complete Heyting algebra. Necessary and sufficient conditions for the above lattice to be a Boolean algebra are presented.
Teresa Biegaǹska
openalex +4 more sources
I will analyze Pawlak’s rough sets and extend the usual setting of characterization via an equivalence relation to any arbitrary relation, or a full relation. I extract the specification of rough sets by two operators: probable operator and sure operator.
Ray-Ming Chen
doaj +4 more sources
Rough set theory gives approximation models of complex knowledge structure. Agents are not present in the definition of the rough sets. Now we will show that a set of conflicting agents or active set can be used to model inconsistent decision in rough ...
Germano Resconi, Chris Hinde
doaj +4 more sources
Soft Covering Based Rough Sets and Their Application [PDF]
Soft rough sets which are a hybrid model combining rough sets with soft sets are defined by using soft rough approximation operators. Soft rough sets can be seen as a generalized rough set model based on soft sets.
Şaziye Yüksel +2 more
doaj +2 more sources
An Attribute Reduction Method Using Neighborhood Entropy Measures in Neighborhood Rough Sets [PDF]
Attribute reduction as an important preprocessing step for data mining, and has become a hot research topic in rough set theory. Neighborhood rough set theory can overcome the shortcoming that classical rough set theory may lose some useful information ...
Lin Sun +3 more
doaj +2 more sources
Advances in fuzzy sets and rough sets
n ...
Francesco Masulli, Alfredo Petrosino
openalex +4 more sources
Elementary Rough Set Granules: Toward a Rough Set Processor
In this chapter, the basics of the rough set approach are presented, and an outline of an exemplary processor structure is given. The organization of a simple processor is based on elementary rough set granules and dependencies between them. The rough set processor (RSP) is meant to be used as an additional fast classification unit in ordinary ...
Zdzisław Pawlak
openalex +4 more sources
Some operations on rough bipolar interval neutrosophic sets [PDF]
In this study we introduce the concept of rough bipolar interval neutrosophic sets which is a combination of rough sets and bipolar interval neutrosophi sets. Also, we define union, complement, intersection and some interesting properties of this set.
V.S. Subha, P. Dhanalakshmi
doaj +1 more source
soft sets, soft rough sets, soft pre-rough sets, information system, decision making
For any real $ \beta $ let $ H^2_\beta $ be the Hardy-Sobolev space on the unit disc $ {\mathbb D} $. $ H^2_\beta $ is a reproducing kernel Hilbert space and its reproducing kernel is bounded when $ \beta > 1/2 $.
Li He
doaj +1 more source
Approximations of interval neutrosophic hyperideals in semi-hyper-rings [PDF]
This paper deals with the combination of rough sets and interval neutrosophic sets. We introduce the interval neutrosophic hyper-ideals in semi-hyper-rings. Also we study the rough interval neutrosophic hyper-ideals in semi-hyper-rings.
P. Dhanalakshmi
doaj +1 more source

