Abstract
Intuitionistic Fuzzy Sets () and rough sets depending on covering are important theories for dealing with uncertainty and inexact problems. We think the neighborhood of an element is more realistic than any cluster in the processes of classification and approximation. So, we introduce intuitionistic fuzzy sets on the space of rough sets based on covering by using the concept of the neighborhood. Three models of intuitionistic fuzzy set approximation space based on covering are defined by using the concept of neighborhood. In the first and second model, we approximate IFS by rough set based on one covering (C) by defining membership and non-membership degree depending on the neighborhood. In the third mode, we approximate IFS by rough set based on family of covering () by defining membership and non-membership degree depending on the neighborhood. We employ the notion of the neighborhood to prove the definitions and the features of these models. Finlay, we give an illustrative example for the new covering rough approximation structure.
Keywords:
neighborhood; intuitionistic fuzzy sets; covering lower and upper approximation space; rough intuitionistic fuzzy sets MSC:
54A05; 54C05; 54C10; 54A10; 26A21
1. Introduction
The equivalence relation is the main tool for classification algorithms by Pawlak rough theory [1]. Pawlak’s model is suitable for discrete data but not continuous data, as the cost of computation becomes too high. So, many extensions of Pawlak’s model have been studied by many researchers, such as probabilistic rough sets [2], fuzzy rough set models [3], tolerance relations [4], similarity rough sets [5], decision-theoretic rough sets [6], rough sets based on covering [7] and probabilistic rough sets [2]. One of the most important extensions of rough set models are neighborhood rough set systems [8]. These systems can deal with discrete and continuous data by using the -neighborhood relation. Neighborhood rough set models have many application in feature selection [9,10,11,12].
X. Zhan-Ao et al. [13] combined rough sets depending on covering and IFSs using the concept of minimal description. In our approach, we use the neighborhood concept in the approximation of IFS defined on rough sets depending on covering. Many scholars, such as Goguen [14], Gau et al. [15] and Nada et al. [16], extended fuzzy set concepts in various directions after Zadeh [17] discovered them in 1965. Since then, fuzzy set concepts have been used in topology, analysis and other branches of mathematics. The definition of is one of the important generalizations of fuzzy sets, which has been presented by Atanassov [18], and it is a group that is important for the importance of its applications. theories, such as in [19,20], are more convenient and are also applied in decision making in various fields, including programming, health [11,21,22] and decision-making problems [23,24,25]. Dubois and Prade extended the fuzzy lower () and fuzzy upper approximation () in the approximation structure of Pawlak to obtain a rough fuzzy set [26]. Although is a generalization of classical fuzzy sets and rough sets depending on covering, it is a generalization of classical rough sets. The combination of rough sets depending on covering and has gained the attention of many researchers, and many studies have been conducted using single-granulation methods [27,28,29,30,31,32]. Pawlak’s rough sets depending on single-granulation have been generalized to rough sets depending on multi-granulation (MGRSs) [33]. Zhan-Ao et al. [13] combined rough sets depending on covering and using the concept of minimal description. In this paper, we introduce this combination by using the concepts of neighborhood for each element of the universe. We think that the neighborhood of an element is more realistic than its description. So, it will be the best in classification processes and decision making. We process this combination for both single-granulation and multi-granulation. We introduce many basic concepts related to , fuzzy set, rough and structure.
2. Preliminaries
Definition 1
([17]). Assume that is a non-empty set. A fuzzy set H is characterized by a membership function from to and totally characterizing the fuzzy set H is . In what comes next, let us assume that U, the universe of discourse, is finite.
Definition 2
([18]). An on a universe is an object of the form . Such that is said to be "degree of membership of in H ", and is called the "degree of non-membership of in H" since , such that is called the hesitation part. The next example illustrates a collection of faction plants and the presence or absence of yellow cards. Next is an example of faction plants and yellow cards or not. , .
Definition 3
([18]). AIf two IFS on, then the IFS iff, and .
Definition 4
([18]). An equal to iff and .
Definition 5
([23]). If are two IFS on, then the IFS , .
Definition 6
([23]). If two IFS on, then the IFS .
Definition 7
([34,35]). Let U be a universe and C be a family of subsets of U whenever no subset in C is empty and ∪. Then, C is called a covering of U. Clearly, a partition of U is also a covering of U, hence the notion of a covering extends the notion of a partition.
Definition 8
([34,35]). If U is a non-empty set, and C a covering of U, then the ordered pair is called a covering approximation () structure.
Definition 9
([34,35]). If is a structure, , then the set family is called the minimal description of such that .
Definition 10
([36]). If U is a non-null set, R is an equivalence relation on U and A is an in U with the membership function and non-membership function , then and the s and , respectively, of the A are of the quotient set with:
(i) Membership function is defined as
,
(ii) Non-membership function is defined by
,
The rough of A is given by the pair .
Example 1.
Let A be an , and IF relation R as in Table 1.
Table 1.
IF relation R.
Definition 11
([37]). If is a structure, , then
is called the discernible neighborhood of and is denoted as a friend of .
is called the neighborhood of and defined as . We eliminate the lowercase C when there is no confusion.
3. Covering Rough of the First Type
Definition 12.
If is a structure, , then is called covering rough intuitionistic of . Where,
and is called covering rough intuitionistic of . Where,
We call this model type-I covering rough .
Example 2.
Consider , , and . As such, we compute the and of based on the model we presented in Definitions 9 and 12.
, , , , . Then
, and
Proposition 1.
If is a approximation structure, then ; the next properties hold:
(1) (2)
(3) (4) Let . Therefore, and
Proof.
From Definition 12, it is clear. □
4. Covering Rough of the Second Type
Definition 13.
Let U be non-empty and C be a covering of U. For , covering rough membership and the non-membership degrees of depending on the neighborhood of are described as: , .
The covering rough of is described as
We define the covering rough of in terms of
Since , ,
and .
The following example is an illustrative example.
Example 3.
Consider is a structure, ,
and , such that , .
Accordingly, we compute the and of based on the model presented in Definitions 9 and 13
, , , , .Then,, , , , , and , , , , . From Definition 13, we have , ,
, , , , , = , and , , , , , , , . We have , , . Likewise, from Definition 13, we can obtain , .
Proposition 2.
If is a structure. The set family operators , and , , then satisfy the next properties:
(1) (2)
(3) (4) Let . Thus, and
Proof.
(1) If we take , then the membership degree =1 and the non-membership degree=0 for each . Then, , , so from Definition 13, . By Definition 13 and , hence .
(2) Similar to (1).
(3) From Definition 13 , is , or and or . Then, there are four cases:
(i) , (ii) ,
(iii) , (iv) , □
Proof.
(i) If , , then , , , . Therefor, , . □
Proof.
(ii) If , . Then, , , , . Therefore, , and . □
The proofs (iii) and (iv) are the same, hence .
(4) If , , then , , , . Therefore, there exist four types of relationships for the membership and non-membership degrees of the and s.
(i) If , and ,
(ii) If , and ,
(iii) If , and ,
(iv) If , and ,
For the proof of (i) there are four cases:
Case 1: Let , and , .
Then, , , and , .
Case 2: If , and , .
Since , , then , , hence , , and , .
Case 3: Let , , and , . Then , , and , . Since , , hence , . Then , , , .
Case 4: Let , , and , . Then , , and , . The proofs of (i), (iii) and (iv) are the same. Then, and .
5. Multi-Granulation Covering Rough of the Third Type
In this part, we introduce a novel technique for multi-granulation covering rough , in short MGCRIFSs.
Definition 14.
Let be a structure, be a family of coverings of U and be a covering of U, , . The neighborhood is .
Definition 15.
Let be a structure, be a family of coverings of U and be a covering of U, , . Then, multi-granulation covering rough membership and non-membership degrees of depending on the neighborhood of are defined, respectively, as
,
The is , where ,
, and the is , where , .
The following example is an illustrative example of the above definition.
Example 4.
Let be a structure, , , , , ,
. The is: ,
, . We can calculate the and s of X. Using Definitions 14 and 15
, , , , , , , .
We can calculate the membership degrees as follows
, , , , , , , .
Additionally, calculate the non-membership degrees as follows:
, , , , , , , ,.
The is
, .
Additionally, the is
, .
Proposition 3.
Assume that is a structure. The next properties are satisfied:
(1) (2)
(3) (4) If , then ,
Proof.
(1) Suppose that U is . Then, , , by Definition 15, , . Then , . Therefore, .
(2) Similar to (1)
(3) From Definition 15, or , and or . Therefore, there are four cases.
(i) , (ii) ,
(iii) , (iv) ,
We prove (i) and (ii)
(i) Let , . Then, , , , , hence , and .
(ii) Let , . Then, , , , , hence , and , from (i) and (ii), we obtain .
(4) The proof is similar to (3). □
6. Conclusions
Covering-based rough set theory was combined with in dealing with uncertainty and decision making process. We approximated IFS on the covering rough set space via the neighborhood of each element of the universe. Three models of the approximation of IFS are introduced by the neighborhood concept. Some examples were used to prove and explain the properties of these approximation structures. We think these models will be useful in the decision-making process. In the future, we will use the concept of the core of the neighborhood of the element in generating a new covering rough approximation structure. In the future, we will using the IFS in new different applications (DNA mutation–repair mutation).
Author Contributions
Conceptualization, R.M., I.N., R.A.-G. and M.B.; data curation, R.M., I.N., R.A.-G. and M.B.; formal analysis, R.M., I.N., R.A.-G. and M.B.; software, R.A.-G.; supervision, I.N.; validation, R.M. and M.B.; visualization, R.M., I.N., R.A.-G. and M.B.; writing—review and editing, R.M., I.N., R.A.-G. and M.B.; investigation, R.M., I.N., R.A.-G. and M.B.; methodology, R.M., I.N., R.A.-G. and M.B. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
- Yao, Y. Probabilistic rough set approximations. Int. J. Approx. Reason. 2005, 49, 255–271. [Google Scholar] [CrossRef]
- Hu, Q.; Yu, D.; Xie, Z.; Liu, J. Fuzzy probabilistic approximation spaces and their information measures. IEEE Trans. Fuzzy Syst. 2006, 14, 191–201. [Google Scholar]
- Skowron, A.; Stepaniuk, J. Tolerance approximation spaces. Fundam. Inf. 1996, 27, 245–253. [Google Scholar] [CrossRef]
- Slowinski, R.; Vanderpooten, D. A generalized definition of rough approximations based on similarity. IEEE Trans. Knowl. Data Eng. 2000, 12, 331–336. [Google Scholar] [CrossRef]
- Yao, Y.; Zhao, Y. Attribute reduction in decision-theoretic rough set models. Inf. Sci. 2008, 178, 3356–3373. [Google Scholar] [CrossRef]
- Yao, Y.; Yao, B. Covering based rough set approximations. Inf. Sci. 2012, 200, 91–107. [Google Scholar] [CrossRef]
- Al-shami, T.M.; Ciucci, D. Subset neighborhood rough sets. Knowl.-Based Syst. 2022, 237. [Google Scholar] [CrossRef]
- Hu, Q.; Yu, D.; Liu, J.; Wu, C. Neighborhood rough set based heterogeneous feature subset selection. Inf. Sci. 2008, 178, 3577–3594. [Google Scholar] [CrossRef]
- Yong, L.; Wenliang, H.; Yunliang, J.; Zhiyong, Z. Quick attribute reduct algorithm for neighborhood rough set model. Inf. Sci. 2014, 271, 65–81. [Google Scholar] [CrossRef]
- Zhang, H.; Shu, L.; Liao, S. Intuitionistic fuzzy soft rough set and its application in decision making. In Abstract and Applied Analysis; Hindawi: London, UK, 2014; Volume 2014. [Google Scholar]
- Al-shami, T.M. An improvement of rough sets’ accuracy measure using containment neighborhoods with a medical application. Inf. Sci. 2021, 569, 110–124. [Google Scholar] [CrossRef]
- Zhan-Ao, X.; Xiao-Meng, S.; Tian-Yu, X.; Xian-Wei, X.; Yi-lin, Y. Multi-granulation covering rough intuitionistic fuzzy sets. J. Intell. Fuzzy Syst. 2017, 32, 899–911. [Google Scholar] [CrossRef]
- Goguen, J.A. L-fuzzy sets. J. Math. Anal. Appl. 1967, 18, 145–174. [Google Scholar] [CrossRef]
- Buehrer, D.J.; Gau, W.L. Vague sets. IEEE Trans. Syst. Cybernet 1993, 23, 610–614. [Google Scholar]
- Nada, S.M.S. Fuzzy rough sets. Fuzzy Sets Syst. 1999, 45, 157–160. [Google Scholar] [CrossRef]
- Zadeh, L. Fuzzy sets. Inf. Control 1965, 11, 338–353. [Google Scholar] [CrossRef]
- Atanassov, K. Intuitionistic fuzzy sets. Int. J. Bioautomation 2016, 20, 1. [Google Scholar]
- Bustince, H.; Burill, P. Vague sets are intuitionistic fuzzy Sets. Fuzzy Sets Syst. 1996, 79, 403–405. [Google Scholar] [CrossRef]
- Biswas, R. Fyzzy sets intuitionistic fuzzy Sets. NIFS 1997, 3, 3–11. [Google Scholar]
- Dutta, P.; Goala, S. Fuzzy decision making in medical diagnosis using an advanced distance measure on intuitionistic fuzzy sets. Open Cybern. Syst. J. 2018, 12, 136–149. [Google Scholar] [CrossRef]
- Atanassov, K. Intuitionistic Fuzzy Modal Topological Structure. Mathematics 2022, 10, 3313. [Google Scholar] [CrossRef]
- Gohain, B.; Chutia, R.; Dutta, A.P. Distance measure on intuitionistic fuzzy sets and its application in decision-making, pattern recognition, and clustering problems. Int. J. Intell. Syst. 2022, 37, 2458–2501. [Google Scholar] [CrossRef]
- Muthukumar, P.; Gangadharan, S.S.K. Ordered Intuitionistic Fuzzy soft sets and its application in decision making problem. Int. J. Fuzzy Syst. Appl. 2018, 7, 76–97. [Google Scholar] [CrossRef]
- Abu-Gdairi, R.; Noaman, I. Generating Fuzzy Sets and Fuzzy Relations based on Information. Wseas Trans. Math. 2021, 20, 178–185. [Google Scholar] [CrossRef]
- Dubois, D.; Prade, H. Rough fuzzy sets and fuzzy rough sets. Int. J. Gen. Syst. 1990, 17, 191–208. [Google Scholar] [CrossRef]
- Sun, W.M.B.; Liu, Q. An approach to decision making depending on intuitionistic fuzzy rough sets over two universes. J. Oper. Res. Soc. 2013, 64, 1079–1089. [Google Scholar] [CrossRef]
- Tang, K.S.J.G.; Zhu, W. A new type of covering-based rough fuzzy set model. Control. Decis. 2012, 27, 1652–1662. [Google Scholar]
- Hu, G.Y.W.J.; Zhang, Q.H. Covering based generalized rough fuzzy set model. J. Softw. 2010, 21, 968–977. [Google Scholar] [CrossRef]
- Sun, J.; Wang, Y.P.; Chen, M.W. Interval-valued intuitionistic fuzzy rough sets depending on coverings. Comput. Eng. Appl. 2013, 49, 155–156. [Google Scholar]
- Wei, F.F.X.L.; Miao, D.Q.; Xia, F.C. Research on a covering rough fuzzy set model. J. Comput. Dev. 2006, 43, 1719–1723. [Google Scholar] [CrossRef]
- Zhang, Z.; Bai, Y.; Tian, J. Intuitionistic fuzzy rough sets depending on intuitionistic fuzzy coverings. Control. Decis. 2010, 25, 1369–1373. [Google Scholar]
- Liang, J.Y.; Qian, Y.H.; Wei, W. Pessimistic rough decision. Second. Int. Rough Sets Theory 2010, 25, 440–449. [Google Scholar]
- Zhu, W.; Wang, F.Y. Reduction and axiomization of covering generalized rough sets. Inf. Sci. 2003, 15, 217–230. [Google Scholar] [CrossRef]
- Bryniarski, E.Z.; Bonikowski, U. Wybraniec-Skardowska. Extensions and intentions in the rough set theory. Inf. Sci. 1998, 107, 149–167. [Google Scholar]
- Rizvi, S.; Naqvi, H.J.; Nadeem, D. Rough Intuitionistic Fuzzy Sets. JCIS 2002, 6, 101–104. [Google Scholar]
- Zhu, W.; Wang, F.Y. On Three Types of Covering-Based Rough Sets. IEEE Trans. Knowl. Data Eng. 2007, 19, 1131–1144. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).