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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
