Abstract
The present paper proposes a novel version of inducing nano topology by using new kinds of approximation operators via two ideals with respect to a general binary relation. This approach improves the accuracy of the approximation quite significantly. These newly defined approximations constitute the generalized version of rough sets defined by Pawlak in 1982. A comparison is drawn between the suggested technique and the already existing ones to demonstrate the significance of the proposed ideology. In addition, the standard notion of nano topology, based on an equivalence relation is generalized to the binary relation, which can have a broader scope when applied to intelligent systems. Also, the significance of this approach is demonstrated by an example where an algorithm is given to find the key factors responsible for the profit of a company along with the comparison to the previous notions. Likewise, the proposed algorithm can be used in all fields of science to simplify complex information systems in extracting useful data by finding the core.
Introduction
The concepts of rough sets and topology have successfully been applied not only in mathematics but to various fields of science such as physics, chemistry, biochemistry, environmental sciences, etc. Research in these fields reveals that these theories hold a huge potential in simplifying and interpreting practical-life problems and situations which rely on multiple attributes. Intriguingly, the approximation operators, which play the key role in rough set theory, have some inbuilt topological properties like interior and closure, induced by a relation on a finite set known as the universe. So, the conjoint study of rough set theory and topology can be utilized in the mathematical modeling of qualitative and quantitative data. The notion of rough set [38] was first introduced by Pawlak as an extended version of set theory in which upper and lower approximation operators were introduced to define a set, which has been proven to be quite beneficial in investigating intelligent systems. This theory has been applied to a broad range of real-life problems like decision-making, data mining, machine learning, and image processing [1, 37]. Nano topology is an emerging branch of mathematics, which is motivated by the rough set theory and provides an interdisciplinary forum, emphasizing the advancements in engineering as well as medical sciences. In the past few decades, the generalizations of rough set theory [5, 30] were given to overcome the drawback of equivalence relation in generating granularity (neighborhood base). Also, numerous topological approaches were given to improve the accuracy of the approximation of rough sets [17, 32–36]. Similarly, the generalizations of the standard definition of nano topology [4, 29] were given to investigate novel approaches that can be more appropriate or suitable, when applied to real-life situations.
A new technique of approximation via two ideals was proposed by A. Kandil, which has been proven better than the previous ones as it has served in reducing the boundary region and hence increasing the degree of accuracy in rough set theory [6]. Over the past few years, many theories have been given to induce a nano topology through different mathematical tools like neutrosophic sets [26], fuzzy sets [20], Pythagorean sets [12], ideals [4, 7], graphs [3, 29], etc.
Although nano topology is a dwarf topology, it has numerous applications. One of these applications is decision-making by finding the core [14, 18]. Nano topology, although small in size, has successfully been applied to medical and other fields. Interestingly, nano topology in association with the graph theory has simplified many biological processes such as blood circulation in the human heart, fetal circulation, urinary system, etc [4, 29]. It has also helped in detection of the diseases like lung disease and covid-19 [22, 31]. Nano topology has helped in discovering the medical significance of a plant named Couroupita guianensis Abul and also the covid-19 most effective preventive measures by using the concept of a nano topological space [11]. Nano topology has helped in the reduction of electric transmission lines [2].
Many researchers have worked on weak open forms of nano sets [19, 22] using the approach of general topology. In this paper, a new nano topology is generated by using lower and upper approximation operators, defined via two ideals w.r.t a binary relation. Novel terminology is coined in terms of this newly defined space. Some properties and results are investigated. Remarkably, this theory of approximation can further be generalized to ’n’ ideals. At last, a comparison of this approach is drawn with the already existing ones, which implies that the significance of instituting this amalgamation is that the computational techniques, based on the single ideal won’t give the best results but a blend of two or more can often accomplish so. Furthermore, a real-life application of our proposed theory is discussed and the accuracy measure as compared to the previous notion is verified to be better as illustrated by an example of a company’s profit or loss.
Preliminaries
This section comprises the already existing definitions and notations that will be used in this paper. It is to be noted that throughout this paper, NT, n . t . s, a . s, n . o, n . c, b . i . n . o, b . i . n . c, BINT, b . i . n . t . s are the abbreviations for the nano topology, nano topological space, approximation space, nano open, nano closed, bi-ideal nano open, bi-ideal nano closed, bi-ideal nano topology and bi-ideal nano topological space respectively.
This is known as a lower approximation of Z w.r.t
This is known as an upper approximation of Z w.r.t
This is known as the boundary region of Z w.r.t Let
Then,
(i)
(ii)
<Id1, Id2 > ≠ ∅ .
Clearly, the collection <Id1, Id2> is an ideal on U.
Expressing mathematically,
Here,
Generation of nano topology via bi-ideal approximation space
In this section, we generate the bi-ideal nano topology using the two ideals.
Now, define the collection
This collection forms a topology as it satisfies all three properties of topology. This topology is called a bi-ideal nano topology (BINT). The pair (U, τ<Id1,Id2> (Z)) is called a bi-ideal nano topological space (b . i . n . t . s) w.r.t Z. All elements of this space are called bi-ideal nano open (b . i . n . o) sets and complements are called bi-ideal nano closed (b . i . n . c) sets. Complements of b . i . n . o sets, together form the dual bi-ideal NT.
Also, let Id1 = {∅ , {r}} and Id2 = {∅ , {z}}.
So, <Id1, Id2 > = {∅ , {r} , {z} , {r, z}} . If
Then τ<Id1,Id2> (Z) = {∅ , U, {x, y} , {x, r, y} , {r}} and (U, τ<Id1,Id2> (Z)) is a b . i . n . t . s.
Also, let Id1 = {∅ , {a}} and Id2 = {∅ , {a} , {d} , {d, a}}.
So, <Id1, Id2 > = {∅ , {a} , {d} , {d, a}}. If
Clearly, here
Then τ<Id1,Id2> (Z) = {∅ , U, {b, d}} and
(U, τ<Id1,Id2> (Z)) is a b . i . n . t . s.
The collection τ<Id1,Id2> (Z) = {∅ , U} is an indiscrete BINT. If If If then If then (This collection forms a discrete BINT).
η<Id1,Id2>int (L). This is the largest b . i . n . o . subset of L.
Let U be {y, z, x, r} and Z be {r, y}.
If Id1 = {∅ , {r}} and Id2 = {∅ , {z}},
then, <Id1, Id2 > = {∅ , {r} , {z} , {r, z}} . If
then τ<Id1,Id2> (Z) = {∅ , U, {y, x} , {y, r, x} , {r}}.
(U, τ<Id1,Id2> (Z)) is a b . i . n . t . s w.r.t Z. Also, the collection of b . i . n . o sets is {∅ , U, {x, y} , {r, y, x} , {r}} and the collection of b . i . n . c sets is {∅ , U, {z, r} , {x, y, z} , {z}}. If L ={x, y} (b . i . n . o), then η<Id1,Id2>int (L) = L . If L = {x, r}, then η<Id1,Id2>int (L) = {r} . If L = {y, x, z} (b . i . n . c set), then η<Id1,Id2>cl (L) = L . If L = {x, z}, then η<Id1,Id2>cl (L) = {x, y, z} .
Let P be a b . i . n . o . set containing z.
Since P is b . i . n . o, U - P is b . i . n . c set. If L∩ P = ∅, then L ⊆ U - P, U - P is a b . i . n . c set containing L. Thus, η<Id1,Id2>cl (L) ⊆ U - P, which is not true due to the fact that z ∈ η<Id1,Id2>cl (L) but z ∉ U - P. Therefore, L∩ P ≠ ∅ for every b . i . n . o set G containing z.
Conversely, let L∩ P ≠ ∅ for every b . i . n . o set P having z. If z ∉ η<Id1,Id2>cl (L), then z ∈ U - η<Id1,Id2>cl (L). As U - η<Id1,Id2>cl (L) is a b . i . n . o . set and thus (U - η<Id1,Id2>cl (L))∩ L ≠ ∅ (By assumption). As L⊆ η<Id1,Id2>cl (L) ⇒U - η<Id1,Id2>cl (L) ⊆ U - L . ⇒ (U - η<Id1,Id2>cl (L)) ∩ L ⊆ (U - L) ∩ L = ∅, which is a contradiction.
Hence, z ∈ η<Id1,Id2>cl (L).
U - η<Id1,Id2>int (L)= η<Id1,Id2>cl (U - L) . ⇔z ∈ η<Id1,Id2>cl (U - L) . Hence, z ∈ U - η<Id1,Id2>int (L) ⇒z ∈ η<Id1,Id2>cl (U - L) . So, U - η<Id1,Id2>int (L) ⊆ η<Id1,Id2>cl (U - L) . Conversely, let z ∈ η<Id1,Id2>cl (U - L) . Then P∩ (U - L) ≠ ∅ for each b . i . n . o . set P containing z, i.e., PnotsubseteqL for every b . i . n . o . set P containing z, i.e., z ∉ η<Id1,Id2>int (L) . Therefore, z ∈ U - η<Id1,Id2>int (L) . ⇒ η<Id1,Id2>cl (U - L) ⊆ U - η<Id1,Id2>int (L) Hence, U - η<Id1,Id2>int (L) = η<Id1,Id2>cl (U - L) . U - η<Id1,Id2>cl (L)= η<Id1,Id2>int (U - L) . Since, z ∉ η<Id1,Id2>cl (L), so by Theorem 3.7, for every b . i . n . o . set P containing z, P ∩ L = ∅ , P ⊆ U, L ⊆ U⇒z ∉ L, z ∈ P ⊆ U⇒z ∈ U - L. So, z ∈ η<Id1,Id2>int (U - L). ∴ U - η<Id1,Id2>cl (L) ⊆ η<Id1,Id2>int (U - L). Conversely, if z ∈ η<Id1,Id2>int (U - L) ⇒z ∈ (U - L) ⇒z ∉ L, z ∈ U, then for each b . i . n . o . set P containing z, P∩ L = ∅ for P ⊆ U, L ⊆ U . By Theorem 3.7, z ∉ η<Id1,Id2>cl (L) but z ∈ P ⊆ U. ⇒z ∈ U - η<Id1,Id2>cl (L). ⇒η<Id1,Id2>int (U - L) ⊆ U - η<Id1,Id2>cl (L). Therefore, U - η<Id1,Id2>cl (L)= η<Id1,Id2>int (U - L) .
η<Id1,Id2>int (L) = U - η<Id1,Id2>cl (U - L) .
η<Id1,Id2>cl (L) = U - η<Id1,Id2>int (U - L) .
L ⊆ η<Id1,Id2>cl (L). L is b . i . n . c . iff η<Id1,Id2>cl (L) = L. Therefore, η<Id1,Id2>cl (L) = L. Conversely, if η<Id1,Id2>cl (A) = L, then L is the smallest b . i . n . c . set containing itself and hence L is b . i . n . c ..
η<Id1,Id2>cl (∅) = ∅ and η<Id1,Id2>cl (U) = U. η<Id1,Id2>cl (U) = U. L ⊆ M⇒η<Id1,Id2>cl (L) ⊆ η<Id1,Id2>cl (M).
η<Id1,Id2>cl (L ∪ M) = η<Id1,Id2>cl (L) ∪ η<Id1,Id2>cl (M). so, by (4), η<Id1,Id2>cl (L) ⊆ η<Id1,Id2>cl (L ∪ M). Also, η<Id1,Id2>cl (M) ⊆ η<Id1,Id2>cl (L ∪ M). This implies, η<Id1,Id2>cl (L) ∪ η<Id1,Id2>cl (M) ⊆ η<Id1,Id2>cl (L ∪ M) . As L ∪ M ⊆ η<Id1,Id2>cl (L) ∪ η<Id1,Id2>cl (M) and η<Id1,Id2>cl (L ∪ M) is the smallest b . i . n . c . set containing L ∪ M. So, η<Id1,Id2>cl (L ∪ M) ⊆ η<Id1,Id2>cl (L) ∪ η<Id1,Id2>cl (M). Thus, η<Id1,Id2>cl (L ∪ M) = η<Id1,Id2>cl (L) ∪ η<Id1,Id2>cl (M).
η<Id1,Id2>cl (L ∩ M) ⊆ η<Id1,Id2>cl (L) ∩ η<Id1,Id2>cl (M) so, by (4), η<Id1,Id2>cl (L ∩ M) ⊆ η<Id1,Id2>cl (L). Also, η<Id1,Id2>cl (L ∩ M) ⊆ η<Id1,Id2>cl (M). Therefore, η<Id1,Id2>cl (L ∩ M) ⊆ η<Id1,Id2>cl (L) ∩ η<Id1,Id2>cl (M).
η<Id1,Id2>cl (η<Id1,Id2>cl (L)) = η<Id1,Id2>cl (L). η<Id1,Id2>cl (η<Id1,Id2>cl (L)) = η<Id1,Id2>cl (L). (by (2)).
L is b . i . n . o . iff η<Id1,Id2>int (L) = L. (by Theorem 3.10 (2)) ⇔U - η<Id1,Id2>cl (U - L) = L . ⇔ η<Id1,Id2>int (L) = L (by Theorem 3.9).
η<Id1,Id2>int (∅) = ∅ and η<Id1,Id2>int (U) = U. L ⊆ M⇒η<Id1,Id2>int (L) ⊆ η<Id1,Id2>int (M). Hence, by Theorem 3.10 (4), η<Id1,Id2>cl (U - M) ⊆ η<Id1,Id2>cl (U - L) . ⇒U - η<Id1,Id2>cl (U - L) ⊆ U - η<Id1,Id2>cl (U - M). ⇒η<Id1,Id2>int (L) ⊆ η<Id1,Id2>int (M) (by Theorem 3.8).
η<Id1,Id2>int (L) ∪ η<Id1,Id2>int (M) ⊆ η<Id1,Id2>int (L ∪ M). by (3), η<Id1,Id2>int (L) ⊆ η<Id1,Id2>int (L ∪ M). Also, η<Id1,Id2>int (M) ⊆ η<Id1,Id2>int (L ∪ M). This implies, η<Id1,Id2>int (L) ∪ η<Id1,Id2>int (M) ⊆ η<Id1,Id2>int (L ∪ M).
η<Id1,Id2>int (L ∩ M) = η<Id1,Id2>int (L) ∩ η<Id1,Id2>int (M). so, by (3), η<Id1,Id2>int (L ∩ M) ⊆ η<Id1,Id2>int (L) ∩ η<Id1,Id2>int (M). By the fact that η<Id1,Id2>int (L) ∩ η<Id1,Id2>int (M) ⊆ L ∩ M and η<Id1,Id2>int (L ∩ M) is the largest b . i . n . o set contained in L ∩ M, then η<Id1,Id2>int (L) ∩ η<Id1,Id2>int (M) ⊆ η<Id1,Id2>int (L ∩ M). So, η<Id1,Id2>int (L ∩ M) = η<Id1,Id2>int (L) ∩ η<Id1,Id2>int (M).
η<Id1,Id2>int (η<Id1,Id2>int (L)) = η<Id1,Id2>int (L). η<Id1,Id2>int (η<Id1,Id2>intL)) = η<Id1,Id2>int (L) (by (1)).
Comparison of this approach to previous ones
The concept of measurement of accuracy plays an imperative role in decision-making when the rough set theory or nano topology is applied to intelligence systems or the physical world. It is evident that this approach using two ideals to induce topology is a generalization of the previous one because induction of nano topology via a single ideal is the special case of this technique, wherein Id1 and Id2, both coincide. As lower approximation increases and the boundary region decreases, thereby resulting in better precision in investigating the interrelation between condition attributes and decision attributes, so it has a huge potential for further research and physical significance. Also, as this theory generalizes the standard definition applicable to equivalence relation to a binary relation which is a broader concept, so it has a wider range and scope in future perspective. The following remarks are illustrated to mark the distinction between current ideology and the already established ones:
μ (Z) ≤ μ
Id
i
(Z) ≤ μ<Id1,Id2> (Z) for i=1,2. Here, μ stands for accuracy measure, that is, the ratio of lower to upper approximation.
τ<Id1,Id2> (Z) ⊈ τId
i
(Z) for i=1,2 and vice - versa. In general, bi-ideal NT is not comparable with the topology induced via single ideal.
In general, bi-ideal NT is not comparable with the standard definition of NT. Bi-ideal approximations coincide with the single ideal approximations if Id1 = Id2, so bi-ideal NT is a generalisation of the NT, generated by a single ideal, τ
Id
(Z). If the relation is equivalence and Id1 = Id2 =∅, then the bi-ideal NT is same as the standard definition of NT, that is
Id1 = {∅ , {m}}, Id2 = {∅ , {n}}.
So, <Id1, Id2 > = {∅ , {m} , {n} , {n, m}}.
The comparison of the proposed theory with the already existing ones is shown in Tables 1–5:
The comparison of the lower approximation operators of a rough set Z w.r.t relation
of the proposed topology with the existing ones
The comparison of the lower approximation operators of a rough set Z w.r.t relation
The comparison of the upper approximation operators of a rough set Z w.r.t relation
The comparison of the boundaries of a rough set Z w.r.t relation
The comparison of the bi-ideal nano topology with the existing ones
The comparison of the accuracy measures of approximation of the proposed topology with the existing ones
In this section, we will discuss an algorithm for finding the key factors responsible for any decision using the concept of finding core through a bi-ideal NT. A real-life example has also been discussed, where the concept of bi-ideal NT has been applied to find the key factors responsible for a company’s profit/loss of a company, thereby, illustrating the significance of the following algorithm:
Algorithm
Step 1: Provided a finite universal set U, a finite set A of attributes which may further be classified as two categories, A1 of conditional attributes and A2 of decision attributes, an indiscernibility relation
Step 2: Find the lower approximation, upper approximation, and the boundary region of Z w.r.t
Step 3: Induce the bi-ideal NT τ<Id1,Id2> (Z) on U.
Step 4: Eliminate an attribute z from A1. Then, find the lower, upper approximations and the boundary region of Z again w.r.t the modified equivalence relation on A1 - {z}.
Step 5: Generate the new bi-ideal NT
Step 6: Repeat steps 4 and 5 for each attribute in A1.
Step 7: The attributes in A1 for which
Example
The performance of a company or an organization is governed by the concept of profit and loss. The profit of a company depends on various factors. In this example, the proposed algorithm based on the bi-ideal nano topological model is used to find the key factors responsible for the success of a firm or business. Let U = {Q1, Q2, Q3, Q4, Q5, Q6, Q7, Q8, Q9, Q10} be the set of 10 companies. This set is the universe. The Table 6 represents the data of the ten companies, with respect to the conditional attributes namely, Brand Image (B.I.), Quality of product (Q.O.P.), marketing/advertisement (M./A.), competition (Comp.), revenue (Rev.), product packaging (P.P.).
The data of the ten companies, with respect to various conditional attributes governing profit/loss
The data of the ten companies, with respect to various conditional attributes governing profit/loss
Also, let Z = {Q1, Q4, Q7, Q9, Q10} be the five companies that have gained profit in a particular time-frame by selling a product and Z C = {Q2, Q3, Q5, Q6, Q8} be the set of the companies which have undergone loss by the sale of a product in that time-frame.
Here, Id1 = {∅ , {Q1} , {Q3} , {Q1, Q3}} and Id2 = {∅ , { Q5} , { Q3} , { Q9} , { Q3, Q9} , {Q5, Q9} , {Q3, Q9} , { Q3, Q5, Q9}} . <Id1, Id2 > = {∅ , { Q1} , { Q3} , { Q5} , {Q9} , {Q3, Q5} , {Q5, Q9} , {Q3, Q9} , { Q1, Q3} , { Q1, Q9} , {Q1, Q5} , {Q1, Q3, Q5} , {Q1, Q3, Q9} , {Q1, Q5, Q9} , {Q3, Q5, Q9} , {Q1, Q3, Q5, Q9}} .
Here Id1 and Id2 represent the reports of companies by external experts 1 and 2. <Id1, Id2> is the ideal generated by Id1 and Id2 means collective report of both experts.
Here, the decision attributes are profit or loss, i.e., domain of decision attribute = { profit, loss}.
Domain of attribute (B.I.) = {good, bad}.
Domain of attribute (Q.O.P) = {excellent, superior, inferior}.
Domain of marketing/advertisement (M./A.) = {average, good, poor}.
Domain of competition (COMP.) = {high, low}.
Domain of revenue (REV.) = {great, moderate}.
Domain of product packaging (P.P.) = {attractive, normal, unattractive}. Now, if
If Id1, Id2 are given and Z ⊆ U, then the bi-ideal NT can be given by
Then, if we remove a certain attribute {X1},
New notation or equivalence classes w.r.t
Then,
and B<Id1,Id2> (Z) = {Q3, Q6, Q10}.
Hence, bi-ideal NT is τ<Id1,Id2> (Z) = {∅ , U, {Q1, Q4, Q7, Q9} , {Q1, Q3, Q4, Q6, Q7, Q9, Q10} , {Q3, Q6, Q10}} .
“Marketing/advertisement"(M./A.) from the set of attributes, then we have
Hence,
Let μ stand for an accuracy measure. A comparison of the suggested approach with existing ones is shown in Table 7:
The comparison of the accuracy measures of a rough set Z w.r.t relation
It is remarkable that
The motivation of this study is that this concept can be used to determine a decision based on multiple opinions, rather than one. Also, the main advantage of this ideology is that the accuracy using this approach is significantly greater than the already existing ones. As the bi-ideal approach assimilates together the notion of combined opinions through two ideals, it can further be generalized to ‘n’ ideals (‘n’ opinions) and hence a mathematical model can be designed to study the interdependence of various factors and various situations, which arise in fields of physics, chemistry, and biology. This approach can help in simplification and easy interpretation of any information system by removing unwanted data. Hence, it can contribute a lot to studying the qualitative and quantitative properties of various elements, compounds, and species. This study has a great scope in medicine, biochemistry, and engineering.
Conclusion
The term “nano topology” was coined by M.L Thivagar [27], which was a revolutionary idea as it served in the fields of engineering, sciences, and technology. Over the past decade, various theories have been given by many researchers in which nano topology was generated by approximations in rough sets via ideals, graphs, neutrosophic sets, fuzzy sets, Pythagorean sets, etc. This paper extends the idea of approximation via a single ideal to two ideals, which may further be generalized to any finite no. of ideals, which can help in framing an algorithm to deal with condition attributes and decision attributes via a collaborated viewpoint of multiple opinions. A study on its range of applications is currently in progress.
