Results 251 to 260 of about 40,866 (303)
Some of the next articles are maybe not open access.
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
2017
This chapter discusses the basic preliminaries of rough set theory (RST). Since its inception, RST has been a prominent tool for data analysis due to its analysis friendly nature. RST provides a range of data structures, e.g. information systems, decision systems and approximations, to represent the real-world data.
Muhammad Summair Raza, Usman Qamar
+4 more sources
This chapter discusses the basic preliminaries of rough set theory (RST). Since its inception, RST has been a prominent tool for data analysis due to its analysis friendly nature. RST provides a range of data structures, e.g. information systems, decision systems and approximations, to represent the real-world data.
Muhammad Summair Raza, Usman Qamar
+4 more sources
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
An Approach of Proximity in Rough Set Theory
Fundamenta Informaticae, 2019In this paper, we have constructed topological structures on rough sets by choosing the path of proximity relations on approximation spaces. So, by this virtue of purpose, we have used rough metric to define nearness concept between rough sets. Some basic results have been proved on this new nearness structure named as rough proximity.
Surabhi Tiwari, Pankaj Kumar Singh 0002
openaire +2 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
Supervaluationism and rough set theory
2012 IEEE International Conference on Granular Computing, 2012In this paper, I want to propose a revised version to supervaluationists' strategy on vagueness by rough set theory. The main reason to my work is due to the very intuition about all the boundaries of vague terms must be obviously vague, i.e. not only the boundary of positive and negative extension but also the boundaries of positive or negative ...
openaire +1 more source
Rough set theory applied to lattice theory
Information Sciences, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali Akbar Estaji +2 more
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,
Jianming Zhan 0001 +2 more
openaire +2 more sources
A Rough Set Paradigm for Unifying Rough Set Theory and Fuzzy Set Theory
2007In this plenary address, we would like to discuss rough inclusions defined in Rough Mereology, a joint idea with A. Skowron, as a basis for common models for rough as well as fuzzy set theories. We would like to justify the point of view that tolerance (or, similarity) is the leading motif common to both theories and in this area paths between the two ...
openaire +1 more source