Related papers: Rough concepts
Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task. There are various approaches to deal with this, e.g., random sampling, parallelization, or attribute extraction. A so far…
Formal Concept Analysis (FCA) begins from a context, given as a binary relation between some objects and some attributes, and derives a lattice of concepts, where each concept is given as a set of objects and a set of attributes, such that…
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.…
This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…
Formal Concept Analysis and its associated conceptual structures have been used to support exploratory search through conceptual navigation. Relational Concept Analysis (RCA) is an extension of Formal Concept Analysis to process relational…
We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…
Formal concept analysis (FCA) is built on a special type of Galois connections called polarities. We present new results in formal concept analysis and in Galois connections by presenting new Galois connection results and then applying…
Covering-based rough set theory is an extension to classical rough set. The main purpose of this paper is to study covering rough sets from a topological point of view. The relationship among upper approximations based on topological spaces…
Theories of rough sets and soft sets are powerful mathematical tools for modelling various types of vagueness. Hybrid model combining a rough set with a soft set which is called soft rough set proposed by Feng et al. [3] in 2010. In this…
In relational approach to general rough sets, ideas of directed relations are supplemented with additional conditions for multiple algebraic approaches in this research paper. The relations are also specialized to representations of general…
The identification of semantic relations between terms within texts is a fundamental task in Natural Language Processing which can support applications requiring a lightweight semantic interpretation model. Currently, semantic relation…
We show how definite extended logic programs can be used for defining and reasoning with rough sets. Moreover, a rough-set-specific query language is presented and an answering algorithm is outlined. Thus, we not only show a possible…
Emergences of computers and information technological revolution made tremendous changes in the real world and provides a different dimension for the intelligent data analysis. Well formed fact, the information at right time and at right…
In 1982, the theory of rough sets proposed by Pawlak and in 2013, Luay concerned a rough probability by using the notion of Topology. In this paper, we study the rough probability in the stochastic approximation spaces by using set-valued…
Rough sets over generalized transitive relations like proto-transitive ones had been initiated by the present author in the year 2012. Subsequently, approximation of proto-transitive relations by other relations was investigated and the…
Most problems in Machine Learning cater to classification and the objects of universe are classified to a relevant class. Ranking of classified objects of universe per decision class is a challenging problem. We in this paper propose a…
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…
New concepts of rough natural number systems are introduced in this research paper from both formal and less formal perspectives. These are used to improve most rough set-theoretical measures in general Rough Set theory (\textsf{RST}) and…
Rough set theory is an important mathematical tool for dealing with uncertain or vague information. This paper studies some new topologies induced by a binary relation on universe with respect to neighborhood opera- tors. Moreover, the…
In formal concept analysis, it is well-known that the number of formal concepts can be exponential in the worst case. To analyze the average case, we introduce a probabilistic model for random formal contexts and prove that the average…