Results 231 to 240 of about 742,392 (286)
Efficient Rough Set Theory Merging [PDF]
Fundamenta Informaticae, 2014 Theory exploration is a term describing the development of a formal approach to selected topic, usually within mathematics or computer science, with the help of an automated proof-assistant. This activity however usually doesn't reflect the view of science considered as a whole, not as separated islands of knowledge.
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +1 more source
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 +1 more source
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2008
For further studying the theories and applications of rough sets (RS), this paper proposes a new theory on RS, which mainly includes topological space, topological properties, homeomorphism, and its properties on RS by some new definitions and theorems given.
QingE, Wu +3 more
openaire +2 more sources
For further studying the theories and applications of rough sets (RS), this paper proposes a new theory on RS, which mainly includes topological space, topological properties, homeomorphism, and its properties on RS by some new definitions and theorems given.
QingE, Wu +3 more
openaire +2 more sources
Generalizing Rough Set Theory Through Dominance-Based Rough Set Approach
2005Ordinal properties of data related to preferences have been taken into account in the Dominance-based Rough Set Approach (DRSA). We show that DRSA is also relevant in case where preferences are not considered but a kind of monotonicity relating attribute values is meaningful for the analysis of data at hand.
GRECO, Salvatore +2 more
openaire +3 more sources
Morphisms in Binary Rough Set Theory
Fundamenta Informaticae, 2020Some scholars have proposed homomorphisms between information systems based on consistent functions. However, the binary relations in the codomain induced by consistent functions thoroughly depend on the binary relations induced by the original domain systems.
openaire +1 more source
The Rough Sets Theory and Evidence Theory
Fundamenta Informaticae, 1990The aim of the paper is to show some connections between the rough sets theory and the Dempser-Shafer approach. We prove that for every Pawlak’s approximation space there exists a Dempster-Shafer space with the qualities of the lower and upper approximations of sets in the approximation space equal to the credibility and plausibility of sets in the ...
openaire +2 more sources
Rough sets theory for multicriteria decision analysis
European Journal of Operational Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GRECO, Salvatore +2 more
openaire +3 more sources
Contributions to the Theory of Rough Sets
Fundamenta Informaticae, 1999We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a pair 〈L, U〉 such that L, U are definable in the information system and L ⊆ U. In the paper, we introduce a language, called the language of inclusion-exclusion, to describe
Marek, V. Wiktor +1 more
openaire +2 more sources
Rough Approximate Operators: Axiomatic Rough Set Theory
1994In rough set theory, the upper and lower approximations are defined in terms of equivalence relation. In this paper, the reverse problem is considered. Let H and L are two abstract operators acting on the power set of U, the universe of discourse. If the two operators satisfy six axioms, then there is an equivalence relation defined on U such that H(X)
T. Y. Lin, Qing Liu
openaire +1 more source
A new rough set theory: rough soft hemirings
Journal of Intelligent & Fuzzy Systems, 2015The aim of this paper is to introduce the notion of a rough soft hemiring, which is an extended notion of a rough hemiring and a soft hemiring. We study roughness in soft hemirings with respect to Pawlak approximation spaces. Some new rough soft operations are explored. In particular, lower and upper rough soft hemirings and (k-idealistic, h-idealistic,
Zhan, Jianming, Liu, Qi, Davvaz, Bijan
openaire +2 more sources