Some Topological Approaches for Generalized Rough Sets and Their Decision-Making Applications

The rough set principle was proposed as a methodology to cope with vagueness or uncertainty of data in the information systems. Day by day, this theory has proven its efficiency in handling and modeling many real-life problems. To contribute to this area, we present new topological approaches as a generalization of Pawlak’s theory by using j-adhesion neighborhoods and elucidate the relationship between them and some other types of approximations with the aid of examples. Topologically, we give another generalized rough approximation using near open sets. Also, we generate generalized approximations created from the topological models of j-adhesion approximations. Eventually, we compare the approaches given herein with previous ones to obtain a more affirmative solution for decision-making problems.

Generalized Rough Sets via Quantum Implications on Quantum Logic

This paper introduces some new concepts of rough approximations via five quantum implications satisfying Birkhoff–von Neumann condition. We first establish rough approximations via Sasaki implication and show the equivalence between distributivity of multiplication over join and some properties of rough approximations. We further establish rough approximations via other four quantum implication and examine their properties.

Two Different Views for Generalized Rough Sets with Applications

Rough set philosophy is a significant methodology in the knowledge discovery of databases. In the present paper, we suggest new sorts of rough set approximations using a multi-knowledge base; that is, a family of the finite number of general binary relations via different methods. The proposed methods depend basically on a new neighborhood (called basic-neighborhood). Generalized rough approximations (so-called, basic-approximations) represent a generalization to Pawlak’s rough sets and some of their extensions as confirming in the present paper. We prove that the accuracy of the suggested approximations is the best. Many comparisons between these approaches and the previous methods are introduced. The main goal of the suggested techniques was to study the multi-information systems in order to extend the application field of rough set models. Thus, two important real-life applications are discussed to illustrate the importance of these methods. We applied the introduced approximations in a set-valued ordered information system in order to be accurate tools for decision-making. To illustrate our methods, we applied them to find the key foods that are healthy in nutrition modeling, as well as in the medical field to make a good decision regarding the heart attacks problem.

Different kinds of generalized rough sets based on neighborhoods with a medical application

Approximation space can be said to play a critical role in the accuracy of the set’s approximations. The idea of “approximation space” was introduced by Pawlak in 1982 as a core to describe information or knowledge induced from the relationships between objects of the universe. The main objective of this paper is to create new types of rough set models through the use of different neighborhoods generated by a binary relation. New approximations are proposed representing an extension of Pawlak’s rough sets and some of their generalizations, where the precision of these approximations is substantially improved. To elucidate the effectiveness of our approaches, we provide some comparisons between the proposed methods and the previous ones. Finally, we give a medical application of lung cancer disease as well as provide an algorithm which is tested on the basis of hypothetical data in order to compare it with current methods.

Some Topological Approaches for Generalized Rough Sets via Ideals

The idea of neighborhood systems is induced from the geometric idea of “near,” and it is primitive in the topological structures. Now, the idea of neighborhood systems has been extensively applied in rough set theory. The master contribution of this manuscript is to generate various topologies by means of the concepts of j -adhesion neighborhoods and ideals. Then, we define a new rough set model derived from these topologies and discussed main features. We show that these topologies are finer than those given in the previous ones under arbitrary binary relations. In addition, we elucidate that these topologies are finer than those topologies initiated based on different neighborhoods and ideals under reflexive relations. Several examples are provided to validate that our model is better than the previous ones.

A topological reduction for predicting of a lung cancer disease based on generalized rough sets

The present work proposes new styles of rough sets by using different neighborhoods which are made from a general binary relation. The proposed approximations represent a generalization to Pawlak’s rough sets and some of its generalizations, where the accuracy of these approximations is enhanced significantly. Comparisons are obtained between the methods proposed and the previous ones. Moreover, we extend the notion of “nano-topology”, which have introduced by Thivagar and Richard [49], to any binary relation. Besides, to demonstrate the importance of the suggested approaches for deciding on an effective tool for diagnosing lung cancer diseases, we include a medical application of lung cancer disease to identify the most risk factors for this disease and help the doctor in decision-making. Finally, two algorithms are given for decision-making problems. These algorithms are tested on hypothetical data for comparison with already existing methods.

On Variable Precision Generalized Rough Sets and Incomplete Decision Tables

We present variable precision generalized rough set approach to characterize incomplete decision tables. We show how to determine the discernibility threshold for a reflexive relational decision system in the variable precision generalized rough set model. We also point out some properties of positive regions and prove a statement of the necessary condition for weak consistency of an incomplete decision table. We present two examples to illustrate the results obtained in this paper.