Results 31 to 40 of about 1,235,954 (283)
The Lattice of Rough Subsets of a Rough Set. The Category of Rough Sets
Demonstratio Mathematica, 1997 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.
openaire +3 more sources
The Structure of Multigranular Rough Sets [PDF]
Fundamenta Informaticae, 2020 We study multigranulation spaces of two equivalences. The lattice-theoretical properties of so-called “optimistic” and “pessimistic” multigranular approximation systems are given. We also consider the ordered sets of rough sets determined by these approximation pairs.
Jouni Järvinen, Sándor Radeleczki
openaire +4 more sources
Class-based Rough Approximation with Dominance Principle [PDF]
, 2011 Dominance-based Rough Set Approach (DRSA), as the extension of Pawlak's Rough Set theory, is effective and fundamentally important in Multiple Criteria Decision Analysis (MCDA).
Chai, Junyi, Liu, James N. K.
core +2 more sources
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Soft rough fuzzy sets and soft fuzzy rough sets
Computers & Mathematics with Applications, 2011 AbstractFuzzy set theory, soft set theory and rough set theory are mathematical tools for dealing with uncertainties and are closely related. Feng et al. introduced the notions of rough soft set, soft rough set and soft rough fuzzy set by combining fuzzy set, rough set and soft set all together.
Keyun Qin, Xiaohong Zhang, Dan Meng
openaire +2 more sources
Information completeness in Nelson algebras of rough sets induced by quasiorders
, 2012 In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson algebra can be
A. Sendlewski +22 more
core +1 more source
Constructing a Hoop Using Rough Filters
Bulletin of the Section of Logic, 2022 When it comes to making decisions in vague problems, rough is one of the best tools to help analyzers. So based on rough and hoop concepts, two kinds of approximations (Lower and Upper) for filters in hoops are defined, and then some properties of them ...
Rajab Ali Borzooei, Elham Babaei
doaj +1 more source
Parametric matroid of rough set [PDF]
, 2012 Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces.
Liu, Yanfang, Zhu, William
core
Moving in the Dark: Enlightening the Spatial Population Ecology of European Cave Salamanders
Population Ecology, EarlyView.We assessed individual interactions, movement ecology and activity patterns of a subterranean population of Speleomantes strinatii, applying spatial capture–recapture modeling to a photographic dataset of 104 individuals. ABSTRACT Space use and movement are fundamental aspects of organisms' ecology, mirroring individual fitness, behavior, and life ...
Giacomo Rosa +2 more
wiley +1 more source
Rough set theory and its applications
Journal of Telecommunications and Information Technology, 2002 In this paper rudiments of the theory will be outlined, and basic concepts of the theory will be illustrated by a simple tutorial example, concerning churn modeling in telecommunications.
Zdzisław Pawlak
doaj +1 more source