Rough Sets in Graphs Using Similarity Relations
Imran Javaid, Shahroz Ali, Shahid Ur Rehman, Aqsa Shah
TL;DR
This paper applies rough set theory to graph analysis by examining orbits, indiscernibility partitions, and approximations, providing a new perspective on graph structure and properties.
Contribution
It introduces a novel approach to graph analysis using rough set concepts like orbits, indiscernibility, and approximations, expanding the application of rough set theory.
Findings
Analysis of indiscernibility partitions in graphs
Relationships between rough membership functions and graph properties
Characterization of essential sets and discernibility matrices in graphs
Abstract
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions, essential sets, discernibility matrix and their relationships for graphs.
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.