相关论文: Dialectics of Counting and Measures of Rough Theor…

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…

A dialectical rough set theory focussed on the relation between roughly equivalent objects and classical objects was introduced in \cite{AM699} by the present author. The focus of our investigation is on elucidating the minimal conditions…

The concepts of rough and definite objects are relatively more determinate than those of granules and granulation in general rough set theory (RST) [1]. Representation of rough objects can however depend on the dialectical relation between…

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…

Rough set theory is one of the most widely used and significant approaches for handling incomplete information. It divides the universe in the beginning and uses equivalency relations to produce blocks. Numerous generalized rough set models…

In this research, a general theoretical framework for clustering is proposed over specific partial algebraic systems by the present author. Her theory helps in isolating minimal assumptions necessary for different concepts of clustering…

The problem of comparing concepts of dependence in general rough sets with those in probability theory had been initiated by the present author in some of her recent papers. This problem relates to the identification of the limitations of…

Soft set theory is an important and emerging area within soft computing, owing to its attribute-oriented mathematical framework and its wide applicability in diverse domains, including science and social sciences. The theoretical…

Although some information-theoretic measures of uncertainty or granularity have been proposed in rough set theory, these measures are only dependent on the underlying partition and the cardinality of the universe, independent of the lower…

The notion of rough set captures indiscernibility of elements in a set. But, in many real life situations, an information system establishes the relation between different universes. This gave the extension of rough set on single universal…

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…

The study of mereology (parts and wholes) in the context of formal approaches to vagueness can be approached in a number of ways. In the context of rough sets, mereological concepts with a set-theoretic or valuation based ontology acquire…

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…

Up-directed rough sets are introduced and studied by the present author in earlier papers. This is extended by her in two different granular directions in this research, with a surprising algebraic semantics. The granules are based on ideas…

In this paper, using the concept of natural density, we have introduced the notion of rough statistical convergence which is an extension of the notion of rough convergence in a partial metric space. We have defined the set of rough…

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…

We study a new model theory for formal mathematical systems that we developed in a previous paper. We introduce isomorphic and homomorphic structures for formal languages, present some results and examples and conclude our paper with a…

Rough sets (RS)proved a thriving realm with successes inn many fields of ML and AI. In this note, we expand RS to RM - rough mereology which provides a measurable degree of uncertainty to those areas.

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…

This paper addresses the issues of conservativeness and computational complexity of probabilistic robustness analysis. We solve both issues by defining a new sampling strategy and robustness measure. The new measure is shown to be much less…