We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a pair hL; U i such that L; U are deenable in the information system and L U. In the paper, we introduce a language, called the language of inclusion-exclusion, to describe incomplete speciications of (unknown) sets. W...

Classification of voluminous protein data based on the structural and functional properties is a challenging task for researchers in bioinformatics field. In this paper a faster, accurate and efficient classification tool Rough Set Protein Classifier has been developed which has a classification accuracy of 97.7%. It is a hybridized tool comprising Sequence Arithmetic, Rough Set Theory and Conc...

We present a survey of clustering methods based on rough set data analysis.

In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is described using a non-deterministic matrix (Nmatrix)....

This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems.  All of the lower and upper approximatio...

Probabilistic approaches have been applied to the theory of rough set in several forms, including decision-theoretic analysis, variable precision analysis, and information-theoretic analysis. Based on rough membership functions and rough inclusion functions, we revisit probabilistic rough set approximation operators and present a critical review of existing studies. Intuitively, they are define...

A rough set is a formal approximation of a crisp set which gives lower and upper approximation of original set to deal with uncertainties. The concept of neutrosophic set is a mathematical tool for handling imprecise, indeterministic and inconsistent data. In this paper, we defne concepts of Rough Neutrosophic algebra and investigate some of their properties.