2010•Journal of Nanjing University of Science and TechnologyRequires access

Discernibility Relation-based Rough Set in Incomplete Decision System

Gang Wu

Open publisher page 0 citations

Abstract

Considering discernibility that the classical rough set approach based on indiscernibility relation rarely concerns discernibility relation,the classical rough set model is extended on the basis of discernibility relation.A discernibility relation-based rough set theory is further advanced for incomplete decision system in this paper.Indiscernibility relation reflects the commonness of things while discernibility relation displays individuality between them and the rough set model based on discernibility relation can be used to simplify negative rules.In this paper,a new discernibility relation is defined and the main properties of the lower and upper approximations are verified based on the discernibility relation before the construction of the new rough set model.The corresponding judging theorem and computing process for approximation reducts are thereby advanced.

About this research paper

What this paper is about

Considering discernibility that the classical rough set approach based on indiscernibility relation rarely concerns discernibility relation,the classical rough set model is extended on the basis of discernibility relation.A discernibility relation-based rough set theory is further advanced for incomplete decision system in this paper.Indiscernibility relation reflects the commonness of things while discernibility relation displays individuality between them and the rough set model based on discernibility relation can be used to simplify negative rules.In this paper,a new discernibility relation is defined and the main properties of the lower and upper approximations are verified based on the discernibility relation before the construction of the new rough set model.The corresponding judging theorem and computing process for approximation reducts are thereby advanced.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Considering discernibility that the classical rough set approach based on indiscernibility relation rarely concerns discernibility relation,the classical rough set model is extended on the basis of discernibility relation.A discernibility relation-based rough set theory is further advanced for incomplete decision system in this paper.Indiscernibility relation reflects the commonness of things while discernibility relation displays individuality between them and the rough set model based on discernibility relation can be used to simplify negative rules.In this paper,a new discernibility relation is defined and the main properties of the lower and upper approximations are verified based on the discernibility relation before the construction of the new rough set model.The corresponding judging theorem and computing process for approximation reducts are thereby advanced.

Key concepts: Rough set, Relation (database), Mathematics, Dominance-based rough set approach, Set (abstract data type), Basis (linear algebra), Algorithm, Data mining

Related papers

Back to paper searchBrowse research topicsOriginal source
Discernibility Relation-based Rough Set in Incomplete Decision System — Research Paper | ScholarLens