Algebraic Approach to Directed Rough Sets
Mani A, Sandor Radeleczki

TL;DR
This paper develops an algebraic framework for directed rough sets using specialized relations and neighborhood granulations, providing new semantics and applications in learning and decision making.
Contribution
It introduces a novel algebraic semantics and knowledge interpretation for directed rough sets with specialized relations and neighborhood granulations.
Findings
Conditions for complete distributivity of the lattice of local upper approximations
Representation of rough sets using upper-directed, reflexive, antisymmetric relations
Applications to student-centered learning and decision making
Abstract
In relational approach to general rough sets, ideas of directed relations are supplemented with additional conditions for multiple algebraic approaches in this research paper. The relations are also specialized to representations of general parthood that are upper-directed, reflexive and antisymmetric for a better behaved groupoidal semantics over the set of roughly equivalent objects by the first author. Another distinct algebraic semantics over the set of approximations, and a new knowledge interpretation are also invented in this research by her. Because of minimal conditions imposed on the relations, neighborhood granulations are used in the construction of all approximations (granular and pointwise). Necessary and sufficient conditions for the lattice of local upper approximations to be completely distributive are proved by the second author. These results are related to formal…
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 · Advanced Algebra and Logic
