Related papers: A Note on Rough Set Algebra and Core Regular Doubl…
Rough set theory models uncertainty by approximating target concepts through lower and upper sets induced by indiscernibility, or more generally, by granulation relations in data tables. This perspective captures vagueness caused by limited…
In this research a new algebraic semantics of rough set theory including additional meta aspects is proposed. The semantics is based on enhancing the standard rough set theory with notions of 'relative ability of subsets of approximation…
Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra with additional operations. A particular case of this result is that the profinite completion…
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…
Graph Spectral Clustering methods (GSC) allow representing clusters of diverse shapes, densities, etc. However, the results of such algorithms, when applied e.g. to text documents, are hard to explain to the user, especially due to…
Study of soft sets was first proposed by Molodtsov in 1999 to deal with uncertainty in a non-parametric manner. The researchers did not pay attention to soft set theory at that time but now the soft set theory has been developed in many…
We show that for any tolerance $R$ on $U$, the ordered sets of lower and upper rough approximations determined by $R$ form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only…
If $\omega_t > \beta$ for every $t \in \mathbb{N}$ and for some $\beta > 0$, then the sequence $\{\omega_t\}_{t \in \mathbb{N}}$ represents a weighted sequence of real numbers. In this article, we primarily introduce the concepts of rough…
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…
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…
The application of rough set theory in incomplete information systems is a key problem in practice since missing values almost always occur in knowledge acquisition due to the error of data measuring, the limitation of data collection, or…
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…
Given a raw knowledge in the form of a data table/a decision system, one is facing two possible venues. One, to treat the system as closed, i.e., its universe does not admit new objects, or, to the contrary, its universe is open on…
In Pawlak's rough set theory, a set is approximated by a pair of lower and upper approximations. To measure numerically the roughness of an approximation, Pawlak introduced a quantitative measure of roughness by using the ratio of the…
Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still…
Moisil in 1941, while constructing the algebraic models of n-valued {\L}ukasiewicz logic defined the set $B^{[n]}$,where $B$ is a Boolean algebra and `n' being a natural number. Further it was proved by Moisil himself the representations of…
Fuzzy rough set theory can be used as a tool for dealing with inconsistent data when there is a gradual notion of indiscernibility between objects. It does this by providing lower and upper approximations of concepts. In classical fuzzy…
In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…
Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation of various types of automata. In Bezhanishvili et al.…
Invariant Set Theory (IST) is a realistic, locally causal theory of fundamental physics which assumes a much stronger synergy between cosmology and quantum physics than exists in contemporary theory. In IST the (quasi-cyclic) universe $U$…