Online Program Home
  My Program

All Times EDT

Abstract Details

Activity Number: 210 - SLDS CSpeed 3
Type: Contributed
Date/Time: Tuesday, August 10, 2021 : 1:30 PM to 3:20 PM
Sponsor: Section on Statistical Learning and Data Science
Abstract #318002
Title: Extension of Rough Set Based on Positive Transitive Relation
Author(s): Min Shu and Wei Zhu
Companies: University of Wisconsin Stout and Stony Brook University
Keywords: Rough Set; Incomplete Information Systems; Positive Transitive Relation; Similarity Relation; Discernibility Matrix; Tolerance Relation
Abstract:

The application of rough set theory in incomplete information systems is a key problem in practice. The existing rough set extension models based on tolerance or symmetric similarity relations typically discard one relation among the reflexive, symmetric and transitive relations, especially the transitive relation. To overcome these limitations, we define a new relation called the positive transitive relation and then propose a novel rough set extension model. The new model holds the merit of the existing rough set extension models while avoids their limitations of discarding transitivity or symmetry. In comparison to the existing extension models, the proposed model has a better performance in processing the incomplete information systems while substantially reducing the computational complexity, taking into account the relation of tolerance and similarity of positive transitivity. In summary, the positive transitive relation can improve current theoretical analysis of incomplete information systems and the newly proposed extension model is more suitable for processing incomplete information systems and has a broad application prospect.


Authors who are presenting talks have a * after their name.

Back to the full JSM 2021 program