International Journal of Information Science

p-ISSN: 2163-1921    e-ISSN: 2163-193X

2012;  2(4): 33-36

doi: 10.5923/j.ijis.20120204.01

Mathematical Innovations of a Modern Topology in Medical Events

M. Lellis Thivagar 1, Carmel Richard 2, Nirmala Rebecca Paul 2

1School of Mathematics, Madurai Kamaraj University, Madurai-625021, TamilNadu, India

2Department of Mathematics, Lady Doak College, Madurai - 625002, Tamil Nadu, India

Correspondence to: Carmel Richard , Department of Mathematics, Lady Doak College, Madurai - 625002, Tamil Nadu, India.

Email:

Copyright © 2012 Scientific & Academic Publishing. All Rights Reserved.

Abstract

The purpose of this paper is to introduce a new topology called Rough Topology in terms of rough sets and prove that rough topology can be used to analyze many practical/real life problems. Using this concept, we find the deciding factors for the most common diseases chikungunya and diabetes.

Keywords: Rough Sets, Rough Topology, Lower Approximation, Upper Approximation, Core

1. Introduction

Rough set theory, introduced by Zdzislaw Pawlak, is a mathematical tool for representing, reasoning and decision making in the case of uncertain information. This theory deals with the approximation of sets or concepts by means of equivalence relations and is considered as one of the first non-statistical approaches in data analysis. Several interesting applications of the theory have come up, in particular, in Artificial Intelligence and Cognitive Sciences. The main advantage of rough set theory in data analysis is that, it does not require any preliminary or additional information of the data. The main difference between rough sets and fuzzy sets is that the rough sets have precise boundaries whereas fuzzy set theory is generally based on ill-defined sets of data, where the bounds are not precise and hence fuzzy predictions tend to deviate from exact values. The lower and upper approximations of a set are analogous to the interior and closure operations in a topology generated by data. In this paper, we have introduced a new topology called rough topology in terms of lower and upper approximations of a rough set and we have applied the concept of topological basis to find the deciding factors for chikungunya and diabetes.

2. Preliminaries

Definition 2.1 [6]: Let U be a non-empty finite set of objects called the universe and R be an equivalence relation on U named as the indiscernibility relation. The pair (U,R) is called the approximation space. Let X be a subset of U.
i) The lower approximation of X with respect to R is the
set of all objects, which can be for certain classified as X with respect to R and it is denoted by R*(X). That is, R*(X)= {R(x):R(x) ⊆ X} where R(x) denotes the equivalence class determined by x.
ii) The upper approximation of X with respect to R is the set of all objects, which can be possibly classified as X with respect to R and it is denoted by R*(X). That is, R*(X) = {R(x):R(x) ∩X ≠ }.
iii) The boundary region of X with respect to R is the set of all objects, which can be classified neither as X nor as not-X with respect to R and it is denoted by BRX. That is, BR(X)= R*(X) – R*(X).
The set X is said to be rough with respect to R if R*(X) ≠ R*(X). That is, if BR(X) ≠ .
Proposition 2.2[6]: If (U, R) is an approximation space and X and Y are subsets of U, then
i) R*(X) ⊆ X ⊆ R*(X)
ii) R*()= R*()= and R*(U) = R*(U)= U
iii) R*(X Y)= R*(X) R*(X)
iv) R*(X Y) ⊇ R*(X) R*(Y)
v) R*(X Y)= R*(X) R*(Y)
vi) R*(X Y) ⊆ R*(X) R*(Y)
vii) R*(X) ⊆ R*(Y) and R*(X) ⊆ R*(Y) whenever X ⊆ Y
viii) R*(XC)= [R*(X)]C and R*(XC) = [R*(X)]C
ix) R*R*(X)= R*R*(X) = R*(X)
x) R*R*(X)= R*R*(X)= R*(X)
Remark 2.3: R*: P(U) → P(U) satisfies the Kuratowski closure axioms that
i) R*() =
ii) X ⊆ R*(X)
iii) R*(X Y) = R*(X) R*(X)
iv) R*R*(X) = R*(X) for all subsets X and Y of U
If F = {X ⊆ U / R*(X) = X} ,using conditions (i) to (iv), we see that and U are in F; X Y ∈ F whenever X and Y are in F and Xα ∈ F for all Xα in F. Therefore, the family T, of complements of members of F is a topology on U. Thus, F is the family of T-closed sets. Also, Cl(X) = R*(X). Therefore, R* is the Kuratowski's closure operator.
Remark 2.4: Since R*: P(U) → P(U) satisfies the following properties that
i) R*(U) = U
ii) R*(X) ⊆ X
iii) R*(X Y) = R*(X) R*(Y)
iv) R*R*(X) = R*(X) for all subsets X and Y of U,
the operator R* is the interior operator.

3. Rough Topology

In this section we introduce a new topology called rough topology in terms of the lower and upper approximations.
Remark 3.1: Let U be the universe of objects and R be an equivalence relation on U. For X U, we define = {U , , R*X, R*(X), BRX}, where R*(X), R*(X) and BR(X) are respectively the upper approximation, the lower approximation and the boundary region of X with respect to R. We note that U and. Since R*(X) R*(X), R*(X) R*(X) = R*(X) R. Also, R*(X) BR(X)= R*(X) R and R*(X) BR(X) = R*(X) R. Also, R*(X) R*(X)= R*(X) R ; R*(X) BR(X)= BR(X) R and R*(X) BR(X)= R. Remark 3.1: Let U be the universe of objects and R be an equivalence relation on U. For X U, we define R = {U , , R*X, R*(X), BRX}, where R*(X), R*(X) and BR(X) are respectively the upper approximation, the lower approximation and the boundary region of X with respect to R. We note that U and R. Since R*(X) R*(X), R*(X) R*(X) = R*(X) R. Also, R*(X) BR(X)= R*(X) R and R*(X) BR(X) = R*(X) R. Also, R*(X) R*(X)= R*(X) R ; R*(X) BR(X)= BR(X) R and R*(X) BR(X)= R.
Definition 3.2: Let U be the universe, R be an equivalence relation on U and τR = {U,, R*(X), R*(X), BR(X)} where X ⊆ U. τR satisfies the following axioms:
i) U and ∈ τR.
ii) The union of the elements of any subcollection of τR is in τR.
iii) The intersection of the elements of any finite subcollection of τR is in τR.
τR forms a topology on U called as the rough topology on U with respect to X. We call (U, τR, X) as the rough topological space.
Example 3.3: Let U ={a,b,c,d,e}, U/R={{a,b},{c,d},{e}}, the family of equivalence classes of U by the equivalence relation R and X = {a,c,d}. Then R*(X) = {a,b,c,d}, R*(X) = {c,d} and BR(X) = {a,b}. Therefore the rough topology τR = {U, , {a,b,c,d}, {c,d},{a,b}}.
Proposition 3.4: If τR is the rough topology on U with respect to X, then the set B = {U, R*(X), BR(X)} is the basis for τR.
Proof:
i) A = U.
ii) Consider U and R*(X) from B. Let W = R*(X). Since and every x in belongs to W. If we consider U and BR(X) from B, taking W = BR(X), and every x in belongs to W, since . And when we consider R*(X) and BR(X), . Thus, B is a basis for R.
Definition 3.5: Let U be the universe and R be an equivalence relation on U. Let τR be the rough topology on U and βR be the basis for τR. A subset M of A, the set of attributes is called the core of R if βM ≠ βR-(r) for every r in M. That is, a core of R is a subset of attributes which is such that none of its elements can be removed without affecting the classification power of attributes.

4. Rough Topology in Chikungunya

Here we consider the problem of Chikungunya, a disease that is transmitted to humans by virus- carrying Aedes mosquitoes. There have been recent breakouts of CHIKV associated with severe illness. It causes fever and severe joint pain. Other symptoms include muscle pain, headache and nausea. Initial symptoms are similar to dengue fever. It is usually not life threatening. But the joint pain can last for a long time and full recovery may take months. Usually patient gets lifelong immunity from infection and hence re-infection is very rare. In recent decades the disease has spread to Africa and Asia, in particular, the Indian subcontinent.
Consider the following information table giving data about 8 patients.
Table 1.
PatientsJoint pain (J)Head- ache(H)Nausea (N)TemperatureChikungunya
P1YesYesYesHighYes
P2YesNoNoHighNo
P3YesNoNoHighYes
P4NoNoNoVery highNo
P5NoYesYesHighNo
P6YesYesNoVery highYes
P7YesYesNoNormalNo
P8YesYesNoVery highYes
The columns of the table represent the attributes (the symptoms for chikungunya) and the rows represent the objects (the patients). The entries in the table are the attribute values. The patient P5 is characterized by the value set (Joint pain, No), (Headache, Yes), (Nausea, Yes), (Temperature, High) and (Chikungunya, No), which gives information about the patient P5. In the table, the patients P1, P2, P3, P6, P7 and P8 are indiscernible with respect to the attribute 'Joint pain'. The attribute 'Joint pain' generates two equivalence classes, namely, {P1,P2,P3,P6,P7,P8} and {P4,P5}, whereas the attributes 'Joint pain' and 'Headache' generate the equivalence classes {P1, P6, P7, P8}, {P2,P3},{P4} and {P5}. The equivalence classes for the attributes Joint pain, Headache, Nausea and Temperature are {P1}, {P2,P3},{P4},{P5},{P6,P8} and {P7}. For the set of patients having chikungunya, the lower approximation = {P1,P6,P8} and the upper approximation = {P1, P2, P3, P6, P8} and hence the boundary region = {P2, P3}. Hence the patients P2 and P3 cannot be uniquely classified in view of the available knowledge. The patients P1, P6 and P8 display symptoms which enable us to classify them with certainty as having chikungunya. In our case, the symptoms Jointpain, Headache, Nausea and Temperature are considered as the condition attributes and the disease chikungunya is considered as the decision attribute. Not all condition attributes in an information system are necessary to depict the decision attribute before decision rules are generated. It may happen that the decision attribute depends not on the whole set of condition attributes but on a subset of it and hence we are interested to find this subset which is given by the core. Here U = {P1,P2,...,P8}.
Case1: Let X = {P1,P3,P6,P8}, the set of patients having chikungunya. Let R be the equivalence relation on U with respect to the condition attributes. The family of equivalence classes corresponding to R is given by U/I(R) = {{P1}, {P2,P3}, {P4}, {P5}, {P6,P8}, {P7}}. The lower and upper approximations of X with respect to R are given by R*(X) = {P1,P6,P8} and R*(X)= {P1,P2,P3,P6,P8}. Therefore, the rough topology on U with respect to X is given by τR = {U, , {P1,P6,P8}, {P1,P2,P3,P6,P8}, {P2,P3}}.The basis for this topology τR is given by βR = {U, {P1,P6,P8},{P2,P3}}. If we remove the attribute 'Joint pain' from the set of condition attributes, the family of equivalence classes corresponding to the resulting set of attributes is given by U/I(R-(J)) = {{P1,P5}, {P2,P3}, {P4}, {P6,P8}, {P7}}. The corresponding lower and upper approximations are given by (R-(J))*(X)= {P6,P8}; (R-(J))*(X)= {P1,P2,P3,P5,P6,P8} and hence τR-(J) ={U,, {P6,P8}, {P1,P2,P3,P5,P6,P8}, {P1,P2,P3,P5}} and its basis βR-(J)={U,{P6,P8}, {P1,P2,P3,P5}}≠ βR. If we remove the attribute 'Headache' from the set of condition attributes, the family of equivalence classes corresponding to the resulting set of attributes is given by U/I(R-(H))={{P1},{P2,P3}, {P4},{P5}, {P6,P8},{P7}} which is the same as U/I(R) and hence τR-(H) = τR and βR-(H) = βR. On removal of the attribute 'Nausea', we get U/I(R-(N))={{P1},{P2,P3}, {P4},{P5},{P6,P8}, {P7}}= U/I(R) and hence τR-(N) = τR and βR-(N) = βR. When the attribute 'Temperature' is omitted, U/I(R-(T)) = {{P1}, {P2,P3}, {P4}, {P5}, {P6,P7,P8}}. (R-(T))*(X)={P1}; (R-(T))*(X)={P1,P2,P3,P6,P7,P8}. Therefore,τ(R-(T))={U,, {P1}, {P1,P2,P3,P6,P7,P8},{P2,P3,P6,P7,P8}} and its basis βR-(T) = {U, {P1}, {P2,P3,P6,P7,P8}} ≠ βR. If M = {J,T}, then the basis for the rough topology corresponding to M is given by βM = {U,{P6,P8}, {P1,P2,P3}}. Also βM ≠ βR-(x) for all x in M. Therefore, CORE(R) = {J,T}.
Case2: Let X ={P2,P4,P5,P7},the set of patients not having chikungunya. Then U/I(R) = {{P1}, {P2,P3}, {P4}, {P5}, {P6,P8}, {P7}}. R*(X) = {P4,P5,P7} and R*(X) = {P2,P3,P4, P5,P7}. Therefore τR = {U,, {P4,P5,P7}, {P2,P3,P4,P5,P7}, {P2,P3}} and βR = {U, {P4,P5,P7},{P2,P3}}. Omitting the attribute 'Jointpain', U/I(R-(J)) = {{P1,P5}, {P2,P3}, {P4}, {P6,P8}, {P7}}. (R-(J))*(X) = {P4,P7}; (R-(J))*(X) = {P1,P2,P3,P4,P5,P7} and hence τR-(J) = {U, , {P4,P7}, {P1,P2,P3,P4,P5,P7}, {P1,P2,P3,P5}} and its basis βR-(J) {U,{P4,P7}, {P1,P2,P3,P5}} ≠ βR. If the attribute 'Headache' is removed, U/I(R-(H)) = {{P1}, {P2,P3}, {P4}, {P5},{P6,P8}, {P7}} which is the same as U/I(R) and hence βR-(H) = βR. On removal of the attribute 'Nausea', we get U/I(R-(N)) = {{P1}, {P2,P3}, {P4}, {P5}, {P6,P8}, {P7}},which is the same as U/I(R) and hence τR-(N) = τR and βR-(N) = βR. When the attribute 'Temperature' is omitted, U/I(R-(T)) = {{P1}, {P2,P3}, {P4}, {P5}, {P6,P7,P8}}. (R-(T))*(X) = {P4,P5}; (R-(T))*(X) = {P2,P3,P4,P5,P6,P7, P8}.Therefore, τR-(T) = {U, , {P4,P5}, {P2, P3, P4, P5, P6, P7, P8}, {P2,P3,P6,P7,P8}} and its basis βR-(T) = {U, {P4,P5}, {P2,P3,P6,P7,P8}} ≠ βR. If M = {J,T}, U/I(r)= {{P1,P2,P3}, {P4,P5}, {P6,P8}, {P7}}, r*(X)= {P4,P5,P7} and r*(X)= {P1, P2, P3, P4, P5, P7} where r is the equivalence relation on U with respect to M. Therefore, βM = {U, {P4,P5,P7},{P1,P2,P3}} ≠ βR-(x) for every x in M. Therefore, here again, CORE(R) = {J,T}.
Observation: From both cases we conclude that 'Jointpain' and 'Temperature' are the key attributes necessary to decide whether a patient has chikungunya or not.

5. Rough Topology in Diabetes

Diabetes is a group of metabolic diseases in which a person has high blood sugar, either because the body does not produce enough insulin, or because cells do not respond to the insulin that is produced. In diabetes, glucose in the blood cannot move into cells, so it stays in the blood. This not only harms the cells that need the glucose for fuel, but also harms certain organs and tissues exposed to the high glucose levels. This high blood sugar produces the classical symptoms of polyuria (frequent urination), weight loss and polyphagia (increased hunger).
Consider the following table giving information about six patients
Table 2.
PatientsFrequent Urination (F)Weight Loss (W)Increased Hunger (H)Diabetes
P1YesYesNoYes
P2YesNoYesYes
P3YesNoNoYes
P4NoYesYesNo
P5NoYesNoNo
P6NoNoYesNo
Here, U = {P1,P2,P3,P4,P5,P6} and Frequent Urination (F), Weight Loss (W) and Increased Hunger (H) form the condition attributes. Let X ={P1,P2,P3}, the set of patients having diabetes.
U/I(R) ={{P1}, {P2}, {P3}, {P4}, {P5}, {P6}}. The lower and upper approximations of X with respect to R are given by R*(X) = {P1,P2,P3} and R*(X) = {P1,P2,P3}. Therefore BR(X) = . The rough topology on U is τR = {U, , {P1,P2,P3}} and its basis, βR = {U, {P1,P2,P3}}. If the attribute 'Frequent Urination' is removed from the set of condition attributes, then U/I(R-(F)) ={{P1,P5},{P3},{P4},{P2,P6}}. (R-(F))*(X)= {P3}; (R-(F))*(X) = {P1,P2,P3,P5, P6} and hence τR-(F) ={U, , {P3}, {P1,P2,P3,P5,P6},{P1,P2,P5,P6}} and its basis βR-(F)= {U, {P3}, {P1,P2,P5,P6}} ≠ βR. If the attribute 'Weight Loss' is removed, then U/I(R-(W)) = {{P1,P3}, {P2}, {P4}, {P6}, {P5}}. (R-(W))*(X) = {P1,P2,P3} and (R-(W))*(X)={P1,P2,P3} and hence and its basis βR-(W) = {U,{P1,P2,P3}} = βR. If the attribute ' Increased Hunger' is removed, U/I(R-(H)) = {{P1}, {P2,P3}, {P4,P5}, {P6}}. (R-(H))*(X) = {P1,P2,P3} and (R-(H))*(X)= {P1,P2,P3}. Therefore τR-(H) = τR and its basis βR-(H) = βR. If M ={F}, we see that βM ≠ βR-(F). Therefore, CORE(R) = {F}. Similarly if X is taken as the set of patients not having diabetes, then again CORE(R) = {F}.
Observation: Since the core of R has F as its only element, 'Frequent Urination' is the key attribute that has close connection to the disease diabetes .
The procedure applied in the above two cases can be put in the form of an algorithm as follows:
Algorithm:
Step 1: Given a finite universe U, a finite set A of attributes that is divided into two classes, C of condition attributes and D of decision attribute, an equivalence relation R on U corresponding to C and a subset X of U, represent the data as an information table, columns of which are labeled by attributes, rows by objects and entries of the table are attribute values.
Step 2: Find the lower approximation, upper approximation and the boundary region of X with respect to R.
Step 3: Generate the rough topology τR on U and its basis βR.
Step 4: Remove an attribute x from C and find the lower and upper approximations and the boundary region of X with respect to the equivalence relation on C -(x).
Step 5: Generate the rough topology τR -(x) on U and its basis βR-(x).
Step 6: Repeat steps 3 and 4 for all attributes in C.
Step 7: Those attributes in C for which βR-(x) ≠ βR form the core (R).

6. Conclusions

In this work, we have shown that real world problems can be dealt with the rough topology. The concept of basis has been applied to find the deciding factors of a recent outbreak 'Chikungunya' which had been reported especially, in South India and a chronic disease 'Diabetes'. We could find that Joint pain and Temperature are the deciding factors for chikungunya and frequent urination is the only deciding symptom for diabetes. It is also seen that from a clinical point of view, the rough topological model is on par with the medical experts with respect to the diseases analyzed here. The proposed rough topology can be applied to more general and complex information systems for future research. The rough set model is based on the original data only and does not need any external information, unlike probability in statistics or grade of membership in the fuzzy set theory. It is also a tool suitable for analyzing not only quantitative attributes but also qualitative ones. The results of the rough set model are easy to understand, while the results from other methods need an interpretation of the technical parameters. Thus it is advantageous to use rough topology in real life situations.

References

[1]  Jansi Rani,P.G., and Bhaskaran,R., Computation of reducts using topology and measure of significance of attributes, Journal of Computing 2 (2010)50-55.
[2]  Lashin,E.F., and Medhat,T., Topological reduction of information systems, Chaos, Solitons and Fractals 25 (2005) 277-286.
[3]  Rady,E.A., Kozae,A.M. and Abd El-Monsef,M.M.E., Generalized rough sets, Chaos, Solitons and Fractals 21 (2004) 49-53.
[4]  Salama,A.S., Some topological properties of rough sets with tools for data mining, IJCSI International Journal of Computer Science issues 8 (2011) 588-595.
[5]  Yuhuaqian, Chuangyin Dang, Jiye Liang, and Dawei Tang, Set- valued information systems, Information Sciences 179 (2009) 2809-2832.
[6]  Zdzislaw Pawlak, Rough set theory and its applications, Journal of Telecommunications and Information Technology 3(2002)7-10
[7]  Zuqiang Meng, and Zhongzhi Shi, A fast approach to attribute reduction in incomplete decision systems with tolerance relation - based rough sets, Information Sciences 179 (2009) 2774-2793.