Journal Article10.1016/S0020-0255(97)10046-9
Extensions and intentions in the rough set theory
593
TL;DR: The approach to rough set theory proposed in this paper is based on the mutual correspondence of the concepts of extension and intension, which makes it possible to formulate necessary and sufficient conditions for the existence of operations on rough sets, which are analogous to classical operations on sets.
read more
About: This article is published in Information Sciences. The article was published on 01 Jun 1998. The article focuses on the topics: Dominance-based rough set approach & Rough set.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Grained matrix and complementary matrix: Novel methods for computing information descriptions in covering approximation spaces
TL;DR: In this article , the authors proposed two new matrix methods to calculate MinD and MaxD in covering-based rough sets (CbRSs) based on the previous research work and inspired by the demand of knowledge discovery under large scale covering information systems.
8
Three-way decisions based on covering rough set
Van Thien Le,Bao Qing Hu +1 more
TL;DR: A summary of study on the three-way decisions based on covering rough set is provided by applying the approach of decision-theoretic rough set to covering decision systems.
8
Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets
TL;DR: This paper investigates whether consistent mappings can be used as homomorphism mappings between a covering based approximation space and its image with respect to twenty-two pairs of covering upper and lower approximation operators and proposes algorithms to compress covering approximations and reducing volume of the underlying data by consistency mappings.
8
A Granular Reduction Algorithm Based on Covering Rough Sets
TL;DR: An algorithm based on discernability matrixes to compute all the granular reducts of covering rough sets is developed and a discernibility matrix is simplified to the minimal format.
Closed-set lattice and modular matroid induced by covering-based rough sets
Lirun Su,William Zhu +1 more
TL;DR: It is proved that these three types of matroids induced by covering-based rough sets are all modularMatroid theory, which provides well-established platforms for greedy algorithms, is studied.
8
References
Rough sets
TL;DR: This approach seems to be of fundamental importance to artificial intelligence (AI) and cognitive sciences, especially in the areas of machine learning, knowledge acquisition, decision analysis, knowledge discovery from databases, expert systems, decision support systems, inductive reasoning, and pattern recognition.
7.2K
•Journal Article
On rough sets
TL;DR: The presented approach may be considered as an alternative to fuzzy sets theory and tolerance theory and some applications are outlined.
Restructuring lattice theory: an approach based on hierarchies of concepts
Rudolf Wille
- 12 May 2009
TL;DR: Restructuring lattice theory is an attempt to reinvigorate connections with the authors' general culture by interpreting the theory as concretely as possible, and in this way to promote better communication between lattice theorists and potential users of lattices theory.
2.5K
Information systems theoretical foundations
TL;DR: The presented approach leads to a new information systems organization and the implementation shows many advantages compared with other methods.
663
•Book
Logical foundations of knowledge representation
Ewa Orłowska,Zdzisław Pawlak +1 more
- 01 Jan 1984
TL;DR: This paper presents a meta-analyses of the models used for estimating the response of the immune system to the attacks of radiation and shows clear patterns in response to known attacks.