Next Article in Journal
Improved Whale Optimization Algorithm Based on Fusion Gravity Balance
Previous Article in Journal
Robust Multi-Criteria Traffic Network Equilibrium Problems with Path Capacity Constraints
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Modeling of COVID-19 in View of Rough Topology

1
Department of Mathematics, Faculty of Science, Kafrelsheikh University, Kafrelsheikh 33516, Egypt
2
Department of Mathematics, Faculty of Science, Zarqa University, Zarqa 13133, Jordan
3
Department of Mathematics, Faculty of Science, New Valley University, Kharga Oasis 72511, Egypt
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(7), 663; https://doi.org/10.3390/axioms12070663
Submission received: 24 May 2023 / Revised: 14 June 2023 / Accepted: 21 June 2023 / Published: 3 July 2023

Abstract

:
Rough-based topology has become an important technique for decision making in numerous real-life problems. The main purpose of this research paper is to use some topological notions in the approximation space of a rough set. Firstly, some concepts of topological near open sets and rough concepts are presented. A new approximation structure based on the topological near open sets is introduced. We debate the properties of the new approximation structure. We included an algorithm for detecting COVID-19 infection by its side effects. We believe that our approach will be helpful for any future detection.
MSC:
54A05; 54A10; 54C10; 54C15; 92C50

1. Introduction

There is no human event that has been able to restrict the face of life on the earth in a significant and continuous manner. However, if we look at the emerging corona virus (COVID-19), which hardly has any weight, as specialists have said that the weight of all corona viruses that have infected millions in the world does not even reach two grams, it had a stronger effect on the world than atomic weapons. This is in relation to COVID-19, which killed and infected millions in the world. The issue is not only about the search for a cure, it is also about the aftershocks and effects that COVID-19 has left. Sooner or later, the signs appear, as the virus continues to spread in all countries of the world. With the increasing information available now about COVID-19, scientists are working on using modern tools and techniques in order to be able to analyze the numbers in a laboratory at the University of California and in cooperation with the Energy Lab. They have created new algorithms using mathematical programming tools and computers in order for the the analysis process for the COVID-19 epidemic, currently ongoing, to be more feasible and effective [1].
Scientists’ efforts and responses to the COVID-19 pandemic: Clear fingerprints made by scientists and researchers in virology from all over the world in the face of the emerging COVID-19 pandemic, for which the world has joined together with all its capabilities to find a treatment or vaccine for the virus since its appearance in December 2019 in Wuhan, China and subsequent spread throughout the world, causing deaths and injuries by millions.
The appearance of COVID-19 has become a major public health concern due to its ability to cause many respiratory tract infections in people, and its ability to cause deaths. COVID-19 is transmitted from humans to humans in an incubation period of 2–10 days through droplets, contaminated hands, or contaminated surfaces. COVID-19 has emerged as a deadly virus. It has spread across the world, and there have been many mortalities. With each passing second, the death toll rises. COVID-19 affects people differently, and some people who contract it have mild to moderate symptoms and recover without needing to go to the hospital [2]. Accordingly, numerous researchers have published numerous articles on this pernicious virus (for instance, see the references [1,3,4,5,6,7]).
The rough set theory gives framework planners the capacity to deal with vulnerability. In the event that an ideal is not ’determinable’ in a given knowledge base, rough sets can be ’surmised’ for that information. From a clinical perspective, the characteristic worth limits are normally dubious [8].
A topology is a subfield of geometry known as rubber sheet geometry. Topology has numerous real-world applications and resolves several issues relating to continuity, either directly or indirectly. Its study does not depend on the dimension, i.e., an increase or decrease can happen without cutting. Using the neighborhood system, graphs are represented topologically and vice versa for some types of topologies. Recently, graphs, multisets, and rough sets have been used to represent structures such as the human heart [9] and medicine [10,11,12], which are useful in medicine, physics, and biology. Previously, we have used topology to study the similarity of DNA sequences and to identify mutations in genes, chromosomes, their locations, and amino acids that have changed [13]. We also used topology to study the recombination of DNA and to form a mathematical model for the recombination process [14]. Topological concepts can be used to build flexible mathematical models in biomathematics. Topological concepts play a vital role in the rough set, and may be useful in determining the causes of disease outbreaks and how to treat them. Moreover, they help in studying mutations that occur in genes and diseases, as well as in finding solutions.
We use the data set as an information system, and we use mathematical tools and studies to help the expert in decision making. The information systems of people and patients with COVID-19 can be classified via rough set theory and some topological structures. The significance of our paper is in studying the critical factors influencing the spread of COVID-19.
In this paper, we have demonstrated that rough topology can be used to solve problems in the real world. This technique has been employed in order to determine the determinants of the outbreak of the virus “COVID-19”, which has been reported widely throughout the world. In this study, the rough topological model matches up well with that used by medical specialists in terms of clinical use. We seek to assist in identifying the symptoms that have the most impact on the disease’s spread.

2. Preliminaries

A rough set is a novel mathematical technique for dealing with ambiguity in knowledge-based systems, market research, and information systems [15]. This concept has several applications in domains such as medical diagnosis and economics. Other rough set models were shown in [16,17,18,19,20,21,22,23]. Throughout this section, basic terminologies and definitions of the approximation-based rough set are presented. We also provide some primary concepts of the near open set.
Definition 1
([24]). Let U be a universe of discourse, and R be an equivalence relation on U. Then, H = ( U , R ) is called an approximation structure. For any subset X 1 U , the lower approximations ( L a p p ) and upper approximations ( U a p p ) are defined as:
L a p p ( X 1 ) = { x 1 U : [ x 1 ] R X 1 }
U a p p ( X 1 ) = { x 1 U : [ x 1 ] R X 1 ϕ }
B R ( X 1 ) = U a p p ( X 1 ) L a p p ( X 1 )
Proposition 1
([24]). If ( U ,R) is an approximation structure and X 1 , Y 1 U , then:
( i ) L a p p ( X 1 ) X 1 U a p p ( X 1 ) .
( i i ) L a p p ( ϕ ) = U a p p ( ϕ ) = ϕ   a n d   L a p p ( U ) = U a p p U ( ϕ ) = U .
( i i i ) U a p p ( X 1 Y 1 ) = U a p p ( X 1 ) U a p p ( Y 1 ) .
( i v ) U a p p ( X 1 Y 1 ) U a p p ( X 1 ) U a p p ( Y 1 ) .
( v ) L a p p ( X 1 Y 1 ) L a p p ( X 1 ) L a p p ( Y 1 ) .
( v i ) L a p p ( X 1 Y 1 ) = L a p p ( X 1 ) L a p p ( Y 1 ) .
( v i i ) I f   X 1 Y 1 then L a p p ( X 1 ) L a p p ( Y 1 ) and U a p p ( X 1 ) U a p p ( Y 1 ) .
( v i i i ) U a p p ( X 1 c ) = ( [ L a p p ( X 1 ) ] c ) and L a p p ( X 1 c ) = ( [ U a p p ( X 1 ) ] c ) .
( i x ) U a p p U a p p ( X 1 ) = L a p p U a p p ( X 1 ) = U a p p ( X 1 ) .
( x ) L a p p L a p p ( X 1 ) = U a p p L a p p ( X 1 ) = L a p p ( X 1 ) .
Definition 2.
Let ( U , τ ) be a topological structure. Then, X 1 U is called:
(i) 
α-open [25] if X 1 i n t ( c l ( i n t ( X 1 ) ) ) .
(ii) 
γ-open [26] if X 1 c l ( i n t ( X 1 ) ) i n t ( c l ( X 1 ) ) .
(iii) 
β-open [27] if X 1 c l ( i n t ( c l ( X 1 ) ) ) .
The set of all β -open expressed by β O ( U , τ ) or β O ( U ) , as well as α O ( U ) and γ O ( U ) .

3. Topological Near Open Sets’ Approximation Structure

The necessity to represent subsets of a universe U as a base for topology τ motivates the use of the topological rough set theory. Thus, if R is a binary relation on U , then K τ = ( U , R β ) is called a near open ( No ) approximation structure, where β O ( U ) is generated by taking R β as a subbase for τ .
Definition 3.
Let ( U , R β ) be a No approximation structure, X 1 U . Then, R ̲ β ( X 1 ) = { G β O ( U ) : G X 1 } , R ¯ β ( X 1 ) = { F β C ( U ) : X 1 F } are called No L a p p (resp. No U a p p ), where G X 1 β β O ( U ) , X 1 G X 1 β .
Moreover, P O S β ( X 1 ) = R ̲ β ( X 1 ) is called the topological positive region of X 1 , N E G β ( X 1 ) = U R ¯ β ( X 1 ) is called the topological nagative region of X 1 and B N D β ( X 1 ) = R ¯ β ( X 1 ) R ̲ β ( X 1 ) is called the topological boundary region of X 1 . The topological accuracy measure is defined as α β ( X 1 ) = R ̲ β ( X 1 ) R ¯ β ( X 1 ) , where represents the cardinality and X 1 ϕ .
The decision-making process in practical applications requires mathematical steps (upper and lower approximations, as well as boundary and accuracy).
Example 1.
Let U = { q 1 , q 2 , q 3 , q 4 } , R = { ( q 1 , q 1 ) , ( q 1 , q 2 ) , ( q 2 , q 4 ) , ( q 3 , q 4 ) , ( q 4 , q 1 ) , ( q 4 , q 2 ) , ( q 4 , q 4 ) } and X 1 = { q 1 , q 2 , q 3 } . Thus, q 1 R = { q 1 , q 2 } , q 2 R = q 3 R = { q 4 } , q 4 R = { q 1 , q 2 , q 4 } and τ = { U , ϕ , { q 1 , q 2 } , { q 4 } , { q 1 , q 2 , q 4 } } . Therefore, β O ( U ) = { { q 1 } , { q 2 } , { q 3 } , { q 4 } , { q 1 , q 2 } , { q 1 , q 3 } , { q 1 , q 4 } , { q 2 , q 3 } , { q 2 , q 4 } , { q 3 , q 4 } , { q 1 , q 2 , q 3 } , { q 1 , q 2 , q 4 } , { q 1 , q 3 , q 4 } , { q 2 , q 3 , q 4 } } . Then, R ̲ β ( X 1 ) = { q 1 , q 2 , q 3 } and R ¯ β ( X 1 ) = U . The accuracy measure α β ( X 1 ) = 3 4 .
Proposition 2.
Let ( U , R β ) be a No approximation structure, X 1 , Y 1 U . Then:
(i) 
X 1 is No roughly a bottom, included in Y 1 if R ̲ β ( X 1 ) R ̲ β ( Y 1 ) ;
(ii) 
X 1 is No roughly a top, included in Y 1 if R ¯ β ( X 1 ) R ¯ β ( Y 1 ) ;
(iii) 
X 1 is No roughly included in Y 1 if R ̲ β ( X 1 ) R ̲ β ( Y 1 ) and R ¯ β ( X 1 ) R ¯ β ( Y 1 ) .
Definition 4.
Let ( U , R β ) be a No approximation structure, X 1 , Y 1 U . Then:
(i) 
R β -definable (β-exact) if R ̲ β ( X 1 ) = R ¯ β ( X 1 ) or B N D β ( X 1 ) = ϕ ;
(ii) 
No rough if R ̲ β ( X 1 ) R ¯ β ( X 1 ) or B N D β ( X 1 ) ϕ .
Definition 5.
Let ( U , R β ) be a No approximation structure, X 1 , Y 1 U . Then, X 1 , Y 1 are:
(i) 
No roughly equal to a top if R ̲ β ( X 1 ) = R ̲ β ( Y 1 ) ;
(ii) 
No roughly equal to a bottom if R ¯ β ( X 1 ) = R ¯ β ( Y 1 ) ;
(iii) 
No roughly equal if R ̲ β ( X 1 ) = R ̲ β ( Y 1 ) and R ¯ β ( X 1 ) = R ¯ β ( Y 1 ) .
Proposition 3.
If ( U , R β ) is a No approximation structure, X 1 , Y 1 U , then,
(i) 
Every exact set in U is No exact;
(ii) 
Every No rough set in U is rough.
Proof. 
(i)
Suppose that X 1 is an exact set in U . Thus, B N D ( X 1 ) = B N D β ( X 1 ) = ϕ and X 1 = R ̲ β ( X 1 ) = R ¯ β ( X 1 ) . Therefore, X 1 is No exact.
(ii)
Suppose that X 1 U is No rough. Hence, B N D β ( X 1 ) ϕ and X R ̲ β ( X 1 ) R ¯ β ( X 1 ) . Thus, X 1 is a rough set in U . □
Definition 6.
Let ( U , R β ) be a No approximation structure, X 1 U . Then, X 1 is:
(i) 
Roughly R β -definable, if R ̲ β ( X 1 ) ϕ and R ¯ β ( X 1 ) U ;
(ii) 
Internally R β -undefinable, if R ̲ β ( X 1 ) = ϕ and R ¯ β ( X 1 ) U ;
(iii) 
Externally R β -undefinable, if R ̲ β ( X 1 ) ϕ and R ¯ β ( X 1 ) = U ;
(iv) 
Totally R β -undefinable, if R ̲ β ( X 1 ) = ϕ and R ¯ β ( X 1 ) = U .
Example 2.
Let U = { x 1 , x 2 , x 3 , x 4 } and U / R = { { x 1 , x 4 } , { x 3 } , { x 2 , x 3 , x 4 } } be a base of topology defined on U . Take { X 1 = { x 3 , x 4 } } , then R ̲ β ( X 1 ) = X 1 ϕ and R ¯ β ( X 1 ) = { x 2 , x 3 , x 4 } } U . Therefore, X 1 is Roughly R β -definable.
Proposition 4.
Let ( U , R β ) be a No approximation structure, X 1 , Y 1 U . Then,
(i) 
R ̲ β ( X 1 ) X 1 R ¯ β ( X 1 ) ;
(ii) 
R ̲ β ( ϕ ) = R ¯ β ( ϕ ) = ϕ , R ̲ β ( X 1 ) = R ¯ β ( X 1 ) = X 1 ;
(iii) 
If X 1 Y 1 , then R ̲ β ( X 1 ) R ̲ β ( Y 1 ) and R ¯ β ( X 1 ) R ¯ β ( Y 1 ) ;
(iv) 
R ̲ β ( X 1 ) R ̲ β ( Y 1 ) = R ̲ β ( X 1 Y 1 ) ;
(v) 
R ¯ β ( X 1 Y 1 ) = R ¯ β ( X 1 ) R ¯ β ( Y 1 ) ;
(vi) 
R ̲ β ( X 1 c ) = ( R ¯ β ( X 1 ) ) c , R ¯ β ( X 1 c ) = ( R ̲ β ( X 1 ) ) c ;
(vii) 
R ̲ β ( R ̲ β ( X 1 ) ) = R ̲ β ( X 1 ) , R ¯ β ( R ¯ β ( X 1 ) ) = R ¯ β ( X 1 ) .
Proof. 
(i)
Suppose that x 1 R ̲ β ( X 1 ) . Then, x 1 { G β O ( U ) : G X 1 } and G 0 β O ( U ) where x 1 G 0 X 1 . Therefore, R ̲ β ( X 1 ) X 1 . Let x 1 X 1 . Then, x 1 F by the definition of the No upper approximation F β C ( U ) . Thus, X 1 R ¯ β ( X 1 ) ,
(ii)
Obvious.
(iii)
Assume that, x 1 R ̲ β ( X 1 ) , X 1 Y 1 . Therefore, x 1 R ̲ β ( Y 1 ) by the definition of the No upper approximation. Moreover, let X 1 R ¯ β ( Y 1 ) , hence X 1 R ¯ β ( Y 1 ) = { F β C ( U ) : Y 1 F } , then there exists Y 1 F β C ( U ) and X 1 F . This leads to F β C ( U ) , X 1 Y 1 F and X 1 F and X 1 R ¯ β ( X 1 ) = { F β C ( U ) : X 1 F } . Hence, X 1 R ¯ β ( X 1 ) and R ¯ β ( X 1 ) R ¯ β ( Y 1 ) .
(iv)
Since X 1 X 1 Y 1 , Y 1 X 1 Y 1 , then R ̲ β ( X 1 ) R ̲ β ( X 1 Y 1 ) , R ̲ β ( Y 1 ) R ̲ β ( X 1 Y 1 ) . Thus, R ̲ β ( X 1 ) R ̲ β ( Y 1 ) R ̲ β ( X 1 Y 1 ) . Let x 1 R ̲ β ( X 1 Y 1 ) , then x 1 { G β O ( U ) : G X 1 Y 1 } . Thus, G 0 β O ( U ) where x 1 G 0 X 1 Y 1 . There exists three cases:
Case (1) If G 0 X 1 , X 1 X 1 , thus x 1 R ̲ β ( X 1 ) .
Case (2) If G 0 X 1 = ϕ , then G 0 Y and x 1 G 0 , so x 1 R ̲ β ( X 1 ) .
Case (3) If G 0 X 1 ϕ , where x 1 G 0 and G 0 is the β -open set, therefore x 1 β C ( X 1 ) , and hence x 1 R ̲ β ( X 1 ) .
From three cases, x 1 R ̲ β ( X 1 ) R ̲ β ( Y 1 ) .
(v)
Similar to (iv);
(vi)
Let x 1 R ̲ β ( X 1 c ) . Then, x 1 { G β O ( U ) : G X 1 c } . So, G 0 β O ( U ) such that x 1 G 0 X 1 c . Then, there exists G 0 c , such that X 1 G 0 c and X 1 G 0 c , G 0 c β C ( U ) . Hence, X 1 R ¯ β ( X 1 ) . Thus, x 1 ( R ¯ β ( X 1 ) ) c and R ̲ β ( X 1 c ) = ( R ¯ β ( X 1 ) ) c . Moreover, we can prove that R ¯ β ( X 1 c ) = ( R ̲ β ( X 1 ) ) c .
(vii)
Since R ̲ β ( X 1 ) = { G β O ( U ) : G X 1 } . Therefore, R ̲ β ( R ̲ β ( X 1 ) ) = { { G β O ( U ) : G X 1 } } = { G β O ( U ) : G X 1 } = R ̲ β ( X 1 ) . R ¯ β ( R ¯ β ( X 1 ) ) = R ¯ β ( ( R ̲ β ( X 1 c ) ) c ) = ( R ̲ β ( ( R ̲ β ( X 1 c ) ) c ) ) c = ( R ̲ β ( X 1 c ) ) c = ( R ¯ β ( X 1 c ) ) c = R ¯ β ( X 1 ) . □
Example 3.
Consider U = { x 1 , x 2 , x 3 , x 4 , x 5 , x 6 } and U / R = { { x 3 } , { x 1 , x 2 , x 5 } } is a base of topology defined on U . If { X 1 = { x 3 , x 4 , x 5 } } , R ̲ β ( X 1 ) = { x 3 , x 5 } and R ¯ β ( X 1 ) = { x 3 , x 4 , x 5 } } . Therefore, R ̲ β ( X 1 ) X 1 and X 1 R ¯ β ( X 1 ) .

4. COVID-19 in Terms of Topological No

Fever, fatigue, and a dry hack are the most well-known symptoms of COVID-19 infection. Torment and throbs, nasal blockage, migraine, conjunctivitis, sore throat, the runs, loss of taste or smell, a rash and discoloration of the fingers or toes are some of the less common adverse effects that a few people may experience. These manifestations are typically mild and begin gradually. Only a few people are able to be contained without mild symptoms. Symptoms may vary from one country to another and change from common to mild or strong symptoms and may become a fleeting symptom. With the occurrence of mutations in COVID-19, new symptoms appear and differ from one country to another in their severity, and other symptoms disappear. However, there are symptoms such as fever, fatigue, and dehydration that persist despite these mutations [8].
In this application, we analyze the data of a group of patients. They demonstrated a group of different symptoms. Their data was in the following Table 1, where high temperature, breathing difficulty, physical strain, sore throat, and lack of smell are represented by the symbols A 1 , A 2 , A 3 , A 4 , A 5 , respectively. 1 refers to “Yes”, 0 refers to “No”, + refers to “Positive”, and − refers to “Negative”.
Based on the information system of COVID-19 in Table 1 and the No approximation structure, we will discover and predict disease-causing factors and disease detection using a new algorithm.

Algorithm of the Side Effects of COVID-19 Infection

  • Step 1: Input U is the universe of discourse, R is the set of condition attributes, and C is the decision attribute.
  • Step 2: Find Pawlak’s L a p p , U a p p and the boundary of any set X 1 U .
  • Step 3: Remove any attribute A i R , take U / R A i as a base for topology, and find the set β O ( U ) .
  • Step 4: Calculate β L a p p , β U a p p and the boundary of the set X 1 .
  • Step 5: If the boundary of X 1 in Step 2 and Step 4 are the same, then A i is a superfluous attribute.
  • Step 6: Repeat Step 3, Step 4 and Step 5 for all condition attributes and find the reduct (R).
Continued from Table 1:
  • Step 1: Let U = { p 1 , p 2 , p 3 , p 4 , p 5 , p 6 , p 7 , p 8 , p 9 } be the set of patients, R = { A 1 , A 2 , A 3 , A 4 , A 5 } be the condition attributes, C = { + , } be the decision attributes, and X 1 = { p 1 , p 2 , p 17 , p 18 } be the set of patients having positive results. Then, U / R = { { p 1 } , { p 2 } , { p 3 } , { p 4 } , { p 5 } , { p 6 } , { p 7 } , { p 8 } , { p 9 } , { p 10 } , { p 11 } , { p 12 } , { p 13 } , { p 14 } , { p 15 } , { p 16 } , { p 17 } , { p 18 } , { p 19 } , { p 20 } , { p 21 } , { p 22 } , { p 23 } , { p 24 } , { p 25 } , { p 26 } , { p 27 } , { p 28 } , { p 29 } , { p 30 } , { p 31 } , { p 32 } } .
  • Step 2: Pawlak’s L a p p and U a p p of X 1 is: R ̲ ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } , R ¯ ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } , B N R ( X 1 ) = ϕ .
  • Step 3: Case (i) Remove the attribute A 1 , then U / R ( A 1 ) = { { p 1 , p 17 } , { p 2 , p 18 } , { p 3 , p 19 } , { p 4 , p 20 } , { p 5 , p 21 } , { p 6 , p 22 } , { p 7 , p 23 } , { p 8 , p 24 } , { p 9 , p 25 } , { p 10 , p 26 } , { p 11 , p 27 } , { p 12 , p 28 } , { p 13 , p 29 } , { p 14 , p 30 } , { p 15 , p 31 } , { p 16 , p 32 } } is a base for topology; we can deduce the set β O ( U ) .
  • Step 4: The β L a p p , β U a p p and boundary of X 1 are: R ̲ β ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } , R ¯ β ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } and B N β ( X 1 ) = ϕ .
  • Step 5: Since B N β ( X 1 ) = ϕ = B N R ( X 1 ) = ϕ , then A 1 is a superfluous attribute which means it is not necessary for patients having positive results.
  • Step 6: Case (ii) Remove the attribute A 2 , then U / R ( A 2 ) = { { p 1 , p 9 } , { p 2 , p 10 } , { p 3 , p 11 } , { p 6 , p 14 } , { p 7 , p 15 } , { p 6 , p 22 } , { p 7 , p 23 } , { p 8 , p 24 } , { p 9 , p 25 } , { p 9 , p 25 } , { p 10 , p 26 } , { p 11 , p 27 } , { p 4 , p 12 } , { p 5 , p 13 } { p 8 , p 16 } , { p 17 , p 25 } , { p 18 , p 26 } , { p 19 , p 27 } , { p 20 , p 28 } , { p 21 , p 29 } , { p 22 , p 30 } , { p 23 , p 31 } , { p 24 , p 32 } . Therefore, R ̲ β ( X 1 ) = ϕ , R ¯ β ( X 1 ) = { p 1 , p 2 , p 9 , p 10 , p 17 , p 18 , p 25 , p 26 } and B N β ( X 1 ) = { p 1 , p 2 , p 9 , p 10 , p 17 , p 18 , p 25 , p 26 } B N R ( X 1 ) .
    Case (iii) Remove the attribute A 3 , then U / R ( A 3 ) = { { p 1 , p 5 } , { p 2 , p 6 } , { p 3 , p 7 } , { p 4 , p 8 } , { p 9 , p 13 } , { p 10 , p 14 } , { p 11 , p 15 } , { p 12 , p 16 } , { p 17 , p 21 } , { p 18 , p 22 } , { p 19 , p 23 } , { p 20 , p 24 } , { p 25 , p 29 } , { p 26 , p 30 } , { p 27 , p 31 } , { p 28 , p 32 } } . Hence, R ̲ β ( X 1 ) = ϕ , R ¯ β ( X 1 ) = { p 1 , p 5 , p 2 , p 6 , p 17 , p 21 , p 18 , p 22 } and B N β ( X 1 ) = { p 1 , p 5 , p 2 , p 6 , p 17 , p 21 , p 18 , p 22 } B N R ( X 1 ) .
    Case (iv) Remove the attribute A 4 , then U / R ( A 4 ) = { { p 1 , p 3 } , { p 2 , p 4 } , { p 5 , p 7 } , { p 6 , p 8 } , { p 9 , p 11 } , { p 10 , p 12 } , { p 13 , p 15 } , { p 14 , p 16 } , { p 17 , p 19 } , { p 18 , p 20 } , { p 21 , p 23 } , { p 22 , p 24 } , { p 25 , p 27 } , { p 26 , p 28 } , { p 29 , p 31 } , { p 30 , p 32 } } . Hence, R ̲ β ( X 1 ) = ϕ , R ¯ β ( X 1 ) = { p 1 , p 3 , p 2 , p 4 , p 17 , p 19 , p 18 , p 20 } and B N β ( X 1 ) = { p 1 , p 3 , p 2 , p 4 , p 17 , p 19 , p 18 , p 20 } B N R ( X 1 ) .
    Case (v) Remove the attribute A 5 , then U / R ( A 5 ) = { { p 1 , P 2 } , { p 3 , p 4 } , { p 5 , p 6 } , { p 7 , p 8 } , { p 9 , p 10 } , { p 11 , p 12 } , { p 13 , p 14 } , { p 15 , p 16 } , { p 17 , p 18 } , { p 19 , p 20 } , { p 21 , p 22 } , { p 23 , p 24 } , { p 25 , p 26 } , { p 27 , p 28 } , { p 29 , p 30 } , { p 31 , p 32 } } . Hence, R ̲ β ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } ,
    R ¯ β ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } and B N β ( X 1 ) = ϕ .
Therefore, reduct( R ) = { A 2 , A 3 , A 4 } . Similarly, if Y is the set of patients having a negative result, then again reduct ( R ) = { A 2 , A 3 , A 4 } .
Remark 1.
From the previous application, we conclude that only the symptoms that make up the reduct confirm the presence of the disease; therefore, appropriate preventive measures must be taken, given a positive situation.

5. Conclusions

Rough topology is a useful mathematical tool in the process of decision making for many problems in daily life. Within this paper, we established a new combination between rough approximation and some topological concepts. Some properties of the new approximation structure are discussed. We design an algorithm depending on our approach for detecting COVID-19 disease. The paper concluded that breathing difficulty, physical strain, and sore throat, which are represented by the symbols A 2 , A 3 and A 4 , respectively, are closely connected to the disease (COVID-19). Through future work, we will investigate the challenges associated with human blood circulation, study the relations between diseases such as COVID-19, SARS…, etc., study mutations, repair mutations, make novelty mutations in plants and animals, and treat diseases.

Author Contributions

The contributions of authors to this research article are equal. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The dataset can be accessed from the following link https://www.who.int/emergencies/diseases/novel-coronavirus-2019, accessed on 1 January 2023.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kampf, G.; Todt, D.; Pfaender, S.; Steinmann, E. Persistence of coronaviruses on inanimate surfaces and their inactivation with biocidal agents. J. Hosp. Infect. 2020, 104, 246–251. [Google Scholar] [CrossRef]
  2. World Health Organization. Coronavirus Disease (COVID-19) Pandemic. Available online: https://www.who.int/emergencies/diseases/novel-coronavirus-2019 (accessed on 1 January 2023).
  3. Chen, Y.; Guo, Y.; Pan, Y.; Zhao, Z.J. Structure analysis of the receptor binding of 2019-nCoV. Biochem. Biophys. Res. Commun. 2020, 525, 135–140. [Google Scholar] [CrossRef]
  4. Lai, C.C.; Liu, Y.H.; Wang, C.Y.; Wang, Y.H.; Hsueh, S.C.; Yen, M.Y.; Ko, W.C.; Hsueh, P.R. Asymptomatic carrier state, acute respiratory disease, and pneumonia due to severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2): Facts and myths. J. Microbiol. Immunol. Infect. 2020, 53, 404–412. [Google Scholar] [CrossRef]
  5. Lai, C.C.; Shih, T.P.; Ko, W.C.; Tang, H.J.; Hsueh, P.R. Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) and coronavirus disease-2019 (COVID-19): The epidemic and the challenges. Int. J. Antimicrob. Agents 2020, 55, 105924. [Google Scholar] [CrossRef]
  6. Robson, B. Computers and viral diseases. Preliminary bioinformatics studies on the design of a synthetic vaccine and a preventative peptidomimetic antagonist against the SARS-CoV-2 (2019-nCoV, COVID-19) coronavirus. Comput. Biol. Med. 2020, 119, 103670. [Google Scholar] [CrossRef]
  7. Salman, S.; Salem, M.L. Routine childhood immunization may protect against COVID-19. Med. Hypotheses 2020, 140, 109689. [Google Scholar] [CrossRef]
  8. Pawlak, Z. Rough set theory and its application. J. Telecommun. Inf. Technol. 2002, 3, 7–10. [Google Scholar] [CrossRef]
  9. Nada, S.I.; El-Atik, A.A.; Atef, M. New types of topological structures via graphs. Math. Methods Appl. Sci. 2018, 41, 5801–5810. [Google Scholar] [CrossRef]
  10. Abu-Gdairi, R.; El-Gayar, M.A.; El-Bably, M.K.; Fleifel, K.K. Two Different Views for Generalized Rough Sets with Applications. Mathematics 2021, 9, 2275. [Google Scholar] [CrossRef]
  11. Hosny, R.A.; Abu-Gdairi, R.; El-Bably, M.K. Approximations by Ideal Minimal Structure with Chemical Application. Intell. Autom. Soft Comput. 2023, 36, 3073–3085. [Google Scholar] [CrossRef]
  12. Mareay, R.; Noaman, I.; Abu-Gdairi, R.; Badr, M. On Covering-Based Rough Intuitionistic Fuzzy Sets. Mathematics 2022, 10, 4079. [Google Scholar] [CrossRef]
  13. El-Sharkasy, M.M.; Fouda, W.M.; Badr, M.S. Multiset topology via DNA and RNA mutation. Math. Methods Appl. Sci. 2018, 41, 5820–5832. [Google Scholar] [CrossRef]
  14. Alzahrani, S.; El-Maghrabi, A.I.; Badr, M.S. Another View of Weakly Open Sets Via DNA Recombination. Intell. Autom. Soft Comput. 2022, 34, 2. [Google Scholar] [CrossRef]
  15. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1998, 11, 341–356. [Google Scholar] [CrossRef]
  16. Abo-Tabl, E.A. A comparison of two kinds of definitions of rough approximations based on a similarity relation. Inf. Sci. 2011, 181, 2587–2596. [Google Scholar] [CrossRef]
  17. Ali, M.I.; Davaz, B.; Shabir, M. Some properties of generalized rough sets. Inf. Sci. 2013, 224, 170–179. [Google Scholar] [CrossRef]
  18. Ali, A.; Ali, M.I.; Rehman, N. Soft dominance based rough sets with applications in information systems. Int. Approx. Reason. 2019, 113, 171–195. [Google Scholar] [CrossRef]
  19. El-Bably, M.K. Comparisons between near open sets and rough approximations. Int. J. Granul. Comput. Rough Sets Intell. Syst. 2015, 4, 64–83. [Google Scholar] [CrossRef]
  20. Kondo, M. On the structure of generalized rough sets. Inf. Sci. 2006, 176, 589–600. [Google Scholar] [CrossRef]
  21. Som, T. On soft relation and fuzzy soft relation. J. Fuzzy Math. 2009, 16, 677–687. [Google Scholar]
  22. Maji, P.K.; Biswas, R.; Roy, A.R. Fuzzy soft sets. J. Fuzzy Math. 2001, 9, 589–602. [Google Scholar]
  23. Feng, F.; Liu, X.; Fotea, V.L.; Jun, Y.B. Soft sets and soft rough sets. Inf. Sci. 2011, 181, 1125–1137. [Google Scholar] [CrossRef]
  24. Pawlak, Z. Rough Sets: Theoretical Aspects of Reasoning about Date; Kluwer Academic Publishers: Boston, MA, USA, 1991. [Google Scholar]
  25. Njastad, O. On some classes of nearly open sets. Pac. J. Math. 1965, 15, 961–970. [Google Scholar] [CrossRef]
  26. El-Atik, A.A. A Study of Some Types of Mappings on Topological Structures. Master’s Thesis, Tanta University, Tanta, Egypt, 1997. [Google Scholar]
  27. El-Monsef, M.E.A.; El-Deeb, S.N.; Mahmoud, R.A. β-open sets and β-continuous mappings. Bull. Fac. Sc. Assuit Univ. 1983, 12, 77–90. [Google Scholar]
Table 1. The side effects of COVID-19 infection.
Table 1. The side effects of COVID-19 infection.
Patients A 1 A 2 A 3 A 4 A 5 Decision
p 1 11111+
p 2 11110+
p 3 11101
p 4 11100
p 5 11011
p 6 11010
p 7 11001
p 8 11000
p 9 10111
p 10 10110
p 11 10101
p 12 10100
p 13 10011
p 14 10010
p 15 10001
p 16 10000
p 17 01111+
p 18 01110+
p 19 01101
p 20 01100
p 21 01011
p 22 01010
p 23 01001
p 24 01000
p 25 00111
p 26 00110
p 27 00101
p 15 10001
p 28 00100
p 29 00011
p 30 00010
p 31 00001
p 32 00000
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Mareay, R.; Abu-Gdairi, R.; Badr, M. Modeling of COVID-19 in View of Rough Topology. Axioms 2023, 12, 663. https://doi.org/10.3390/axioms12070663

AMA Style

Mareay R, Abu-Gdairi R, Badr M. Modeling of COVID-19 in View of Rough Topology. Axioms. 2023; 12(7):663. https://doi.org/10.3390/axioms12070663

Chicago/Turabian Style

Mareay, R., Radwan Abu-Gdairi, and M. Badr. 2023. "Modeling of COVID-19 in View of Rough Topology" Axioms 12, no. 7: 663. https://doi.org/10.3390/axioms12070663

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop