Novel Graph Neighborhoods Emerging from Ideals

Abstract

Rough set theory is a mathematical approach that deals with the problems of uncertainty and ambiguity in knowledge. Neighborhood systems are the most effective instruments for researching rough set theory in general. Investigations on boundary regions and accuracy measures primarily rely on two approximations, namely lower and upper approximations, by using these systems. The concept of the ideal, which is one of the most successful and effective mathematical tools, is used to obtain a better accuracy measure and to decrease the boundary region. Recently, a generalization of Pawlak’s rough set concept has been represented by neighborhood systems of graphs based on rough sets. In this research article, we propose a new method by using the concepts of the ideal and different neighborhoods from graph vertices. We examine important aspects of these techniques and produce accuracy measures that exceed those previously = reported in the literature. Finally, we show that our method yields better results than previous techniques utilized in chemistry.

Keywords

• rough sets
• graph topology
• approximations
• ideal