Results 311 to 320 of about 6,303,262 (343)
Some of the next articles are maybe not open access.
Double-faced rough sets and rough communication
Information Sciences, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parviz Jabedar-Maralani, Amin Mousavi
openaire +3 more sources
2007
The subject-matter of the consideration touches the problem of vagueness. The notion of the rough set, originated by Zdzislaw Pawlak, was constructed under the influence of vague information and methods of shaping systems of notions leading to conceptualization and representation of vague knowledge, so also systems of their scopes as some vague sets ...
Urszula Wybraniec-Skardowska +1 more
openaire +2 more sources
The subject-matter of the consideration touches the problem of vagueness. The notion of the rough set, originated by Zdzislaw Pawlak, was constructed under the influence of vague information and methods of shaping systems of notions leading to conceptualization and representation of vague knowledge, so also systems of their scopes as some vague sets ...
Urszula Wybraniec-Skardowska +1 more
openaire +2 more sources
Fundamenta Informaticae, 2017
In this paper we apply rough set theory to information tables induced from finite directed graphs without loops and multiples arcs (digraphs). Specifically, we use the adjacency matrix of a digraph as a particular type of information table. In this way, we are able to explore on digraphs the notions of indiscernibility partitions, lower and upper ...
Giampiero Chiaselotti +3 more
openaire +2 more sources
In this paper we apply rough set theory to information tables induced from finite directed graphs without loops and multiples arcs (digraphs). Specifically, we use the adjacency matrix of a digraph as a particular type of information table. In this way, we are able to explore on digraphs the notions of indiscernibility partitions, lower and upper ...
Giampiero Chiaselotti +3 more
openaire +2 more sources
Using rough sets for rough classification
Proceedings of 7th International Conference and Workshop on Database and Expert Systems Applications: DEXA 96, 2002Rough sets theory is emerging as a powerful tool for knowledge discovery in databases. The author introduce a rough sets based method for learning classification rules. The author's method will not necessarily derive all the consistent classification rules from a database, nor will the rules derived be totally consistent with the database.
openaire +2 more sources
2004
We study the ordered set of rough sets determined by relations which are not necessarily reflexive, symmetric, or transitive. We show that for tolerances and transitive binary relations the set of rough sets is not necessarily even a semilattice. We also prove that the set of rough sets determined by a symmetric and transitive binary relation forms a ...
openaire +2 more sources
We study the ordered set of rough sets determined by relations which are not necessarily reflexive, symmetric, or transitive. We show that for tolerances and transitive binary relations the set of rough sets is not necessarily even a semilattice. We also prove that the set of rough sets determined by a symmetric and transitive binary relation forms a ...
openaire +2 more sources
A Semantical Approach to Rough Sets and Dominance-Based Rough Sets
2016There exist two formulations of rough sets: the conceptual and computational one. The conceptual or semantical approach of rough set theory focuses on the meaning and interpretation of concepts, while algorithms to compute those concepts are studied in the computational formulation. However, the research on the former is rather limited.
Chris Cornelis +3 more
openaire +2 more sources
On Rough Equalities and Rough Equivalences of Sets
2008The different types of rough equalities [4,5,6] of sets deal with approximate equalities of sets which may not be equal in the usual sense of classical set theory. In this article, we make further study of the properties of rough equalities. A more general kind of equality of sets (we call it rough equivalence) shall be introduced, which captures ...
B. K. Tripathy +2 more
openaire +2 more sources
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2019
Shivani Singh +3 more
semanticscholar +1 more source
Shivani Singh +3 more
semanticscholar +1 more source
2001
Summary: In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic.
Mousavi, Amin, Jabedar-Maralani, Parviz
openaire +1 more source
Summary: In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic.
Mousavi, Amin, Jabedar-Maralani, Parviz
openaire +1 more source
Fuzzy rough set-based attribute reduction using distance measures
Knowledge-Based Systems, 2019Changzhong Wang +3 more
semanticscholar +1 more source