Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

In generalized rough set covering reduction theory, it is necessary to find a new measure to knowledge and rough set because the upper and lower approximations of rough sets are determined by their covering reduction. In this paper, information entropy is introduced to discuss the rough entropy of knowledge and the roughness of rough set, based on generalized rough set covering reduction. A new...

the aim of this paper is to introduce and study set- valued homomorphism on lattices and t-rough lattice with respect to a sublattice. this paper deals with t-rough set approach on the lattice theory. the result of this study contributes to, t-rough fuzzy set and approximation theory and proved in several papers. keywords: approximation space; lattice; prime ideal; rough ideal; t-rough set; set...

Attribute reduction plays an important role in the areas of rough sets and granular computing. Many kinds of attribute reducts have been defined in previous studies. However, most of them concentrate on data only, which result in the difficulties of choosing appropriate attribute reducts for specific applications. It would be ideal if we could combine properties of data and user preference in t...

A generalized multi-granulation rough set is proposed in this paper. In the new model, supporting characteristic function is defined and a parameter called information level is introduced to investigate that an object supports a concept precisely under majority granulations. Moreover, some important properties are discussed on the new multigranulation rough set. And it can be found that the pro...

The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

fuzzy rough n-ary subhypergroups are introduced and characterized.

In this paper, we extend the rough set model on two different universes in intuitionistic fuzzy approximation spaces to a single-valued neutrosophic environment. Firstly, based on the (α, β, γ)-cut relation R̃{(α,β,γ)}, we propose a rough set model in generalized single-valued neutrosophic approximation spaces. Then, some properties of the new rough set model are discussed. Furthermore, we obtai...

Rough set theory is a powerful mathematical tool for dealing with inexact, uncertain or vague information. The core concept of rough set theory are information systems and approximation operators of approximation spaces. In this paper, we study the relationships between mset relations and mset topology. Moreover, this paper concerns generalized mset approximation spaces via topological methods ...