2009•Unpublished venueRequires access

The model of bidirectional PS-Rough Sets in probabilistic approximation space and its application

Yanjun Zhao, Chunying Zhang

Abstract

On the basis of rough sets, by considering both the dynamic characteristics of the set x and the statistics information in the knowledge database, this paper constructs bidirectional probabilistic PS-rough sets model in probabilistic approximation space, discusses property and theorems of PS-rough sets, proves that PS-rough sets is the further extension of S-rough sets and Z.Pawlak rough sets, S-rough sets and Z.Pawlak rough sets is the special case of PS-rough sets. Comparing with S-rough sets, the approximation quality of the dynamic set X* in PS-Rough Sets is relatively increased and then the decision accuracy is improved. Finally, the efficiency of PS-rough sets is shown by an example.

About this research paper

What this paper is about

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

Key concepts: Rough set, Dominance-based rough set approach, Probabilistic logic, Extension (predicate logic), Mathematics, Basis (linear algebra), Space (punctuation), Property (philosophy)