Extension of Rough Set Based on Positive Transitive Relation
Min Shu, Wei Zhu

TL;DR
This paper introduces a new positive transitive relation to extend rough set theory, improving handling of incomplete information systems by maintaining transitivity and reducing computational complexity.
Contribution
It proposes a novel rough set extension model based on positive transitive relations, addressing limitations of existing models that discard transitivity or symmetry.
Findings
Enhanced performance in processing incomplete information systems
Reduced computational complexity compared to existing models
Better theoretical foundation for incomplete information classification
Abstract
The application of rough set theory in incomplete information systems is a key problem in practice since missing values almost always occur in knowledge acquisition due to the error of data measuring, the limitation of data collection, or the limitation of data comprehension, etc. An incomplete information system is mainly processed by compressing the indiscernibility relation. 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. In order to overcome the limitations of the current rough set extension models, we define a new relation called the positive transitive relation and then propose a novel rough set extension model built upon which. The new model holds the merit of the existing rough set extension models while avoids…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Data Mining Algorithms and Applications
