Related papers: Rough Concept Analysis
The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results and insights developed in the algebraic theory of modal logic, and is based on the idea that Pawlak's original…
The theory introduced, presented and developed in this paper, is concerned with an enriched extension of the theory of Rough Sets pioneered by Zdzislaw Pawlak. The enrichment discussed here is in the sense of valuated categories as…
This paper unites two problem-solving traditions in computer science: (1) constraint-based reasoning, and (2) formal concept analysis. For basic definitions and properties of networks of constraints, we follow the foundational approach of…
Medical diagnosis process vary in the degree to which they attempt to deal with different complicating aspects of diagnosis such as relative importance of symptoms, varied symptom pattern and the relation between diseases them selves. Based…
Rough set theory is a new method that deals with vagueness and uncertainty emphasized in decision making. Data mining is a discipline that has an important contribution to data analysis, discovery of new meaningful knowledge, and autonomous…
In this paper, we will be delving deeper into the connection between the rough theory and the ring theory precisely in the principle and maximal ideal. The rough set theory has shown by Pawlak as good formal tool for modeling and processing…
In order to deal with imprecision, ambiguity, and uncertainty in data analysis, Pawlak introduced rough set theory in 1982. This paper aims to expand the scope of basic set theory developed by presenting the notions of…
The theory of rough sets was firstly introduced by Pawlak (see \cite{p}). Many Mathematician has been studied the relations between rough sets and algebraic systems such as groups, rings and modules. In this paper we will introduce the…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
Based on rectangle theory of formal concept and set covering theory, the concept reduction preserving binary relations is investigated in this paper. It is known that there are three types of formal concepts: core concepts, relative…
This paper present a strong data mining method based on rough set, which can realize feature selection, classification and knowledge representation at the same time. Rough set has good interpretability, and is a popular method for feature…
Rough Set Theory (RST), first introduced by Pawlak in 1982, is an approach for dealing with information systems where knowledge is uncertain or incomplete.\cite{Pawlak} It is of fundamental importance in many subfields of artificial…
Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…
The notion of concept has been studied for centuries, by philosophers, linguists, cognitive scientists, and researchers in artificial intelligence (Margolis & Laurence, 1999). There is a large literature on formal, mathematical models of…
Formal Concept Analysis starts from a very basic data structure comprising objects and their attributes. Sometimes, however, it is beneficial to also define attributes of attributes, viz., meta-attributes. In this paper, we use Triadic…
Many techniques for handling missing data have been proposed in the literature. Most of these techniques are overly complex. This paper explores an imputation technique based on rough set computations. In this paper, characteristic…
Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…
Soft set theory and rough set theory are mathematical tools to deal with uncertainties. In [3], authors combined these concepts and introduced soft rough sets. In this paper, we introduce the concepts of soft rough graphs, vertex and edge…
Generating a huge number of association rules reduces their utility in the decision making process, done by domain experts. In this context, based on the theory of Formal Concept Analysis, we propose to extend the notion of Formal Concept…
The development of IT and WWW provides different teaching strategies, which are chosen by teachers. Students can acquire knowledge through different learning models. The problem based learning is a popular teaching strategy for teachers.…