In this paper, we explore a new variational model based on the fractional derivative and total variation.Due to some metrics, our approach shows great results compared to other competitive models.In particular, deleting the noise and preserving edges, features and corners are headlights to our approach.For the fractional variable-order derivatives, different discretizations were presented to comparison.The theoretical results are validated by the Primal Dual Projected Gradient (PDPG) Algorithm which is well adapted to the fractional calculus.
1.
Introduction
The rough set (RS) theory and its extensions have garnered increasing attention, particularly in computer science, artificial intelligence, and medical applications. Though other uncertainty theories, such as fuzzy or grey, and hybrid theories such as fuzzy-rough, have their merits, RS offers distinct advantages. Unlike the fuzzy theory, which relies on membership degrees, RS handles incomplete knowledge by classifying objects based on equivalence relations, thus allowing for the determination of information completeness within a set. Similarly, the RS provides a structured approach to handle uncertainty, which distinguishes it from the grey theory. Moreover, the RS theory's flexibility in dealing with imprecise and uncertain data sets outshines hybrid theories such as fuzzy-rough, which may face challenges in balancing complexity and interpretability. By focusing on these theories, we aim to underscore the novelty and significance of our research. We provide a comparative analysis in Table 1, outlining the advantages and limitations of the RS theory against other uncertainty theories, thereby emphasizing the unique contributions and potential applications of our proposed approach.
Pawlak's pioneering work in 1982 [1,2] established RS theory as an effective tool to handle incomplete knowledge by classifying objects based on equivalence relations, thus allowing for the determination of information completeness within a set. The fundamental principles of this theory include approximation operators and accuracy measures, which provide crucial insights to decision-makers regarding the structures and sizes of the boundary regions. However, the strict requirement of an equivalence relation limits the applicability of the traditional RS theory. These limitations have driven researchers to propose various generalizations that use either arbitrary or specific relations to broaden the scope of the theory. Yao [3] initiated this line of research in 1996, which led to the emergence of numerous proposals that present generalized rough sets, such as tolerance [4], similarity [5,6], quasi-order [7], and general relations [8,9,10]. These advancements have significantly expanded the applicability of the RS theory.
In 2014, Abd El-Monsef et al. introduced the concept of the k-neighborhood space (k-NS), which provided a generalized framework derived from binary relations [11]. This expansion extended Pawlak's model by incorporating various induced topologies. Subsequently, many researchers used these models to increase the applications of topology in RS's, resulting in various generalizations of this theory from a topological perspective. For instance, in 2020, Nawar et al. [12] applied the k-NS concept to develop and establish the concept of adhesion neighborhoods within the context of generalized covering approximation spaces [13], thereby building upon the concept of adhesion sets [14]. Additionally, in the same year, Atef et al. [15] developed the k-NS concept to introduce eight generalized types of neighborhoods (k-adhesion neighborhoods), thereby proposing different models to generalize Pawlak's theory. However, El-Bably et al. identified numerous errors in this research and provided corrections and significant results in [16]. In another trajectory of k-neighborhood exploration, El-Bably and Al-shami introduced core minimal-neighborhoods [17], extending Pawlak RSs into various generalized forms. They applied these forms in a significant medical context related to lung cancer diseases. The topologies derived from Abd El-Monsef et al.'s method have enabled diverse topological applications in RS's approaches, particularly in medicine [18,19,20] and economics [21,22]. In 2022, El-Bably et al. [23] explored new generalized closure spaces via binary relations using the k-NS concept, leading to new RS formulations and an enhanced granularity, significantly impacting real-life applications using soft RS's methodologies [24,25,26,27,28]. Several subsequent works, explored fuzzy RS's approaches [29,30], ideal structures [31], and corrections to prior methodologies [32], have expanded on these foundations, employing topological properties to define RS's methodologies and their medical applications [33,34,35,36,37]. These explorations underscore the potential of k-NS in advancing neighborhood-based concepts.
Despite these advancements, gaps remain in fully leveraging topological concepts within the RS theory. While powerful, traditional RS methods face limitations due to the stringent requirements of equivalence relations. Researchers have sought to address these limitations through generalizations and by introducing new structures. For instance, the pursuit of more general results and valid solutions has led to the development of structures such as Aczel-Alsina power Bonferroni aggregation operators for picture fuzzy information and decision analyses [38], hesitant fuzzy linguistic multigranulation decision-theoretic RS's [39], generalized Z-fuzzy soft β-covering [40], rough neutrosophic matrices [41], and rough set-based bipolar approaches [42].
Building on this trajectory and the models of Abd El-Monsef et al. (k-NS), this study introduces new rough approximation operators inspired by topological structures to enhance the applicability of (RS) models inspired by general binary relations, free from constraints but inherently topological in nature. These models aim to bridge rough set theory and topology, addressing critical challenges and broadening the applicability of RS theory. The proposed methods are based on the concept of "basic-minimal neighborhoods", which extends the idea of "basic neighborhoods". The notion of "basic-neighborhoods" was initially introduced by Abu-Gdairi et al. [9] as a counterpart to "initial neighborhoods" [19] that proposed in 2021. Additionally, in the same year, a related idea referred to as "containment neighborhoods" was described in [43], where rough sets were applied within the framework of the k-NS model developed by Abd El-Monsef et al. [11]. However, the study in [43] did not thoroughly examine the associated topological properties or provide a detailed construction of corresponding topologies.
Subsequently, El-Gayar et al. [21] expanded the concept of "basic-neighborhoods" by defining four distinct types of neighborhoods, analyzing their topological properties, and proposing methods for constructing associated topologies. These advancements were also applied in economic decision-making contexts. Moreover, the term “initial-neighborhoods” was redefined as "subset neighborhoods" in 2022, as noted in [44].
The key motivations for exploring RS models from a topological perspective are as follows:
1) To alleviate some conditions imposed on the topological RS models, thereby expanding their applications;
2) To preserve most of Pawlak's properties of approximation operators, which were often lost in previous topologically derived methods [3,6,8,9,11];
3) To ensure that the values of accuracy and roughness satisfy the monotonic property, making the approach more suitable to analyze large samples; and
4) To demonstrate that the approximation operators obtained are superior to those defined by either the topological structures or binary relations, as well as the models presented in the literature in aiding decision-making for medical diagnoses and other applications.
Initially, we introduce four new types of neighborhoods, which are extensions of other neighborhoods, such as those in the method by Abd El-Monsef et al. in [11]. These neighborhoods are called "basic-minimal neighborhoods" and are fundamentally based on the concept of "basic-neighborhoods" introduced by Abu-Gdairi et al. in [9]. Then, we examine the properties of these neighborhoods and their relationships with other types. Based on these neighborhoods, we propose four different approximation models, study their fundamental properties and mutual relationships, and identify the best and strongest among them in terms of the highest accuracy factor. These approximations are compared with the previous methods mentioned in the references through counterexamples and theoretical proofs, demonstrating their accuracy and robustness. It is worth noting that the proposed models can be compared with recent advancements, including ternary models [39,43], thus highlighting improvements in the accuracy and generalization.
One of the principal contributions of this paper is the introduction of topological structures for these approximations, thus linking the approximation theory to topology and its applications. This connection facilitates further applications of topological concepts within the RS theory. We discuss and study methods to generate different topologies from the neighborhoods (basic-minimal neighborhoods) and prove that the basic-minimal lower and basic-minimal upper approximations represent the interior and closure operators of these topologies. Therefore, we initiate a new bridge to apply more topological concepts using the suggested approaches in the RS theory.
In the realm of medical diagnostics, particularly in the context of heart failure diagnoses, our primary focus revolves around the development of an accurate diagnostic methodology. This endeavor finds its application in the medical field, thereby leveraging data gathered from a study that involved 12 patients conducted at Al-Azhar University's Cardiology Department, within the premises of Sayed Galal University Hospital in Egypt [44]. Through this application, we demonstrate the effectiveness of our proposed methodology, showcasing a remarkable 100% accuracy coefficient, seamlessly aligning with the diagnoses made by physicians as documented in the dataset. In stark contrast, previous methods have faltered in delivering precise diagnoses for this condition. Our work signifies a notable breakthrough in mathematical modeling. Not only does it bolster the accuracy of decision-making processes, but it also furnishes a comprehensive framework for deciphering medical data pertinent to heart failure diagnoses. By implementing our methodology on the provided dataset, we achieve results that mirror the diagnoses rendered by medical professionals, thus accurately discerning patients with heart failure from their healthy counterparts. While other methods failed to accurately identify the infected patients from healthy ones, this reflects the superiority of our methods in medical diagnoses. Hence, it is evident that the methodologies elucidated in this paper hold promise for revolutionizing medical diagnostics, potentially streamlining processes, and conserving invaluable time and resources for patients and healthcare providers alike.
The rest of this paper is organized as follows.
Section 2 discusses the fundamental principles and results of the RS's and their generalizations.
Section 3 introduces the new concept of "basic-minimal neighborhoods", detailing their properties and interrelationships.
Section 4 is the principal section of this paper, presenting the primary contributions by introducing four distinct RS approximation approaches, referred to as basic-minimal approximations, utilizing these neighborhoods. This section is structured into three subsections:
Subsection 4.1 proposes four different RS approximations. Their fundamental properties are analyzed, demonstrating that they satisfy Pawlak's core axioms without any constraints or conditions. Additionally, the relationships among these approximations are examined, and the best method is identified based on the higher accuracy factor.
Subsection 4.2 explores the generation of different topologies from basic-minimal neighborhoods and proves that the approximations introduced in 4.1 represent the closure and interior operators for these topologies. This establishes connections between the RS theory and topology, thereby facilitating further topological applications. Moreover, these topological structures and their properties are studied.
Subsection 4.3 compares the proposed approximations with previous ones, such as those by Yao [3], Dai et al. [6], Allam et al. [8], and Abd El-Monsef et al. [11]. This comparison demonstrates the superiority of the proposed methods over the previous approaches through counterexamples and proven theorems in various specific and general cases.
Section 5 investigates the effectiveness of our approach to analyze heart failure data, showcasing its clinical significance. Additionally, an algorithm and flowchart are developed to illustrate how basic-minimal exact sets are determined and used in decision-making problems.
Section 6 presents the conclusions, strengths, and advantages of the proposed approaches and discusses potential future research directions.
2.
Basic concepts
In this section, we review the principles and results related to RS's concepts and k-NS that are essential to understand the context of this manuscript. Additionally, we discuss the historical development of several previous approaches and the motivations behind their study. Additionally, we provide proofs for some key results and properties of these approaches.
2.1. Abd El-Monsef et al. approaches
Definition 2.1. [3,8,11] The k-neighborhood of p∈℧, indicated by Nk(p) for all k∈K, induced by a binary relation R on a non-empty finite set ℧, where K={r,l,i,u,⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, is given by the following:
a. r-neighborhood [3]: Nr(p)={q∈℧:pRq};
b. l-neighborhood [3]:Nl(p)={q∈℧:qRp};
c. ⟨r⟩-neighborhood [8]: N⟨r⟩(p)={⋂p∈Nr(q)Nr(q),ifp∈Nr(q)Φ,Otherwise;
d. ⟨l⟩-neighborhood [8]:N⟨l⟩(p)={⋂p∈Nl(q)Nl(q),ifp∈Nl(q)Φ,Otherwise;
e. i-neighborhood [11]: Ni(p)=Nr(p)∩Nl(p);
f. u-neighborhood [11]: Nu(p)=Nr(p)∪Nl(p);
g. ⟨i⟩-neighborhood [11]: N⟨i⟩(p)=N⟨r⟩(p)∩N⟨l⟩(p); and
h. ⟨u⟩-neighborhood [11]: N⟨u⟩(p)=N⟨r⟩(p)∪N⟨l⟩(p).
Note that: The neighborhood Nr(p) (resp. Nl(p)) is called the 'right' (resp. 'left') neighborhood of an element p∈℧, which was first provided by Yao [3]. Moreover, the neighborhood N⟨r⟩(p) (resp. N⟨l⟩(p)) is called the 'minimal-right' (resp. 'minimal-left') neighborhood of an element p∈℧, which was first provided by Allam et al. [8].
Definition 2.2. [11] Let R be a binary relation defined on ℧ and Fk:℧⟶P(℧) be a mapping that assigns its k-neighborhood in P(℧) to each p∈℧. Then, the triple (℧,R,Fk) is termed a k-neighborhood space, and is abbreviated as k-NS.
Theorem 2.1. [11] Let (℧,R,Fk) be a k-NS; then, for each k∈K, the collection Tk={O⊆℧:∀p∈O,Nk(p)⊆O} represents a topology on ℧.
Definition 2.3. [11] If (℧,R,Fk) is a k-NS. A subset O⊆℧ is considered an k-open set if O∈Tk, and its complement is termed a k-closed set. The family Ck of all k-closed sets of a k-NS is defined as Ck={O⊆℧:Oc∈Tk}.
Definition 2.4. [11] Let (℧,R,Fk) be a k-NS. Hence, the k-lower and k-upper approximations of O⊆℧ are assumed, respectively, as:
Here, intk(O)(resp. clk(O)) represents the k-interior (resp. k-closure) of O.
The k-boundary, k-positive, and k-negative regions of O are provided, respectively, as follows:
The k-accuracy of the approximations is given by the following:
Definition 2.5. [11] Let (℧,R,Fk) be a k-NS and O⊆℧. Then, O is called a k-exact set if R_k(O)=¯Rk(O)=O. If not, it is k-rough. It is clear that 0≤γk(O)≤1 and γj(O)=1 if O is a k-exact set. Otherwise, it is k-rough.
2.2. Yao approach
Definition 2.6. [3] Consider a k-NS (℧,R,Fk). We describe the Yao-lower, denoted as Y∗(O), and the Yao-upper, Y∗(O), approximations of a subset O⊆℧ as follows:
The Yao-boundary, Yao-positive, and Yao-negative regions of O are defined as follows:
● The Yao-boundary B(O) comprises points in O whose neighborhoods partially intersect with O and partially lie outside of it.
● The Yao-positive region pos(O) includes points in O for which the r-neighborhood is entirely contained within O.
● The Yao-negative region neg(O) encompasses points in ℧ outside of O whose neighborhoods do not intersect with O.
The k-accuracy of the approximations is given by the following:
2.3. Allam et al. approach
Definition 2.7. [8] Suppose we have a k-NS (℧,R,Fk), where each k=⟨r⟩. In this context, we describe the Minimal-lower and Minimal-upper approximations of a subset O⊆℧ by the following:
● The Minimal-lower approximation, denoted as A_k(O), comprises points p in ℧ for which the k-neighborhood of p is entirely contained within O.
● Similarly, the Minimal-upper approximation, denoted as ¯Ak(O), consists of points p in ℧ for which the k-neighborhood of p intersects with O.
Now, let's define the regions associated with O:
● The Minimal-boundary region, denoted as Bk(O), encompasses points in O whose k-neighborhoods partially intersect with O and partially lie outside of it;
● The Positive region, denoted as POSk(O), includes points in O for which the k-neighborhood is entirely contained within O;
● The Negative region, denoted as NEGk(O), covers points in in ℧ outside of O whose k-neighborhoods do not intersect with O; and
● The Maximal-accuracy of the approximations is given by the following:
2.4. Dai et al. approach
Definition 2.8. [6] Let (℧,R,Fk) be a k-NS. Then, the maximal-neighborhood of p∈℧ is well-defined as follows:
Definition 2.9. [6] Let (℧,R,Fk) be a k-NS. Then, the Maximal-lower and Maximal-upper approximations of O⊆℧ are well-defined, respectively, as follows:
The Maximal-boundary (resp. positive and negative) regions of O are given, respectively, as follows:
The Maximal-accuracy of the approximations is given by the following:
Lemma 2.1. [6,8] Let R be a binary relation on ℧:
(ⅰ) If q∈Nk(p), then Nk(q)⊆Nk(p), for each k∈{⟨r⟩,⟨l⟩,⟨i⟩}; and
(ⅱ) If q∈Nm(p), then Nm(q)⊆Nm(p).
Proof.
(ⅰ) In the paper [8], the property was proven for each k=⟨r⟩. Therefore, we can similarly prove the other cases; and
(ⅱ) The property was proven in [6].
Lemma 2.2. If R constitutes a reflexive relation on ℧, then for every p∈℧, the following holds:
(ⅰ) p∈Nk(p) for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}; and
(ⅱ) p∈Nm(p).
Proof. We will explain the first statement in a case of k=⟨r⟩ and the others similarly.
If R is reflexive, then p∈Nr(p), ∀p∈℧. Thus ⋂p∈Nr(q)Nr(q)≠Φ and we get:
Lemma 2.3. If R is a reflexive relation on ℧, then for every p∈℧, the following holds:
(ⅰ) N⟨r⟩(p)⊆Nr(p)⊆Nm(p); and
(ⅱ) N⟨k⟩(p)⊆Nk(p), for each k∈{r,l,i,u}.
Proof. By using Definitions 2.1 and 2.8, the proof is clear.
According to Theorem 2.1, we can generate a general topology by using the maximal-neighborhoods as the following result illustrates.
Theorem 2.2. Let (℧,R,Fk) be a k-NS; then, the class Tm={O⊆℧:∀p∈O,Nm(p)⊆O} represents a topology on ℧.
3.
Basic minimal-neighborhoods and their properties
This section is dedicated to the generalization of the idea of the 'basic neighborhood' [9] into new types, thereby yielding four distinct topologies derived from these neighborhoods. It is worth noting that this definition was also referred to as a "containment neighborhood" in [43].
Definition 3.1. Assume that R is a binary relation on ℧. Then, we define the following neighborhoods of p∈℧:
(ⅰ) Basic ⟨r⟩-neighborhood: Nb⟨r⟩(p)={q∈℧:N⟨r⟩(q)⊆N⟨r⟩(p)};
(ⅱ) Basic ⟨l⟩-neighborhood: Nb⟨l⟩(p)={q∈℧:N⟨l⟩(q)⊆N⟨l⟩(p)};
(ⅲ) Basic ⟨i⟩-neighborhood: Nb⟨i⟩(p)=Nb⟨r⟩(p)∩Nb⟨l⟩(p); and
(ⅳ) Basic ⟨u⟩-neighborhood: Nb⟨u⟩(p)=Nb⟨r⟩(p)∪Nb⟨l⟩(p).
In the following, we illustrate some characteristics of the aforementioned neighborhoods.
Lemma 3.1. Suppose there exists a binary relation R defined on ℧. Thus, the following holds:
(ⅰ) p∈Nbk(p),∀k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩};
(ⅱ) Nbk(p)≠Φ, ∀k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}; and
(ⅲ) If q∈Nbk(p), then Nbk(q)⊆Nbk(p), for each k∈{⟨r⟩,⟨l⟩,⟨i⟩}.
Proof. First, (ⅰ) and (ⅱ) are obvious. Now, we prove (ⅲ) in a case k=⟨r⟩, and the others similarly.
If q∈Nb⟨r⟩(p), then
Let w∈Nb⟨r⟩(q); then, N⟨r⟩(w)⊆N⟨r⟩(q). Therefore, by Eq (3.1), N⟨r⟩(w)⊆N⟨r⟩(p) implies w∈Nb⟨r⟩(p). Hence, Nb⟨r⟩(q)⊆Nb⟨r⟩(p).
Remark 3.1. Example 3.1 highlights the following observations:
(ⅰ) The statement (ⅲ) of Lemma 3.1 does not hold true in the case of k=⟨u⟩.
(ⅱ) In the general case, for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, the basic k-neighborhoods and the k-neighborhoods are independent (non-comparable) when R is a binary relation on ℧.
Example 3.1. Let ℧={z1,z2,z3,z4} and R={(z1,z1),(z1,z4),(z2,z1),(z2,z3),(z3,z4), (z3,z1)} be a binary relation on ℧. Consequently, we obtain the following tables (Tables 2–4) which contain all neighborhoods generated by R.
The proof of the following lemma is easy; therefore, we omit it.
Lemma 3.2. Let R be a binary relation on ℧. Then, for every p∈℧, the following holds:
(ⅰ) Nb⟨i⟩(p)⊆Nb⟨r⟩(p)⊆Nb⟨u⟩(p); and
(ⅱ) Nb⟨i⟩(p)⊆Nb⟨l⟩(p)⊆Nb⟨u⟩(p).
The following lemma examines the connection between basic the k-neighborhoods and the k-neighborhoods, where k ranges over {⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}.
Lemma 3.3. In a k-NS (℧,R,Fk), where R is a reflexive relation, ∀k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, the basic k-neighborhoods Nbk(p) are equivalent to the k-neighborhoods Nk(p) for all p∈℧.
Proof. We demonstrate the lemma for k=⟨r⟩, with similar reasoning applicable to other cases.
First, according to Definition 3.1, if q∈Nb⟨r⟩(p), then
Given that R is reflexive, q∈N⟨r⟩(q). Hence, Eq (3.2), q∈N⟨r⟩(p), which implies that Nb⟨r⟩(p)⊆N⟨r⟩(p), for all p in ℧.
Conversely, utilizing Lemma 2.1, if q∈N⟨r⟩(p), then N⟨r⟩(q)⊆N⟨r⟩(p), implying q ∈Nb⟨r⟩(p). Therefore, N⟨r⟩(p)⊆Nb⟨r⟩(p), for all p in ℧.
Corollary 3.1. Let (℧,R,Fk) be a k-NS where R is an equivalence relation; then, Nbk(p)=Nk(p)=[p]R, for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, and [p]R signifies the equivalence class of p∈℧.
Lemma 3.4. Let (℧,R,Fk) be a k-NS where R is a reflexive relation; then, ∀k∈{r,l,i,u} and the following holds:
(ⅰ) Nb⟨k⟩(p)⊆Nk(p), ∀p∈℧; and
(ⅱ) Nb⟨k⟩(p)⊆Nm(p),∀p∈℧.
Proof. Utilizing Lemmas 2.3 and 3.3, the proof becomes self-evident.
Remark 3.2. Example 3.2 illustrates that the following:
(ⅰ) Illustrating Lemma 3.3.
(ⅱ) The converse of Lemma 3.4 is not generally true.
Example 3.2. Let ℧={z1,z2,z3,z4} be a set, and let R be a reflexive relation on ℧ defined as follows: R={(z1,z1),(z2,z2),(z3,z3),(z4,z4),(z1,z2),(z2,z3)}. The undermentioned Tables 5–7 illustrate the neighborhoods generated by R.
4.
Basic-minimal rough approximations and topological applications
In this section, which is divided into three subsections, we delve into a comprehensive analysis of various RS approximations (basic-minimal approximations) and their implications. Through a systematic exploration, we aim to elucidate the relationships between the RS theory and topology, paving the way for an enhanced understanding and practical applications in both domains.
4.1. Generalized rough sets based on basic minimal-neighborhoods
In this subsection, we introduce four distinct RS approximations (called basic-minimal approximations), dissecting their core properties and establishing their adherence to Pawlak's fundamental axioms. Furthermore, we conduct a comparative analysis to identify the most effective approximation method based on its accuracy factor.
Definition 4.1. Let (℧,R,Fk) be a k-NS where k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}. The basic-minimal lower and upper approximations of a subset O⊆℧ are formally defined as follows:
Furthermore, the basic-minimal boundary, basic-minimal positive, and basic-minimal negative regions of O, respectively, are defined as follows:
The basic-minimal accuracy of the approximations is given by the following:
It is evident that 0≤γbk(O)≤1, and if γbk(O)=1, then O is termed a basic k-definable (basic k-exact) set; otherwise, it is considered basic k-rough.
The proposition asserts certain properties of the j-basic approximations.
Proposition 4.1. Let (℧,R,Fk) be a k-NS and Q,S⊆℧. Thus, the following holds:
(ⅰ) R_bk(Q)⊆Q⊆¯Rbk(Q);
(ⅱ) R_bk(℧)=¯Rbk(℧)=℧,R_bk(Φ)=¯Rbk(Φ)=Φ;
(ⅲ) IfQ⊆S, then R_bk(Q)⊆R_bk(S);
(ⅳ) IfQ⊆S, then ¯Rbk(Q)⊆¯Rbk(S);
(ⅴ) R_bk(Q∩S)=R_bk(Q)∩R_bk(S);
(ⅵ) ¯Rbk(Q∪S)=¯Rbk(Q)∪¯Rbk(S);
(ⅶ) R_bk(Q∪S)⊇R_bk(Q)∪R_bk(S);
(ⅷ) ¯Rbk(Q∩S)⊆¯Rbk(Q)∩¯Rbk(S);
(ⅸ) R_bk(Q)=[¯Rbk(Qc)]c, where Qc represents a complement of Q;
(ⅹ) ¯Rbk(Q)=[R_bk(Qc)]c;
(xi) R_bk(R_bk(Q))=R_bk(Q); and
(xii) ¯Rbk(¯Rbk(Q))=¯Rbk(Q).
Proof. The validity of (ⅰ), (ⅱ), (ⅲ), and (ⅳ) is readily apparent by using Definition 4.1. Therefore, we will prove the remaining items (ⅴ)-(xii) as follows.
(ⅴ) Since (Q∩S)⊆Q and (Q∩S)⊆S, then R_bk(Q∩S)⊆R_bk(Q) and R_bk(Q∩S)⊆R_bk(S).
Now, let ϖ∈[R_bk(Q)∩R_bk(S)]. Then, ϖ∈R_bk(Q) and ϖ∈R_bk(S), which implies Nbk(ϖ)⊆Q and Nbk(ϖ)⊆S. Thus, Nbk(ϖ)⊆Q∩S which that ϖ∈R_bk(Q∩S).
Therefore, R_bk(Q)∩R_bk(S)⊆R_bk(Q∩S);
(ⅵ) Similar to (ⅴ), using a comparable approach;
(ⅶ)Similar to (ⅴ), using a comparable approach;
(ⅷ) Similar to (ⅴ), using a comparable approach;
(ⅸ) [¯Rbk(Qc)]c=[{p∈℧:Nbk(p)∩Qc≠Φ}]c={p∈℧:Nbk(p)∩Qc=Φ}
={p∈℧:Nbk(p)⊆Q}=R_bk(Q);
(ⅹ) By a similar way such as (ix);
(xi) First, by (ⅰ), R_bk(R_bk(Q))⊆R_bk(Q).
Now, let ϖ∈R_bk(Q). Then,
We need to prove that Nbk(ϖ)⊆R_bk(Q) as follows:
If z∈Nbk(ϖ), then Nbk(z)⊆Nbk(ϖ), which implies that Nbk(z)⊆Q from Eq (4.1). Therefore, z∈R_bk(Q), which means that Nbk(ϖ)⊆R_bk(Q), which implies ϖ∈R_bk(R_bk(Q)). Hence, R_bk(Q)⊆R_bk(R_bk(Q)); and
(xii)By a similar way such as (xi).
The subsequent findings, which elucidate the connections between the proposed approximations (basic-minimal approximations), are straightforward to demonstrate with Lemma 3.2, hence the proof is omitted.
Proposition 4.2. Let (℧,R,Fk) be a k-NS and O⊆℧. Then, the following holds:
(ⅰ) R_b⟨u⟩(O)⊆R_b⟨r⟩(O)⊆R_b⟨i⟩(O);
(ⅱ) R_b⟨u⟩(O)⊆R_b⟨l⟩(O)⊆R_b⟨i⟩(O);
(ⅲ) ¯Rb⟨i⟩(O)⊆¯Rb⟨r⟩(O)⊆¯Rb⟨u⟩(O); and
(ⅳ) ¯Rb⟨i⟩(O)⊆¯Rb⟨l⟩(O)⊆¯Rb⟨u⟩(O).
Corollary 4.1. If (℧,R,Fk) is a k-NS and O⊆℧. Then, the following holds:
(ⅰ) Bb⟨i⟩(O)⊆Bb⟨r⟩(O)⊆Bb⟨u⟩(O);
(ⅱ) Bb⟨i⟩(O)⊆Bb⟨l⟩(O)⊆Bb⟨u⟩(O);
(ⅲ) γb⟨u⟩(O)≤γb⟨r⟩(O)≤γb⟨i⟩(O);
(ⅳ) γb⟨u⟩(O)≤γb⟨l⟩(O)≤γb⟨i⟩(O);
(ⅴ) If O is a basic ⟨u⟩-exact set, then it follows that O is also a basic ⟨r⟩-exact set, which in turn implies that O is a basic ⟨i⟩-exact set; and
(ⅵ) If O is a basic ⟨u⟩-exact set, then it follows that O is also a basic ⟨l⟩-exact set, which in turn implies that O is a basic ⟨i⟩-exact set.
Remark 4.1. Example 4.1 serves to illustrate that the converse of the aforementioned results is not universally valid.
Example 4.1. Let ℧={z1,z2,z3} and consider the binary relation R on ℧ defined as follows: R={(z1,z1),(z2,z2),(z3,z3),(z2,z3),(z3,z1)}.
Consequently, we construct Tables 8 and 9 to represent the basic k-lower and basic k-upper approximations, along with the basic k-accuracies of the approximations for all subsets ℧.
Remark 4.2. Based on Proposition 4.2, Corollary 4.1 and Example 4.1, the optimal method for approximating rough sets is the use of basic ⟨i⟩-approximations, which provide the highest accuracy measures.
4.2. Different topological structures via basic-minimal neighborhoods
Moving beyond mere approximations, this subsection investigates the generation of diverse topologies derived from basic-minimal neighborhoods. We rigorously demonstrate that the approximations proposed in Subsection 4.1 serve as closure and interior operators for these newly formed topologies, forging vital connections between the RS theory and topology for future explorations and applications.
Theorem 4.1. Given a k-NS (℧,R,Fk), for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, the set Tbk where: Tbk={O⊆℧:∀p∈O,Nbk(p)⊆O} forms a topology on ℧.
Proof.
(T1) It is evident that ℧ and Φ belong to Tbk.
(T2) Suppose {Qβ:β∈I} is a class of members in Tbk, and let q∈⋃βQβ. Then, there exists βo∈I such that q∈Qβo. Therefore, Nbk(q)⊆Qβo, which implies that Nbk(q)⊆⋃βQβ. Hence, ⋃βQβ∈Tbk.
(T3) Let Q1,Q2∈Tbk and q∈Q1∩Q2. Then, q∈Q1 and q∈Q2, which implies Nbk(q)⊆Q1 and Nbk(q)⊆Q2. Thus, Nbk(q)⊆(Q1∩Q2), and hence (Q1∩Q2)∈Tbk.
By (T1), (T2), and (T3), we conclude that Tbk forms a topology on ℧.
By employing Lemma 3.2, we can readily establish the subsequent result, elucidating the relationships among various topologies Tbk.
Proposition 4.3. Let (℧,R,Fk) be a k-NS. Then, the following holds:
(ⅰ) Tb⟨u⟩⊆Tb⟨r⟩⊆Tb⟨i⟩; and
(ⅱ) (ⅱ)Tb⟨u⟩⊆Tb⟨l⟩⊆Tb⟨i⟩.
The negation of Proposition 4.3 is shown to be incorrect in Example 4.2.
Example 4.2. Considering Example 3.1, we generate the following topologies:
Tb⟨r⟩={℧,Φ,{z2},{z1,z2},{z1,z2,z3},{z1,z2,z4}},
Tb⟨l⟩={℧,Φ,{z4},{z2,z4},{z1,z3,z4}},
Tb⟨i⟩={℧,Φ,{z1},{z2},{z4},{z1,z2},{z1,z3},{z1,z4}, {z2,z4},{z1,z2,z3},{z1,z2,z4},{z1,z3,z4}},
and Tb⟨u⟩={℧,Φ}.
However, T⟨r⟩={℧,Φ,{z1},{z2},{z1,z2},{z1,z3},{z1,z4}, {z1,z2,z3},{z1,z2,z4},{z1,z3,z4}}.
Remark 4.3. Based on Example 4.2, the following observations can be made:
(ⅰ) The topologies Tk and Tbk are generally independent, for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}.
(ⅱ) The topologies Tb⟨r⟩ and Tb⟨l⟩ are generally non-comparable.
The next proposition illustrates the relationships between the topologies generated by the basic-minimal neighborhoods and those induced by the preceding neighborhoods.
Proposition 4.4. Let (℧,R,Fk) be a k-NS,whereR is a reflexive relation. Then, ∀k∈{r,l,i,u}, and the following holds:
(ⅰ) T⟨k⟩=Tb⟨k⟩;
(ⅱ) Tk⊆Tb⟨k⟩; and
(ⅲ) Tm⊆Tb⟨k⟩.
Proof. Utilizing Lemmas 3.3 and 3.4, the proof becomes evident.
The next example proves that the opposite of Proposition 4.4 does not hold in general.
Example 4.3. By using Example 3.2, we compute the topologies Tk, Tm, T⟨k⟩, and Tb⟨k⟩ in the case where k=r, and similarly for the other cases.
Tm={℧,Φ,{z4},{z1,z2,z3}}, Tr={℧,Φ,{z3},{z4},{z2,z3},{z3,z4}, {z1,z2,z3},{z2,z3,z4}}, and T⟨r⟩=Tb⟨r⟩={℧,Φ,{z2},{z3},{z4},{z1,z2},{z2,z3},{z2, z4},{z3,z4},{z1,z2,z3},{z1,z2,z4},{z2,z3,z4}}.
The following theory is highly significant, as it serves as the link between the set-theoretic theory of RS's approach on one hand, and topological science on the other. Consequently, it stands as the cornerstone to apply all the concepts of topology and its applications within the theory of RS's. This would greatly benefit those interested in topology applications, yet not fundamentally specialized in topology itself. On the other hand, the following theorem introduces another method to compute the basic-minimal approximations in view of topology.
Theorem 4.2. If (℧,R,Fk) is a k-NS, then for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, the basic-minimal lower and the basic-minimal upper approximations of O⊆℧ are well-defined, respectively, as follows:
Proof. We will prove the first statement and the other by the duality property.
Necessity condition:
Let x∈∪{G∈Tb⟨k⟩:G⊆O}; then, ∃D∈Tb⟨k⟩ such that x∈D⊆O. Hence, Nbk(x)⊆D, which implies that x∈{p∈℧:Nbk(p)⊆O}.
Sufficiency condition:
Let x∈R_bk(O); then, Nbk(x)⊆O. However, from Lemma 3.1, ∀y∈Nbk(x), Nbk(y)⊆Nbk(x), which implies that Nbk(x)=G∈Tb⟨k⟩ such that x∈G⊆O. Thus, x∈∪{G∈Tb⟨k⟩:G⊆O}.
Remark 4.4. From Theorem 4.2, we observe that the basic-minimal lower and basic-minimal upper approximations correspond to the interior and closure operators of O⊆℧, respectively. This connection underscores the significance of the proposed approaches, highlighting their role as a crucial bridge to subsequent topological applications in the RS theory.
4.3. Comparisons between the suggested methods (basic-minimal approximations) and some of the others studies
As a dedicated comparison, Subsection 4.3 scrutinizes the proposed approximations against prior methodologies, including those by Yao [3], Dai et al. [6], Allam et al. [8], and Abd El-Monsef et al. [11]. Through a meticulous analysis, bolstered by counterexamples and established theorems, we showcase the superiority of our proposed methods across various specific and general scenarios.
First, we present comparative analyses between the proposed approaches in the current paper and some other methods in the case of a general binary relation.
Example 4.4. Referring to Example 3.1, we proceed to calculate the approximations for all subsets of ℧ using both the current technique and the preceding methods (Yao, Allam, Abd El-Monsef et al., and Dai et al. approaches), as presented in Tables 10 and 11.
Remark 4.5 Upon examination of Tables 10 and 11, the following observations can be made:
(ⅰ) The Yao, Allam, and Dai methods are generally to approximate RS's due to their inability to be generally applied across relations, lacking key properties necessary for approximations. Consequently, these limitations confine the scope of the RS theory applications, exemplified by the highlighted cells in Tables 10 & 11. Consequently, these methods introduce inconsistencies within the RS theory. Furthermore, it is evident that the proposed method demonstrates a superior accuracy compared to the approaches by Abd El-Monsef et al. Additionally, according to the preceding methods, all subsets are categorized as rough, thus indicating an inherent vagueness in the data (see the highlighted cells in Tables 10 and 11).
(ⅱ) Conversely, the methods outlined in our current paper stand out as the optimal approaches to approximate sets across general cases. This is because the basic-approximations fulfill all of Pawlak's RS properties unconditionally, devoid of any limitations or prerequisites. Additionally, our approaches encompass exact subsets, signifying the potential of our suggested method in unveiling the inherent vagueness within the data.
The next results elucidate the relationships among the current approaches and the methodologies proposed by Yao [3], Abd El-Monsef et al. [11], Allam et al. [8], and Dai et al. [6].
Theorem 4.3. If (℧,R,Fk) is a k-NS, where R is a reflexive relation, then for all O⊆℧ and k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, the following holds:
(ⅰ) R_k(O)⊆R_bk(O)⊆O⊆¯Rbk(O)⊆¯Rk(O);
(ⅱ) Bbk(O)⊆Bk(O) and γk(O)≤γbk(O); and
(ⅲ) If O is k-exact, then it is basic k-exact.
Proof. By employing Proposition 4.4, the proof becomes evident.
Remark 4.6. The following are observed from Example 4.4:
(ⅰ) The converse of Theorem 4.3 does not hold generally; and
(ⅱ) The basic-minimal approaches demonstrate greater accuracy compared to the methods proposed by Abd El-Monsef et al. [11].
The subsequent results delineate the connections between the proposed basic-minimal approximations and previous methodologies, encompassing Yao [3], Allam et al. [8], and Dai et al. [6], especially concerning a reflexive relation.
Utilizing Lemmas 3.3 and 3.4, the subsequent theorem can be established. Hence, the proof is deleted.
Theorem 4.4. If (℧,R,Fk) constitutes a k-NS with R being a reflexive relation, then for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, the following holds:
(ⅰ) A_k(O)= R_bk(O) and ¯Ak(O)=¯Rbk(O);
(ⅱ) Y∗(O)⊆R_bk(O)⊆O⊆¯Rbk(O)⊆Y∗(O); and
(ⅲ) R_m(O)⊆R_bk(O)⊆O⊆¯Rbk(O)⊆¯Rm(O).
Corollary 4.2. If (℧,R,Fk) constitutes a k-NS with R being a reflexive relation, then for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, the following holds:
(ⅰ) Bbk(O)=Bk(O);
(ⅱ) Bbk(O)⊆B(O)⊆Bm(O);
(ⅲ) γbk(O)=μk(O); and
(ⅳ) μm(O)≤γ(O)≤γbk(O).
Corollary 4.3. If (℧,R,Fk) constitutes a k-NS with R being a reflexive relation, then for each k∈{⟨r⟩,⟨l⟩,⟨i⟩,⟨u⟩}, the following holds:
(ⅰ) If O is a maximal-exact set, then it implies that O is Yao-exact, consequently making it a basic-exact set; and
(ⅱ) If O is a maximal-exact set, then it implies that O is Yao-exact, consequently rendering it a minimal-exact set.
Note: It should be noted that the converse of the preceding results is not generally true, as demonstrated by Example 4.5.
Example 4.5. According to Example 3.2, we calculate the approximations for all subsets of ℧ using the current technique and the preceding methods (Yao [3] technique and Dai et al. [6] approach), as shown in Table 12.
Remark 4.7. As observed from Theorem 4.4, Corollaries 4.2 and 4.3, and Example 4.5, the basic-minimal approaches demonstrate a greater accuracy compared to the methods proposed by Yao and Dai et al.
5.
Decision-making in diagnosing heart failure using basic-minimal approaches
In this section, we emphasize the crucial role of a minimally structured framework in medical science, particularly in addressing decision-making complexities. Our focus is on applying this framework within the context of heart failure. The dataset includes the outcomes of five symptoms observed in twelve patients. This study was conducted at the Cardiology Department of Al-Azhar University, located at Sayed Galal University Hospital in Egypt [44]. The research involved twelve patients with diverse symptoms, all of whom underwent thorough medical assessments, including comprehensive medical histories, physical examinations, extensive laboratory analyses, resting electrocardiograms (ECGs), and traditional echocardiographic evaluations. Based on these assessments, the diagnosis of heart failure was either confirmed or excluded. This study analyzed the experimental results of an initial investigation that examined five symptoms correlated with heart disease, as delineated by Dickstein et al. [46].
Table 13 provides an overview of the heart failure issue, where the columns signify symptoms ('Yes' meaning symptom presence and 'No' indicating absence) associated with heart failure diagnoses (considered as condition attributes 'C'). Specifically, H1 stands for breathlessness, H2 for orthopnea, H3 for paroxysmal nocturnal dyspnea, H4 for a reduced exercise tolerance, and H5 for ankle swelling. The 'D' attribute represents the decision regarding heart failure. Within Table 13, the rows designated as P={p1, p2,p3,…,p12} correspond to the individual patients
We initiate the application process by transforming the descriptive attributes (condition attributes) C={H1,H2,H3,H4,H5} into qualitative terms, as presented in Table 13. This table encapsulates the resemblances among the patient symptoms, where the degree of similarity ψ(pi,pj) is defined by:
where:
● i, j∈{1,2,3,…,12};
● ag represents an attribute, i.e., ag∈C;
● n represents the number of condition attributes.
Therefore, we compute the similarities between the symptoms of the 12 patients as follows:
For p1: It is evident that p1 and p2 share the same value for symptom H4, thus the similarity between p1 and p2 is 15.
Similarly, p1 and p3 share the same values for symptoms H1, H2, H3, and H4, thus the similarity between p1 and p3 is 45.
Using the same method, we evaluate the similarities between all the patients, as illustrated in Table 14.
Our next step involves constructing a minimal structured space based on the relationship that aligns with the inherent nature of the problem under study. It's important to highlight that we describe the connection within each issue constructed by the criteria specified by the experts. In this context, we denote piRpj⟺ψ(pi,pj)≥45, ∀i, j={1,2,3,…,12}, where ψ(pi,pj) represents the sum of similar symptoms between 'pi' and 'pj' divided by the total number of symptoms.
Note: The above process suggests a relation based on the requirements of system experts' perspective. It is assumed that this relation, along with the number 4/5, represents a similar degree, with a higher number indicating an increased similarity, thus providing more accurate results. Furthermore, both this relation and the number 4/5 can be adjusted according to the concepts of system experts. It is evident that the suggested relation is reflexive and symmetric, but not transitive, which renders the Pawlak approximations space inadequate to describe system.
Therefore, to compute all the r-neighborhoods, for each patient, we proceed as follows:
For p1: Nr(p1)={pi∈P| ψ(p1,pi)≥45}={p1,p3,p7,p9,p11}. In a similar way, the r-neighborhoods for the other patients are determined and presented in Table 15.
Next, we construct all the m-neighborhoods for each patient as follows:
For p1: Nm(p1)=⋃p1∈Nr(pi)Nr(pi)={p1,p3,p7,p8,p9,p11}.
Similarly, the m-neighborhoods for the other patients are derived and shown in Table 15.
Now, to compute the basic-minimal neighborhoods Nb⟨r⟩(x), we first determine the minimal-neighborhoods N⟨r⟩(x) for each patient as follows:
For p1: N⟨r⟩(p1)=⋂p1∈Nr(pi)Nr(pi)={p1}. Following the same procedure, the N⟨r⟩(x) for the other patients is calculated.
Consequently, the basic-minimal neighborhoods Nb⟨r⟩(x) for each patient as follows:
For p1: Nb⟨r⟩(p1)={pi∈P: N⟨r⟩(pi)⊆N⟨r⟩(p1)}={p1}.
Similarly, the Nb⟨r⟩(x) for the other patients are calculated and listed in Table 15.
Therefore, we proceed to construct the right neighborhoods, the maximal neighborhoods, and the basic-minimal right neighborhoods for each patient within the universe, as displayed in Table 15. These constructions utilize the relationship that corresponds to the specific nature of the problem under study.
From Table 13, the universe is divided into the following two independent sets are:
● The group of patients diagnosed with the disease: S={p1,p3,p7,p8,p9,p11}; and
● The group of patients without a diagnosis of heart failure: T={p2,p4,p5,p6,p10,p12}.
Therefore, by employing the suggested approximations (basic-minimal approximations) alongside previous approaches (Yao [3] and Dai et al. [6]), we can assess the accuracy of the decision-making for the two patient groups, as illustrated in Table 16. Following this, we present the Discussions section, which summarizes the concluding remarks and provides an analysis of this application. The discussion on the results has been expanded to offer a more in-depth analysis. Additionally, the validation section includes comparisons with the existing applications in the field and discusses the advantages of our approach.
6.
Discussions
In the realm of medical science, effective decision-making frameworks play a pivotal role in navigating the complexities inherent in diagnoses, particularly in conditions such as heart failure. Our focus in this study was to highlight the application of a minimally structured framework within the context of diagnosing heart failure, leveraging data obtained from the Cardiology Department of Al-Azhar University, situated at the Sayed Galal University Hospital in Egypt.
The dataset encompassed observations from twelve patients exhibited a spectrum of symptoms associated with heart failure. Thorough medical assessments, including detailed medical histories, physical examinations, laboratory analyses, electrocardiograms, and echocardiographic evaluations, were conducted to ascertain the diagnosis. Through a structured inquiry, we sought to elucidate the efficacy of our proposed methodologies to enhance diagnostic accuracy within this medical domain.
The initial investigation focused on analyzing five key symptoms correlated with heart disease, as identified by Dickstein et al. [46]. The subsequent transformation of the descriptive attributes into qualitative terms facilitated the computation of similarities among patient symptoms, which was a critical step in our diagnostic approach. By constructing the minimal structured spaces based on these relationships, we aimed to delineate distinct the patient groups based on their symptom profiles.
From the constructed structured spaces, it became apparent that the universe could be divided into two independent sets: patients diagnosed with heart failure and those without. This segmentation provided a foundational basis for further analyses, enabling the evaluation of the diagnostic accuracy across patient groups.
The application of our proposed methodologies, particularly the basic-minimal approximations, alongside traditional approaches such as those by Yao [3] and Dai et al. [6], yielded insightful comparisons. Notably, our methodologies exhibited high accuracy coefficients, which closely aligned with the medical diagnoses derived from empirical data. In contrast, the previous methods demonstrated limitations in accurately identifying patients with heart failure, underscoring the need for more refined diagnostic frameworks (see the highlighted cells in Table 16).
For instance, the set of patients diagnosed with the disease according to the doctor's decision was S={p1,p3,p7,p8,p9,p11}. Using the method by Dai et al., the lower approximation was {p1,p9,p11}, which indicated that only patients p1, p9, and p11 were identified as having heart failure, which contradicts the decision table and the doctor's decision. Conversely, our methods yielded an accuracy measure of 100%, meaning that the set of patients with heart failure was equivalent to the set S determined by the doctor's decision.
Moreover, the boundary region, which represents the doubtful or uncertain region of two sets (patients with heart failure and healthy individuals), was the same according to Dai et al.'s technique, namely {p2,p3,p5,p7,p8,p10,p12}. This means that these individuals could not be definitively identified as patients with or without heart failure. On the other hand, our approach resulted in an empty boundary region, which provided an accurate measure for diagnosis.
Our findings underscored the superiority of the proposed approaches in enhancing the approximation operators and the accuracy measures under diverse binary relations. Importantly, these methodologies upheld the core principles of Pawlak's framework without imposing restrictive conditions, thereby expanding the scope of the practical problems amenable to effective solutions.
In conclusion, our study not only sheds light on the efficacy of minimally structured frameworks in medical decision-making, but also underscores the transformative potential of advanced methodologies to enhance the diagnostic accuracy and clinical outcomes. Moving forward, further research in this direction holds promise to advance the frontiers of medical diagnostics and improve patient care outcomes.
We present an algorithm and a corresponding flowchart of the proposed techniques (basic-minimal approximations) to aid in decision-making problems. This algorithm (Algorithm 1), illustrated in (Figure 1) serves as a straightforward tool that can be utilized in MATLAB.
7.
Conclusions and future work
The RS theory significantly hinges on the RS operators and precision values, which are crucial elements that underpin its practical applications. These components not only offer insights into the data within subsets, but also gauge the representation of these subsets within the broader dataset. Enhanced operators and precision values can invariably lead to more accurate predictions, thus driving research efforts towards refining these aspects.
In this pursuit, there has been a focused exploration into the "basic-minimal approximations" derived from general binary relations, leveraging novel neighborhood constructions, termed basic-minimal neighborhoods. This endeavor expands the horizons of Pawlak's approximation theory, aiming to more effectively capture nuances in data representation. These advanced approximations, characterized by their minimal basics, have demonstrated a marked superiority over the preceding methodologies, notably surpassing the effectiveness of approaches proposed by the methods of Yao [3], Dai et al. [6], Allam et al. [8], Abu-Gdairi [9], and Abd El-Monsef et al. [11]. Particularly in navigating the diagnostic complexities that arise from the symptom similarity, they have substantially enhanced the diagnostic accuracy. The robustness of these methods is substantiated by rigorous mathematical proofs, as encapsulated in Theorem 4.3, Theorem 4.4, and their accompanying corollaries. These analyses underscore the heightened accuracy achieved by the proposed basic-minimal approximations compared to the alternative methodologies. Furthermore, concrete illustrations provided through Examples 4.4 and 4.5, which were complemented by tabulated data (Table 10–12), served to elucidate and reinforce these findings.
One of the noteworthy contributions of this study lies in its endeavor to bridge the RS theory with topology, thereby unveiling topological structures inherent in these approximations. This interdisciplinary approach opens avenues for deeper explorations into topology within the realm of the RS theory, accentuating the pivotal role played by these approximations in delineating topologies.
In essence, this research not only delves into fortifying the theoretical underpinnings of RS theory, but also accentuates its practical ramifications, especially in scenarios characterized by overlapping symptoms. The exceptional accuracy achieved in diagnosing heart failure, as evidenced by a perfect 100% accuracy rate in a dataset sourced from Al-Azhar University's Cardiology Department, underscores the efficacy and real-world applicability of these methodologies. In contrast, conventional methods, such as Dai et al.'s approach, have exhibited limitations in discerning between patients with heart failure and healthy individuals, thereby engendering uncertainty in decision-making processes. Moving forward, the proposed methodologies hold promise for broader applications beyond medical diagnostics. The formulation of a streamlined algorithm, complemented by a structured workflow to be implemented in programming languages such as MATLAB, paves the way for seamless integration into decision-making frameworks across diverse domains.
● Strengths and advantages of the approaches:
Based on the above, challenges, benefits, and strengths of the presented methods can be summarized as follows:
1) The methodology articulated in this paper hinges on generalized neighborhood systems derived from binary relations, which are devoid of restrictive conditions. This inclusivity not only amplifies its applicability, but also underscores its robustness across varied domains.
2) The versatility of this approach shines through its ability to tackle practical challenges under arbitrary relations, circumventing the constraints associated with equivalence relations, as prevalent in conventional methodologies.
3) The delineation of four distinct approaches, with the model predicated on the basic ⟨i⟩-neighborhood emerging as the most accurate, facilitates nuanced comparisons and insights into different approximation techniques and precision values, as demonstrated in the results obtained see (see Proposition 4.2 and Corollary 4.1).
4) Proposition 4.1 serves as a testament to the fidelity of the methodologies proposed herein, preserving the foundational tenets of Pawlak's framework without imposing arbitrary restrictions.
5) The scalability of this approach renders it well-suited to handle large datasets, owing to its reliance on neighborhood constructs that are readily discernible through data classification.
6) Notably, the methodologies outlined in this paper offer a heightened accuracy in decision-making processes, particularly in scenarios where accuracy is paramount, such as in infectious disease management cases such as COVID-19, where precision directly correlates with the sample size.
7) Focusing on diagnosing heart failure, the application described in this paper achieves an exceptional accuracy, reaching 100% in a dataset from Al-Azhar University's Cardiology Department. The mathematical results closely align with the decisions made by physicians, which accurately identified patients with heart failure. In contrast, previous methods (such as Yao, and Dai et al.'s methods) have faltered in distinguishing between patients with heart failure and healthy individuals, thereby introducing uncertainty into decision-making processes.
In conclusion, the methodologies delineated in this study not only advance the theoretical frontiers of the RS theory, but also hold profound implications for practical decision-making across diverse domains, promising an enhanced accuracy and reliability in complex decision-making scenarios.
Future works:
In our forthcoming investigations, we will delve into the following areas:
1) Conducting comparative studies: We plan to conduct comprehensive comparative studies of the suggested approaches (basic-minimal approximations) against other methodologies. Notably, we aim to compare our proposed models with recent advancements, including ternary models [39,43], to highlight improvements in the accuracy and generalization.
2) Exploring expanded domains: Our research will extend to explore the application of the proposed methods in expanded domains, particularly within medical contexts [45,46,47,48] and economic applications [21,22]. By venturing into these diverse domains, we aim to assess the versatility and efficacy of our methodologies across varied application scenarios.
3) Implementation across various frameworks: We intend to shed light on the implementation of basic-minimal approximations across various frameworks, including fuzzy sets [49], soft sets [50], soft RS's [51], and their utilization in Multicriteria decision-making applications [51]. Additionally, we aim to explore their application in decision-theoretic RS's [24,25,26,27], rough fuzzy sets [29,30], fuzzy topological spaces [52], Fuzzy soft topological structures [53,54], Ideals and girll applications [55,56,57], as well as Rough lattice, Graph medical applications, and Generalized picture fuzzy soft sets [58,59,60]. In essence, our future endeavors aim to further validate and extend the applicability of our proposed methodologies across diverse domains, paving the way for advancements in both theoretical frameworks and practical applications.
Author contributions
Conceptualization and methodologies were developed by M. K. El-Bably and D. I. Taher. M. A. El-Gayar and R. Abu-Gairi contributed to validation and data curation. All authors collaborated on writing, reviewing, and editing the manuscript. Project administration was conducted by M. K. El-Bably. M. K. El-Bably prepared Figures 1 and Algorithm 1. M. A. El-Gayar and D. I. Taher reviewed the validation of Algorithm 1. R. Abu-Gairi funded this research at Zarqa University, Jordan. All authors have thoroughly reviewed and approved the final version of the manuscript for publication.
Acknowledgments
We would like to express our sincere gratitude to the editor and the anonymous reviewers for their insightful and constructive comments, which have significantly improved the quality of this research paper. The current version of this paper is greatly enhanced thanks to their valuable recommendations and suggestions. Additionally, we extend our heartfelt thanks to Zarqa University, Jordan, for their financial support of this research.
Funding
This research is fully funded by Zarqa university-Jordan.
Use of AI tools declaration
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
Conflict of interest
All authors declare that there is no conflict of interest regarding the publication of this manuscript.