Next Article in Journal
Study on Error Separation of Three-Probe Method
Previous Article in Journal
Analytical Solutions of Nonlocal Thermoelastic Interaction on Semi-Infinite Mediums Induced by Ramp-Type Heating
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Topological Data Analysis with Cubic Hesitant Fuzzy TOPSIS Approach

1
Department of Mathematics, University of the Punjab, Lahore 54590, Pakistan
2
Department of Mathematics, College of Sciences, King Khalid University, Abha 61413, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(5), 865; https://doi.org/10.3390/sym14050865
Submission received: 21 March 2022 / Revised: 8 April 2022 / Accepted: 15 April 2022 / Published: 22 April 2022
(This article belongs to the Topic Multi-Criteria Decision Making)

Abstract

:
A hesitant fuzzy set (HFS) and a cubic set (CS) are two independent approaches to deal with hesitancy and vagueness simultaneously. An HFS assigns an essential hesitant grade to each object in the universe, whereas a CS deals with uncertain information in terms of fuzzy sets as well as interval-valued fuzzy sets. A cubic hesitant fuzzy set (CHFS) is a new computational intelligence approach that combines CS and HFS. The primary objective of this paper is to define topological structure of CHFSs under P(R)-order as well as to develop a new topological data analysis technique. For these objectives, we propose the concept of “cubic hesitant fuzzy topology (CHF topology)”, which is based on CHFSs with both P(R)-order. The idea of CHF points gives rise to the study of several properties of CHF topology, such as CHF closure, CHF exterior, CHF interior, CHF frontier, etc. We also define the notion of CHF subspace and CHF base in CHF topology and related results. We proposed two algorithms for extended cubic hesitant fuzzy TOPSIS and CHF topology method, respectively. The symmetry of optimal decision is analyzed by computations with both algorithms. A numerical analysis is illustrated to discuss similar medical diagnoses. We also discuss a case study of heart failure diagnosis based on CHF information and the modified TOPSIS approach.

1. Preliminaries

Topological data analysis (TDA) methods are rapidly growing approaches to infer persistent key features for possibly complex data [1]. Machine learning techniques have several limitations due to repetition in data collection. TDA presents a classifier for such problems during sampling from the data space and defines a data topology based on network graph [2]. TDA can be used independently or in combination with other data analysis and statistical learning techniques. Topological approaches have been used in contemporary data science to examine the structural characteristics of big data, leading to further information analysis. Researchers have developed a lot of TDA methods for information aggregation. However, the classical methods cannot deal with vague and uncertain information. To address these issues, Zadeh [3] established the notion of “fuzzy set (FS) theory” as an extension of classical set theory. In fact, this an extension of characteristic functions, with codomain { 0 , 1 } towards membership function (MF) having codomain [ 0 , 1 ] . The idea of MF in FS theory is a robust innovation for computational intelligence and many other fields. An FS model characterized by a membership function assigns a membership grade under a specific criterion to each object in { 0 , 1 } . Atanassov [4] highlighted the significance of non-membership function (NMF) in addition to MF of FS theory and proposed “intuitionistic fuzzy set (IFS) theory” to describe the positive and negative aspects of an object under a specific criteria. Pythagorean fuzzy set (PFS) is an extension of IFS [5,6,7], and q-rung orthopair fuzzy set (q-ROFS) is an extension of PFS [8]. Molodtsov [9] proposed “soft set (SS) theory” to study uncertainty in complex problems by means of parameterizations. Neutrosophic sets [10], spherical fuzzy sets [11,12] and picture fuzzy sets [13] have been successfully applied to numerous problems of computational intelligence and decision-making problems.
Jun et al. [14] proposed the perspective of “cubic sets (CSs) theory” that includes several novel concepts such as internal CSs, external CSs, P(R)-union and P(R)-intersection, etc. Torra [15] suggested the concept of “hesitant fuzzy sets” (HFSs) as a generalization of fuzzy sets to better describe this circumstance, which allows a collection of possible values in the closed interval [0,1] to be aided by the membership degree. HFSs were used to manage scenarios in which experts had to choose between diverse feasible membership values in order to evaluate an alternative. HFS theory has various applications in different fields such as decision support systems, clustering and pattern recognition as well as various features of algebraic structures and topological structures. Some rudimentary concepts of hesitant fuzzy sets are given in Table 1.
Chang [21] laid the foundation of “fuzzy topology”, which is defined on a collection of fuzzy sets. Coker [22] proposed “intuitionistic fuzzy topology” which is defined on the collection of IFSs, and Olgun et al. [23] defined "Pythagorean fuzzy topology" on PFSs. The conceptualization of fuzzy soft topology [24] suggested modified topological structures. Lee and Hur [25] introduced “hesitant fuzzy topology” based on HFSs and defined the notions of HF product space and HF continuous mapping. Abdullah et al. [26] proposed the concept of “cubic topology” on cubic sets. Sreedevi and Shankar [27] introduced “hesitant fuzzy soft topological spaces” and numerous topological properties, such as HF soft normal space, HF soft Hausdorff space, HF soft regular space, HF soft basis and first and second countable HF soft spaces. Riaz and Tehrim [28] described the concept of “bipolar fuzzy soft topology”.
Some applications of HFS and hybrid extensions of HFS are given in Table 2.
“Multi-criteria decision making” (MCDM) is a sub-discipline of operations research that looks at how to make optimal decisions based on multiple competing criteria. MCDM is a multistage decision-making approach that ranks alternatives as well as selects a best possible alternative from a given set of feasible alternatives under several criteria. “TOPSIS” is a highly effective method for MCDM that is based on the premise of attempting to traverse the potentially best decision from the available options that is at a scaled-down distance from the “positive ideal solution” (PIS) and far from the “negative ideal solution” (NIS). TOPSIS has been studied and adopted for solving several real-life problems, as mentioned in Table 3.
Riaz and Hashmi [64] proposed a new extension of fuzzy sets, named linear Diophantine fuzzy set, which relax the strict constraints of existing fuzzy sets with the help of reference parameters. Kamaci [65] initiated the notion of linear Diophantine fuzzy algebraic structures and their application in coding theory. Kamaci [66] introduced the concept of complex linear Diophantine fuzzy sets, operational laws on complex linear Diophantine fuzzy sets and their application based on cosine similarity measures. Sreedevi and Shankar [67] proposed topological structure on HFS and defined the notion of HFS-topology. Akram et al. [68] suggested a new mathematical model for group decision making with hesitant N-soft sets with application to expert systems. Mahmood et al. [69] initiated a new MCDM based on CHFSs and Einstein operational laws. Garg and Kaur [70] proposed an extended TOPSIS approach and nonlinear-programming for MCDM using cubic IFS information. Kamaci et al. [71] proposed dynamic aggregation operators and Einstein operations by using interval-valued, picture-hesitant fuzzy information and their application in multi-period decision making.
Topological structures with fuzzy models (see [72,73,74]) develop more effective and flexible approaches to seek solutions to various problems of artificial intelligence, engineering and information analysis (see [75,76,77]). A cubic hesitant fuzzy set (CHFS) is a hybrid of a hesitant fuzzy set (HFS) and a cubic set (CS). A CHFS is a new fuzzy model for data analysis, computational intelligence, neural computing, soft computing and other processes. The idea of cubic hesitant fuzzy topology defined on CHFS can be utilized to seek solutions of various problems of information analysis, information fusion, big data and decision analysis.
The main objectives of this study are: (1) to introduce the idea of P-cubic hesitant fuzzy topology with simultaneous P-order and R-cubic hesitant fuzzy topology with R-order; (2) to define certain properties of CHF topology under P(R)-order and their related results; (3) to develop an algorithm for the extension of MCDM methods based on CHF topology; (4) to demonstrate an application of proposed methodology towards medical diagnosis; and (5) to discuss the advantages, flexibility and validity of the proposed methodology.
The remainder of the paper is designed as follows. In Section 2, we discuss some fundamental notions, including, HFS, CS, CHFS and operations of CHFSs under P(R)-order. In Section 3, we study “P-cubic hesitant fuzzy topology” (P-CHF topology), P-CHF subspace, P-CHF closure, P-CHF interior, P-CHF exterior, P-CHF frontier and P-CHF dense set. In Section 4, we define “R-cubic hesitant fuzzy topology" (R-CHF topology), R-CHF subspace, R-CHF closure, R-CHF interior, R-CHF exterior, R-CHF frontier and R-CHF dense set. In Section 5, Algorithms 1 and 2 are proposed for an extended cubic hesitant fuzzy TOPSIS method and topological data analysis, respectively. An application of the proposed methods for medical diagnosis is also given in Section 5. The conclusion and future directions are summarized at the end of manuscript.
In this section, we review the notions of cubic set (CS) [14], hesitant fuzzy set (HFS) [15,16], interval-valued hesitant fuzzy set (IVHFS) [17] and cubic hesitant fuzzy set (CHFS) [39].
Definition 1
([14]). A CS in set V is defined by
C = ξ , I ( ξ ) , σ ( ξ ) | ξ V
where I ( ξ ) is an “interval-valued fuzzy set (IVFS)” in V and σ ( ξ ) is a “fuzzy set (FS)” in V . A CS can be expressed as C = I , σ .
Example 1.
Let V = { ξ 1 , ξ 2 , ξ 3 , ξ 4 } be a universal set. Then a CS is given by C = { ξ 1 , { [ 0.235 , 0.476 ] , 0.667 } , ξ 2 , { [ 0.133 , 0.345 ] , 0.198 } , ξ 3 , { [ 0.421 , 0.782 ] , 0.385 } , ξ 4 , { [ 0.347 , 0.847 ] , 0.667 } } .
Definition 2
([15]). Let V be a set. An HFS ℏ is defined by a mapping : V [ 0 , 1 ] in the sense when ℏ applied to V , yields a finite subset of [ 0 , 1 ] . An HFS set can be expressed as
= { ζ , ˇ ( ζ ) | ζ V }
where ˇ ( ζ ) denotes a HF element or is a set of some various values in [ 0 , 1 ] indicating the feasible membership degrees of element ζ V to the set ℏ.
Example 2.
Let V = { ζ 1 , ζ 2 , ζ 3 , ζ 4 , ζ 5 } be a set. Then an HFS is given by = { ζ 1 , { 0.645 , 0.125 , 0.667 } , ζ 2 , { 0.133 , 0.345 , 0.988 , 0.259 } , ζ 3 , { 0.511 , 0.178 } , ζ 4 , { 0.481 , 0.872 } , ζ 5 , { 0.666 , 0.879 } } , where, ( ζ 1 ) , ( ζ 2 ) , ( ζ 3 ) , ( ζ 4 ) and ( ζ 5 ) are HF-elements corresponding to ζ 1 , ζ 2 , ζ 3 , ζ 4 and ζ 5 respectively.
Definition 3
([39]). Let V be a universe of discourse. A CHFS is defined as
H ^ = { κ θ , I ( κ θ ) , ˇ ( κ θ ) | κ θ V }
where I ( κ θ ) = [ I ( κ θ ) , I + ( κ θ ) ] represents an “interval-valued hesitant fuzzy element (IVHF element)” and ˇ ( κ θ ) is a "hesitant fuzzy element (HF element)". A CHFS can be expressed as H ^ = I , ˇ , where I = [ I , I + ] is an IVHF element and ˇ is an HF element.
Example 3.
Let V = { κ 1 θ , κ 2 θ , κ 3 θ } be a universe of discourse. Then a CHFS can be expressed as H ^ = { κ 1 θ , { [ 0.376 , 0.476 ] } , { 0.400 } , κ 2 θ , { [ 0.373 , 0.531 ] , [ 0.654 , 0.732 ] , [ 0.563 , 0.987 ] } , { 0.398 , 0.532 , 0.778 } , κ 3 θ , { [ 0.421 , 0.782 ] , [ 0.321 , 0.578 ] } , { 0.385 , 0.486 } } .
Definition 4
([39]). Let H ^ = I , ˇ be a CHFS. Then H ^ is called an internal cubic hesitant fuzzy set (ICHFS) if ˇ is contained in I = [ I , I + ] . In other words, each h i is contained in [ μ i , μ i + ] , where h i ˇ and [ μ i , μ i + ] I (for all i Ω ).
Example 4.
Let V = { κ 1 θ , κ 2 θ , κ 3 θ } be a reference set. Then the ICHFS may be expressed as H ^ = { κ 1 θ , { [ 0.376 , 0.476 ] } , { 0.400 } , κ 2 θ , { [ 0.373 , 0.531 ] , [ 0.654 , 0.732 ] , [ 0.563 , 0.987 ] } , { 0.398 , 0.732 , 0.778 } , κ 3 θ , { [ 0.421 , 0.782 ] , [ 0.321 , 0.578 ] } , { 0.485 , 0.576 } } .
Definition 5
([39]). Let H ^ = I , ˇ be a CHFS. Then H ^ is called an internal cubic hesitant fuzzy set (ICHFS) if ˇ is not contained in I = [ I , I + ] . In other words, each h i is not contained in [ μ i , μ i + ] , where h i ˇ and [ μ i , μ i + ] I (for all i Ω ).
Example 5.
Let V = { κ 1 θ , κ 2 θ , κ 3 θ } be a reference set. Then the ECHFS may be expressed as H ^ = { κ 1 θ , { [ 0.376 , 0.476 ] } , { 0.500 } , κ 2 θ , { [ 0.373 , 0.531 ] , [ 0.654 , 0.732 ] , [ 0.563 , 0.987 ] } , { 0.355 , 0.532 , 0.498 } , κ 3 θ , { [ 0.421 , 0.782 ] , [ 0.321 , 0.578 ] } , { 0.420 , 0.686 } } .
Definition 6
([39]). Let H ^ = I , ˇ be a CHFS. A cubic hesitant fuzzy element (CHFE) c ˇ in set V is defined as
c ˇ = { [ μ i , μ i + ] } , { γ i } | μ i = [ μ i , μ i + ] I ( κ θ ) , γ i ˇ ( κ θ )
where I ( κ θ ) represents an IVHFE and ˇ ( κ θ ) represents HFE.
Definition 7
([39]). Let
c ˇ = { [ μ i , μ i + ] } , { γ i } | μ i = [ μ i , μ i + ] I ( κ θ ) , γ i ˇ ( κ θ )
be a CHFE in set V . Then the score function of c ˇ is defined as
s ( c ˇ ) = 1 n μ i + μ i + + γ i n 2
where [ μ i , μ i + ] I ( κ θ ) , γ i ˇ ( κ θ ) κ θ V and n corresponds to the number of elements in c ˇ .
Remark 1.
A CHFS H ^ = I , ˇ in which I ( κ θ ) = 0 and ˇ ( κ θ ) = 0 κ θ V is denoted by 0 V .
A CHFS H ^ = I , ˇ in which I ( κ θ ) = 1 and ˇ ( κ θ ) = 1 κ θ V is denoted by 1 V .
A CHFS H ^ = I , ˇ in which I ( κ θ ) = 0 and ˇ ( κ θ ) = 1 κ θ V is denoted by 0 ¯ V .
A CHFS H ^ = I , ˇ in which I ( κ θ ) = 1 and ˇ ( κ θ ) = 0 κ θ V is denoted by 1 ¯ V .
Remark 2.
Some important observations are listed as follows.
(i) 
P-union of any two ICHFSs is an ICHFS.
(ii) 
P-intersection of any two ICHFSs is an ICHFS.
(iii) 
P-union of any two ECHFSs need not be an ICHFS.
(iv) 
P-intersection of any two ECHFSs need not be an ICHFS.
(v) 
P-union of any two ECHFSs need not be an ECHFS.
(vi) 
P-intersection of any two ECHFSs need not be an ECHFS.
(vii) 
R-union of any two ICHFSs need not be an ICHFS.
(viii) 
R-intersection of any two ICHFSs need not be an ICHFS.
(ix) 
R-intersection of any two ECHFSs need not be an ICHFS.

1.1. Operations for Cubic Hesitant Fuzzy Sets under P-Order

Definition 8
([39]). Let H ^ 1 = I 1 , 1 ˇ and H ^ 2 = I 2 , ˇ 2 be two CHFSs on V , then H ^ 1 is called a PCHF subset of H ^ 2 written as H ^ 1 P H ^ 2 if
1.
φ i ( κ θ ) ψ i ( κ θ ) i Ω and κ θ V (where Ω is an index), φ i ( κ θ ) = [ φ i ( κ θ ) , φ i + ( κ θ ) ] I 1 ( κ θ ) , ψ i ( κ θ ) = [ ψ i ( κ θ ) , ψ i + ( κ θ ) ] I 2 ( κ θ ) are the membership grade intervals of the element κ θ V .
2.
1 ˇ ( κ θ ) 2 ˇ ( κ θ ) .
Definition 9
([39]). Let H ^ 1 = I 1 , 1 ˇ and H ^ 2 = I 2 , ˇ 2 be two CHFSs on V , then P-union of H ^ 1 and H ^ 2 is defined as
H ^ 1 P H ^ 2 = { κ θ , ς I 1 ( κ θ ) I 2 ( κ θ ) , γ 1 ˇ ( κ θ ) 2 ˇ ( κ θ ) | ς = [ ς , ς + ] max { [ φ i ( κ θ ) , φ i + ( κ θ ) ] , [ ψ i ( κ θ ) , ψ i + ( κ θ ) ] } , γ max { 1 ˇ ( κ θ ) , 2 ˇ ( κ θ ) } }
where [ φ i ( κ θ ) , φ i + ( κ θ ) ] = [ min { φ i ( κ θ ) } , min { φ i + ( κ θ ) } ] , and [ ψ i ( κ θ ) , ψ i + ( κ θ ) ] = [ min { ψ i ( κ θ ) } , min { ψ i ( κ θ ) } ] .
Definition 10
([39]). Let H ^ 1 = I 1 , 1 ˇ and H ^ 2 = I 2 , ˇ 2 be two CHFSs on V , then P-intersection of H ^ 1 and H ^ 2 is defined as
H ^ 1 P H ^ 2 = { κ θ , ς I 1 ( κ θ ) I 2 ( κ θ ) , γ 1 ˇ ( κ θ ) 2 ˇ ( κ θ ) | ς = [ ς , ς + ] min { [ φ i ( κ θ ) , φ i + ( κ θ ) ] + , [ ψ i ( κ θ ) , ψ i + ( κ θ ) ] + } , γ min { 1 ˇ + ( κ θ ) , 2 ˇ + ( κ θ ) } }
where [ φ i ( κ θ ) , φ i + ( κ θ ) ] + = [ max { φ i ( κ θ ) } , max { φ i + ( κ θ ) } ] , and [ ψ i ( κ θ ) , ψ i + ( κ θ ) ] + = [ max { ψ i ( κ θ ) } , max { ψ i ( κ θ ) } ] .

1.2. Operations for Cubic Hesitant Fuzzy Sets under R-Order

Definition 11
([39]). Let H ^ 1 = I 1 , 1 ˇ and H ^ 2 = I 2 , ˇ 2 be two CHFSs on V , then H ^ 1 is called an RCHF subset of H ^ 2 written as H ^ 1 R H ^ 2 if
1.
φ i ( κ θ ) ψ i ( κ θ ) i Ω and κ θ V (where Ω is an index), φ i ( κ θ ) = [ φ i ( κ θ ) , φ i + ( κ θ ) ] I 1 ( κ θ ) , ψ i ( κ θ ) = [ ψ i ( κ θ ) , ψ i + ( κ θ ) ] I 2 ( κ θ ) are the membership grade intervals of the element κ θ V .
2.
1 ˇ ( κ θ ) 2 ˇ ( κ θ ) .
Definition 12
([39]). Let H ^ 1 = I 1 , 1 ˇ and H ^ 2 = I 2 , ˇ 2 be two CHFSs on V , then R-union of H ^ 1 and H ^ 2 is defined as H ^ 1 R H ^ 2 = { κ θ , ς I 1 ( κ θ ) I 2 ( κ θ ) , γ 1 ˇ ( κ θ ) 2 ˇ ( κ θ ) |   ς = [ ς , ς + ] max { [ φ i ( κ θ ) , φ i + ( κ θ ) ] , [ ψ i ( κ θ ) , ψ i + ( κ θ ) ] } , γ min { 1 ˇ + ( κ θ ) , 2 ˇ + ( κ θ ) } }
Definition 13
([39]). Let H ^ 1 = I 1 , 1 ˇ and H ^ 2 = I 2 , ˇ 2 be two CHFSs on V , then R-intersection of H ^ 1 and H ^ 2 is defined as
H ^ 1 R H ^ 2 = { κ θ , ς I 1 ( κ θ ) I 2 ( κ θ ) , γ 1 ˇ ( κ θ ) 2 ˇ ( κ θ ) |
ς = [ ς , ς + ] min { [ φ i ( κ θ ) , φ i + ( κ θ ) ] + , [ ψ i ( κ θ ) , ψ i + ( κ θ ) ] + } , γ max { 1 ˇ ( κ θ ) , 2 ˇ ( κ θ ) } } .
Some other operations for CHFSs are given below.
Definition 14
([39]). Let V be a reference set, H ^ = { κ θ , I ( κ θ ) , ˇ ( κ θ ) | κ θ V } be a CHFS on V and λ > 0 , then
1.
λ H ^ = κ θ , λ ς = λ [ ς , ς + ] ( λ I ) ( κ θ ) , λ γ ( λ ˇ ) ( κ θ ) | { [ 1 ( 1 μ i ) λ , 1 ( 1 μ i + ) λ ] } , { h i λ }
2.
H ^ λ = κ θ , ς λ = [ ς , ς + ] λ ( I ) λ ( κ θ ) , γ λ ( ˇ ) λ ( κ θ ) | { [ ( μ i ) λ , ( μ i + ) λ ] } , { h i λ }
Definition 15
([39]). Let H ^ 1 = I 1 , 1 ˇ be a CHFS, then complement of H ^ 1 is defined as
H ^ 1 c = κ θ , [ 1 I + ( κ θ ) , 1 I ( κ θ ) ] , 1 ˇ ( κ θ ) | κ θ V
Remark 3.
Law of Contradiction H ^ P H ^ c = 0 V and Law of Excluded Middle H ^ P H ^ c = 1 V do not hold in PCHFSs. Similarly these laws do not hold in RCHFSs.

2. P-Cubic Hesitant Fuzzy Topology

Definition 16.
Let V be a set (universe of discourse). Then the collection T containing CHFSs is called cubic hesitant fuzzy topology under P-order or PCHF topology if it satisfies following properties:
1.
0 V , 1 V T .
2.
( P H ^ i ) i Λ T , for each ( H i ^ ) i Λ T .
3.
H ^ 1 P H ^ 2 T , for any H ^ 1 , H ^ 2 T .
Then ( V , T ) is called a PCHF topological space.
Example 6.
Let V = { κ 1 θ , κ 2 θ , κ 3 θ } be a set.
H ^ 1 = { κ 1 θ , { [ 0.35 , 0.74 ] } , { 0.45 } , κ 2 θ , { [ 0.48 , 0.85 ] , [ 0.51 , 0.72 ] } , { 0.35 , 0.47 } , κ 3 θ , { [ 0.25 , 0.54 ] , [ 0.63 , 0.95 ] } , { 0.50 , 0.35 } } H ^ 2 = { κ 1 θ , { [ 0.45 , 0.80 ] } , { 0.56 } , κ 2 θ , { [ 0.50 , 0.95 ] , [ 0.62 , 0.80 ] } , { 0.40 , 0.93 } , κ 3 θ , { [ 0.30 , 0.65 ] , [ 0.65 , 0.97 ] } , { 0.60 , 0.75 } }
be two CHFSs in V . Table 4 and Table 5 show the P-union and P-intersection, respectively, of the CHFSs H ^ 1 and H ^ 2 .
We see that T 1 = 0 V , 1 V , T 2 = 0 V , H ^ 1 , 1 V , T 3 = 0 V , H ^ 2 , 1 V , and T 4 = 0 V , H ^ 1 , H ^ 2 , 1 V are PCHF topologies on V , where
0 V = { κ 1 θ , { [ 0.00 , 0.00 ] } , { 0.00 } , κ 2 θ , { [ 0.00 , 0.00 ] , [ 0.00 , 0.00 ] } , { 0.00 , 0.00 } , κ 3 θ , { [ 0.00 , 0.00 ] , [ 0.00 , 0.00 ] } , { 0.00 , 0.00 } } is null CHFS of V .
1 V = { κ 1 θ , { [ 1.00 , 1.00 ] } , { 1.00 } , κ 2 θ , { [ 1.00 , 1.00 ] , [ 1.00 , 1.00 ] } , { 1.00 , 1.00 } , κ 3 θ , { [ 1.00 , 1.00 ] , [ 1.00 , 1.00 ] } , { 1.00 , 1.00 } } is absolute CHFS of V .
Definition 17.
If ( V , T ) is a PCHF topological space in V , the members of ( V , T ) are PCHF open sets in V .
Definition 18.
Let ( V , T ) be a PCHF topological space in V . If the complement of a CHFS is PCHF open, a CHFS in V is said to be a PCHF closed set in V .
Theorem 1.
Let ( V , T ) be a PCHF topological space. Then
(a) 
0 V , 1 V are PCHF closed sets in V .
(b) 
( P H ^ α ) α Ω is a PCHF closed in V , where each H α ^ is a PCHF closed set.
(c) 
( P H ^ i ) is a PCHF closed in V , for any PCHF closed sets H ^ 1 and H ^ 2 .
Proof. 
(a)
Since ( 0 V ) c = 1 V and ( 1 V ) c = 0 V . Both 0 V and 1 V are PCHF closed sets in V .
(b)
Let us assume that { H ^ α : α Ω } be the family of PCHF closed sets. Each H ^ α is PCHF closed set, so each ( H ^ α ) c is in T . Thus, we have ( P H ^ α ) α Ω c T . Therefore, ( P ( H ^ α ) c ) α Ω c = ( P H ^ α ) α Ω is a PCHF closed set.
(c)
Let { H ^ i : 1 i n } be a finite collection of PCHF closed sets. Each H ^ i is a PCHF closed set, so each ( H ^ i ) c is in T . Thus, we have P i = 1 n ( H ^ i ) c T . Therefore, ( P i = 1 n ( H ^ i ) c ) c = P i = 1 n H ^ i is a PCHF closed set.
   □
Definition 19.
Let ( V , T 1 ) and ( V , T 2 ) be two PCHF topological spaces over identical universal set V . If T 1 P T 2 then T 1 is said to be a PCHF coarser or a PCHF weaker than T 2 and T 2 is said to be a PCHF finer or a PCHF stronger than T 1 .
If T 1 P T 2 or T 2 P T 1 then these PCHF topologies are not comparable.
Example 7.
From Example 3.2 , we consider T 2 = { 0 V , H ^ 1 , 1 V } and T 4 = { 0 V , H ^ 1 H ^ 2 , 1 V } are two PCHF topologies on V . It is comprehensible that T 2 P T 4 . Thus, T 2 is a PCHF coarser than T 4 and T 4 is a PCHF finer than T 2 .
Definition 20.
Assume a universal set V , and the assemblage of all CHFSs T is defined in V . Then T is a PCHF discrete topology on V and ( V , T ) is known as a PCHF discrete topological space in V .
Definition 21.
Suppose that V be a universal set and T = { 0 V , 1 V } . Then T is a PCHF indiscrete topology on V , and ( V , T ) is a PCHF indiscrete topological space in V .
Theorem 2.
Let ( V , T 1 ) and ( V , T 2 ) be two PCHF topological spaces over identical universe of discourse V , then ( V , T 1 P T 2 ) is a PCHF topological space in V .
Proof. 
  • 0 V , 1 V T 1 P T 2 .
  • Let us assume that { H ^ α : α Ω } be an arbitrary family of CHFSs in T 1 P T 2 .
    Then H ^ α T 1 and H ^ α T 2 α Ω , so P H ^ α T 1 and P H ^ α T 2 . Thus P H ^ α T 1 P T 2 .
  • Let H ^ 1 , H ^ 2 T 1 P T 2 . Then H ^ 1 , H ^ 2 T 1 and H ^ 1 , H ^ 2 T 2 . So H ^ 1 P H ^ 2 T 1 P T 2 .
    Thus, T 1 P T 2 defines a PCHF topology on V and ( V , T 1 P T 2 ) is a PCHF topological space in V .
Definition 22.
Assume that a PCHF topological space is defined as ( V , T ) and Y is a PCHF subset of V . Let T ¯ consist of those PCHF subsets D ^ of Y for which there exist an H ^ in T such that
D ^ = H ^ P Y ˇ
where Y ˇ may be an absolute CHFS or any CHFS defined on Y . We can easily check that ( Y , T ¯ ) is a PCHF topological space. It is called a PCHF subspace of ( V , T ) , and T ¯ is known as the PCHF subspace or PCHF relative topology on Y .
Example 8.
Consider ( V , T ) to be a PCHF topological space, where V = { κ 1 θ , κ 2 θ , κ 3 θ } and T = { 0 V , H ^ 1 , H ^ 2 , 1 V } . Let Y = { κ 1 θ , κ 2 θ } be a PCHF subset of V such that Y ˇ = { κ 1 θ , { [ 1.00 , 1.00 ] } , { 1.00 } , κ 2 θ , { [ 1.00 , 1.00 ] , [ 1.00 , 1.00 ] } , { 1.00 , 1.00 } } be an absolute CHFS defined on Y . Then
0 V P Y ˇ = 0 V Y
H ^ 1 P Y ˇ = H ^ 1 Y
H ^ 2 P Y ˇ = H ^ 2 Y
1 V P Y ˇ = 1 V Y
where
0 V Y = κ 1 θ , { [ 0.00 , 0.00 ] } , { 0.00 } , κ 2 θ , { [ 0.00 , 0.00 ] , [ 0.00 , 0.00 ] } , { 0.00 , 0.00 }
H ^ 1 Y = κ 1 θ , { [ 0.35 , 0.74 ] } , { 0.45 } , κ 2 θ , { [ 0.48 , 0.85 ] , [ 0.51 , 0.72 ] } , { 0.35 , 0.47 }
H ^ 2 Y = κ 1 θ , { [ 0.45 , 0.80 ] } , { 0.56 } , κ 2 θ , { [ 0.50 , 0.95 ] , [ 0.62 , 0.80 ] } , { 0.40 , 0.93 }
1 V Y = κ 1 θ , { [ 1.00 , 1.00 ] } , { 1.00 } , κ 2 θ , { [ 1.00 , 1.00 ] , [ 1.00 , 1.00 ] } , { 1.00 , 1.00 } = Y ˇ
We can see that T ¯ = 0 V Y , H ^ 1 Y , H ^ 2 Y , 1 V Y is a PCHF subspace or PCHF relative topology on Y , and ( Y , T ¯ ) is a PCHF topological space known as PCHF subspace of ( V , T ) .
Let Y = { κ 1 θ } be a PCHF subset of V such that Y ˇ = κ 1 θ , { [ 0.50 , 0.80 ] } , { 0.60 } be any CHFS defined on Y . Then T ¯ = 0 V Y , H ^ 1 Y , H ^ 2 Y , 1 V Y is a PCHF subspace or PCHF relative topology on Y = { κ 1 θ } , and ( Y , T ¯ ) is a PCHF topological space.
Remark 4.
(i) 
Any PCHF subspace of a PCHF discrete space is PCHF discrete.
(ii) 
Any PCHF subspace of a PCHF indiscrete space is PCHF indiscrete.
(iii) 
A PCHF subspace A ˇ of a PCHF subspace Y ˇ of a PCHF topological space V is a PCHF subspace of V .
Definition 23.
Let us consider a PCHF topological space ( V , T ) . For any CHFS H ^ of V ,
1.
PCHF Closure H ^ ¯ is interpreted as the P-intersection of all PCHF closed super sets of H ^ .
Distinctly, H ^ ¯ is the nominal PCHF closed set that contains H ^ .
2.
PCHF interior ( H ^ ) is interpreted as the P-union of all PCHF open subsets of H ^ . ( H ^ ) is the largest PCHF open set contained in H ^ .
3.
PCHF exterior Ext ( H ^ ) is interpreted as the interior of P-complement of CHFS H ^ .
4.
PCHF frontier Fr ( H ^ ) is interpreted as the P-intersection of H ^ ¯ and ( H ^ ) c ¯
Example 9.
From Example 3.2 , we see that T = { 0 V , H ^ 1 , H ^ 2 , 1 V } is a PCHF topology on V .
The P-complement of CHFSs H ^ 1 and H ^ 2 are given below
( H ^ 1 ) c = { κ 1 θ , { [ 0.26 , 0.65 ] } , { 0.55 } , κ 2 θ , { [ 0.15 , 0.52 ] , [ 0.28 , 0.49 ] } , { 0.65 , 0.53 } , κ 3 θ , { [ 0.46 , 0.75 ] , [ 0.05 , 0.37 ] } , { 0.50 , 0.65 } } ( H ^ 2 ) c = { κ 1 θ , { [ 0.55 , 0.20 ] } , { 0.44 } , κ 2 θ , { [ 0.05 , 0.50 ] , [ 0.20 , 0.38 ] } , { 0.60 , 0.07 } , κ 3 θ , { [ 0.35 , 0.70 ] , [ 0.03 , 0.35 ] } , { 0.40 , 0.25 } } .
Consider
H ^ 3 = { κ 1 θ , { [ 0.20 , 0.58 ] } , { 0.40 } , κ 2 θ , { [ 0.05 , 0.50 ] , [ 0.20 , 0.38 ] } , { 0.60 , 0.07 } , κ 3 θ , { [ 0.39 , 0.75 ] , [ 0.05 , 0.25 ] } , { 0.50 , 0.34 } }
to be a CHFS defined on V = { κ 1 θ , κ 2 θ , κ 3 θ } .
Then,
H ^ 3 ¯ = 1 V P ( H ^ 1 ) c = ( H ^ 1 ) c
( H ^ 3 ) = 0 V
E x t ( H ^ 3 ) = 0 V P H ^ 1 = H ^ 1
F r ( H ^ 3 ) = H ^ 3 ¯ P ( H ^ 3 ) c ¯ = ( H ^ 1 ) c P 1 V = ( H ^ 1 ) c
Theorem 3.
Suppose  V be a universal set, ( V , T ) be a PCHF topological space in V , and H ^ 1 and H ^ 2 are CHFSs in V . Then
1.
0 V ¯ = 0 V and 1 V ¯ = 1 V
2.
H ^ 1 P H ^ 1 ¯
3.
H ^ 1 is a PCHF closed set H ^ 1 = H ^ 1 ¯
4.
H ^ 1 ¯ ¯ = H ^ 1 ¯
5.
H ^ 1 ¯ P H ^ 2 ¯ if H ^ 1 P H ^ 2
6.
H ^ 1 ¯ P H ^ 2 ¯ = H ^ 1 P H ^ 2 ¯
7.
H ^ 1 P H ^ 2 ¯ P H ^ 1 ¯ P H ^ 2 ¯
Proof. 
  • By definition, 0 V P 0 V ¯ . Since 0 V is a PCHF closed superset of itself, so 0 V ¯ P 0 V . Thus, 0 V ¯ = 0 V . Similarly, 1 V ¯ = 1 V .
  • By definition, H ^ 1 P H ^ 1 ¯ because H ^ 1 ¯ is the P-intersection of all PCHF closed supersets of H ^ 1 .
  • Let H ^ 1 be a PCHF closed set in V , then by definition of closure H ^ 1 P H ^ 1 ¯ , as H ^ 1 ¯ P H ^ 1 because H ^ 1 is a PCHF closed superset of itself. Therefore, H ^ 1 = H ^ 1 ¯ .
    Conversely, suppose that H ^ 1 = H ^ 1 ¯ since H ^ 1 ¯ is always a PCHF closed set being the P-intersection of all PCHF closed supersets of H ^ 1 . Therefore, H ^ 1 is a PCHF closed set in V .
  • Since H ^ 1 ¯ is a PCHF closed set, by ( 3 ) we have H ^ 1 ¯ ¯ = H ^ 1 ¯ .
  • Suppose H ^ 1 P H ^ 2 . As H ^ 2 P H ^ 2 ¯ . Therefore, H ^ 1 P H ^ 2 ¯ . It means that H ^ 2 ¯ is a PCHF closed superset of H ^ 1 . Thus H ^ 1 ¯ P H ^ 2 ¯ .
  • As we know that H ^ 1 P H ^ 1 P H ^ 2 and H ^ 2 P H ^ 1 P H ^ 2 , by using part ( 5 ) , H ^ 1 ¯ P H ^ 1 P H ^ 2 ¯ and H ^ 2 ¯ P H ^ 1 P H ^ 2 ¯ .
    H ^ 1 ¯ P H ^ 2 ¯ P H ^ 1 P H ^ 2 ¯ .
    Conversely, suppose that H ^ 1 P H ^ 1 ¯ and H ^ 2 P H ^ 2 ¯ .
    So H ^ 1 P H ^ 2 P H ^ 1 P H ^ 2 ¯
    since H ^ 1 ¯ P H ^ 2 ¯ is s PCHF closed superset of H ^ 1 P H ^ 2 . Therefore, H ^ 1 P H ^ 2 ¯ P H ^ 1 ¯ P H ^ 2 ¯ .
    Thus, H ^ 1 ¯ P H ^ 2 ¯ = H ^ 1 P H ^ 2 ¯ .
  • As H ^ 1 P H ^ 2 P H ^ 1 and H ^ 1 P H ^ 2 P H ^ 2 , then H ^ 1 P H ^ 2 ¯ P H ^ 1 ¯ and H ^ 1 P H ^ 2 ¯ P H ^ 2 ¯ . Thus, H ^ 1 P H ^ 2 ¯ P H ^ 1 ¯ P H ^ 2 ¯ .
   □
Theorem 4.
Let  ( V , T ) be a PCHF topological space in V , and H ^ 1 and H ^ 2 are CHFSs in V . Then
1.
( H ^ 1 ) P H ^ 1
2.
( H ^ 1 ) = ( ( H ^ 1 ) )
3.
H ^ 1 is a PCHF open set ( H ^ 1 ) = H ^ 1
4.
( H ^ 1 ) P ( H ^ 2 ) if H ^ 1 P H ^ 2
5.
( H ^ 1 ) P ( H ^ 2 ) = ( H ^ 1 P H ^ 2 )
6.
( H ^ 1 ) P ( H ^ 2 ) P ( H ^ 1 P H ^ 2 )
Proof. 
  • This is obvious from the definition of PCHF interior.
  • Since ( H ^ 1 ) is a PCHF open set and is also the biggest PCHF open subset of itself, so ( H ^ 1 ) = ( ( H ^ 1 ) ) .
  • If H ^ 1 is a PCHF open subset, then H ^ 1 will be a PCHF interior of itself since it is the biggest PCHF open subset. Conversely, if ( H ^ 1 ) = H ^ 1 , then H ^ 1 is a PCHF open set because ( H ^ 1 ) is PCHF open.
  • Since H ^ 1 P H ^ 2 , from part ( 1 ) ( H ^ 1 ) P H ^ 1 P H ^ 2 . ( H ^ 1 ) is a PCHF open subset of H ^ 2 and so, by definition of ( H ^ 2 ) , we have ( H ^ 1 ) P ( H ^ 2 )
  • From part ( 4 ) ,
    H ^ 1 P H ^ 2 P H ^ 1 and H ^ 1 P H ^ 2 P H ^ 2
    ( H ^ 1 P H ^ 2 ) P ( H ^ 1 ) and ( H ^ 1 P H ^ 2 ) P ( H ^ 2 )
    so that
    ( H ^ 1 P H ^ 2 ) P ( H ^ 1 ) P ( H ^ 2 )
    Further, since ( H ^ 1 ) P H ^ 1 , ( H ^ 2 ) P H ^ 2 , ( H ^ 1 ) P ( H ^ 2 ) P H ^ 1 P H ^ 2 , so that ( H ^ 1 ) P ( H ^ 2 ) is a PCHF open subset of H ^ 1 P H ^ 2 . Hence,
    ( H ^ 1 ) P ( H ^ 2 ) P ( H ^ 1 P H ^ 2 )
    Thus,
    ( H ^ 1 P H ^ 2 ) = ( H ^ 1 ) P ( H ^ 2 ) .
  • From H ^ 1 P H ^ 1 P H ^ 2 , H ^ 2 P H ^ 1 P H ^ 2
    we have
    ( H ^ 1 ) P ( H ^ 1 P H ^ 2 ) , ( H ^ 2 ) P ( H ^ 1 P H ^ 2 )
    so as, because ( H ^ 1 ) P ( H ^ 2 ) is PCHF open,
    ( H ^ 1 ) P ( H ^ 2 ) P ( H ^ 1 P H ^ 2 ) .
   □
Theorem 5.
Let  ( V , T ) be a PCHF topological space in V and H ^ be a CHFS. Then
1.
H ^ ¯ c = ( ( H ^ ) c )
2.
( H ^ ) c ¯ c = ( H ^ ) .
Proof. 
  • Consider a collection { H ^ α : α Ω } of all PCHF open subsets of ( H ^ ) c . We know that ( ( H ^ ) c ) = α Ω H ^ α , which yields that ( ( ( H ^ ) c ) ) c = ( α Ω H ^ α ) c = α Ω ( H ^ α ) c . Each ( H ^ α ) c is a PCHF closed superset of H ^ because each H ^ α is a PCHF open subset of ( H ^ ) c . This indicates that { ( H ^ α ) c : α Ω } is an assemblage of all PCHF closed supersets of H ^ . H ^ ¯ is the smallest PCHF closed superset of H ^ , consequently, it is the PCHF intersection all of its PCHF closed supersets. So, H ^ ¯ = α Ω ( H ^ α ) c = ( ( ( H ^ ) c ) ) c utilizing the previous argument. We can now attain the desired result by taking the PCHF complement.
  • Proof is obvious.
   □
Theorem 6.
Let ( V , T ) be a PCHF topological space over V, and H ^ 1 and H ^ 2 are CHFSs in V . Then
1.
( H ^ 1 ) c contains the largest PCHF open set E x t ( H ^ 1 ) .
2.
( H ^ 1 ) c is PCHF open E x t ( H ^ 1 ) = ( H ^ 1 ) c .
3.
H ^ 1 P H ^ 2 E x t ( H ^ 1 ) P E x t ( H ^ 2 ) .
Proof. 
Proof is straightforward.    □
Theorem 7.
Let ( V , T ) be a PCHF topological space in V and H ^ be a CHFS, then
1.
F r ( H ^ ) = F r ( ( H ^ ) c ) .
2.
( F r ( H ^ ) ) c = ( H ^ ) P ( ( H ^ ) c ) .
3.
If H ^ is PCHF open, then F r ( H ^ ) P ( H ^ ) c .
Proof. 
  • By definition of PCHF frontier, F r ( H ^ ) = H ^ ¯ P ( H ^ ) c ¯ = ( H ^ ) c ¯ P H ^ ¯ = ( H ^ ) c ¯ P ( ( H ^ ) c ) c ¯ = F r ( ( H ^ ) c ) .
  • Since F r ( H ^ ) = H ^ ¯ P ( H ^ ) c ¯ , by taking the PCHF complement on both sides, we get ( F r ( H ^ ) ) c = H ^ ¯ P ( H ^ ) c ¯ c = ( H ^ ¯ ) c .
    P ( H ^ ) c ¯ c = ( ( H ^ ) c ) P ( H ^ ) .
  • Let H ^ be a PCHF open set, this yields that ( H ^ ) c is PCHF closed. Utilizing (2), F r ( H ^ ) c P ( H ^ ) c and by ( 1 ) , we have F r ( H ^ ) P ( H ^ ) c .
   □
Definition 24.
Consider a PCHF topological space ( V , T ) . A CHFS H ^ is termed as dense in V if H ^ ¯ = 1 V .
Example 10.
Imagine a PCHF topological space constructed in Example 3.2 . Consider a CHFS H ^ 4 defined on V = { κ 1 θ , κ 2 θ , κ 3 θ } .
H ^ 4 = { κ 1 θ , { [ 0.20 , 0.70 ] } , { 0.55 } , κ 2 θ , { [ 0.10 , 0.55 ] , [ 0.15 , 0.65 ] } , { 0.53 , 0.62 } , κ 3 θ , { [ 0.48 , 0.70 ] , [ 0.36 , 0.53 ] } , { 0.46 , 0.51 } }
We see that H ^ 4 ¯ = 1 V . So, H ^ 4 ¯ is dense in V .
Definition 25.
A cubic hesitant fuzzy number c ˇ = { [ μ i , μ i + ] } , { γ i } belongs to a cubic hesitant fuzzy set if μ i ( κ θ ) μ j ( κ θ ) , μ i + ( κ θ ) μ j + ( κ θ ) and γ i ( κ θ ) γ j ( κ θ ) ; j varies according to alternatives and κ θ V .
Definition 26.
Assume a PCHF topological space ( V , T ) . A PCHF subset H ^ ^ of V containing CHFN c ˇ V is known as a neighborhood of c ˇ if there is a PCHF open set H ^ containing c ˇ so that H ^ ^ contains H ^
c ˇ H ^ p H ^ ^
Example 11.
From Example 6, a CHFN c ˇ = [ 0.35 , 0.74 ] , 0.45 belongs to PCHF open set H ^ 1 , which is a PCHF subset of H ^ 2 . From this, we can say that H ^ 2 is a neighborhood of c ˇ .
Definition 27.
A PCHF topological space is defined as ( V , T ) . If every CHFS in T is a P-union of members of B , the sub-collection B of T is said to be a PCHF base for T of V . PCHF basic open sets are made up of the members of B .
Example 12.
From Example 6, we see that T = { 0 V , H ^ 1 , H ^ 2 , 1 V } is a PCHF topology on V . A sub-collection B = { H ^ 1 , H ^ 2 , 1 V } of T is a PCHF base for V , as every CHFS in V is a P-union of members of B .

3. R-Cubic Hesitant Fuzzy Topology

Definition 28.
Consider a universe of discourse V and a family of CHFSs in V is T . Then T is said to be an RCHF topology on V if it satisfies the following properties:
1.
0 ¯ V , 1 ¯ V T .
2.
( R H ^ i ) i Λ T , for each ( H i ^ ) i Λ T .
3.
H ^ 1 R H ^ 2 T , for any H ^ 1 , H ^ 2 T .
Then ( V , V ) is called an RCHF topological space.
Example 13.
Let V = { κ 1 θ , κ 2 θ } be a universal set.
H ^ 1 = κ 1 θ , { [ 0.23 , 0.56 ] } , { 0.30 } , κ 2 θ , { [ 0.34 , 0.78 ] , [ 0.39 , 0.80 ] } , { 0.70 , 0.55 } H ^ 2 = κ 1 θ , { [ 0.32 , 0.65 ] } , { 0.28 } , κ 2 θ , { [ 0.40 , 0.80 ] , [ 0.42 , 0.81 ] } , { 0.46 , 0.55 }
be CHFSs on V . Table 6 and Table 7 show the R-union and R-intersection of the CHFSs H ^ 1 and H ^ 2 , respectively.
We see that T 1 = 0 ¯ V , 1 ¯ V , T 2 = 0 ¯ V , H ^ 1 , 1 ¯ V , T 3 = 0 ¯ V , H ^ 2 , 1 ¯ V , and T 4 = 0 ¯ V , H ^ 1 , H ^ 2 , 1 ¯ V are RCHF topologies on V , where
0 ¯ V = κ 1 θ , { [ 0.00 , 0.00 ] } , { 1.00 } , κ 2 θ , { [ 0.00 , 0.00 ] , [ 0.00 , 0.00 ] } , { 1.00 , 1.00 } is null CHFS of V .
1 V = κ 1 θ , { [ 1.00 , 1.00 ] } , { 0.00 } , κ 2 θ , { [ 1.00 , 1.00 ] , [ 1.00 , 1.00 ] } , { 0.00 , 0.00 } is absolute CHFS of V .
Example 14.
Let V = { κ 1 θ , κ 2 θ } be a universal set.
H ^ 1 = κ 1 θ , { [ 0.30 , 0.51 ] } , { 0.60 } , κ 2 θ , { [ 0.25 , 0.45 ] , [ 0.35 , 0.60 ] } , { 0.70 , 0.50 } H ^ 2 = κ 1 θ , { [ 0.00 , 0.00 ] } , { 0.60 } , κ 2 θ , { [ 0.00 , 0.00 ] , [ 0.00 , 0.00 ] } , { 0.70 , 0.50 } H ^ 3 = κ 1 θ , { [ 1.00 , 1.00 ] } , { 0.60 } , κ 2 θ , { [ 1.00 , 1.00 ] , [ 1.00 , 1.00 ] } , { 0.70 , 0.50 } H ^ 4 = κ 1 θ , { [ 0.30 , 0.51 ] } , { 0.00 } , κ 2 θ , { [ 0.25 , 0.45 ] , [ 0.35 , 0.60 ] } , { 0.00 , 0.00 } H ^ 5 = κ 1 θ , { [ 0.30 , 0.51 ] } , { 1.00 } , κ 2 θ , { [ 0.25 , 0.45 ] , [ 0.35 , 0.60 ] } , { 1.00 , 1.00 }
are CHFSs on V . R-union and R-intersection of these CHFSs are given in Table 8 and Table 9.
We see that T = 0 ¯ V , 1 ¯ V , H ^ 1 , H ^ 2 , H ^ 3 , H ^ 4 , H ^ 5 is an RCHF topology on V ,
where
0 ¯ V = κ 1 θ , { [ 0.00 , 0.00 ] } , { 1.00 } , κ 2 θ , { [ 0.00 , 0.00 ] , [ 0.00 , 0.00 ] } , { 1.00 , 1.00 }
1 ¯ V = κ 1 θ , { [ 1.00 , 1.00 ] } , { 0.00 } , κ 2 θ , { [ 1.00 , 1.00 ] , [ 1.00 , 1.00 ] } , { 0.00 , 0.00 }
Definition 29.
If ( V , T ) is an RCHF topological space in V , the members of ( V , T ) are RCHF open sets in V .
Definition 30.
Let ( V , T ) be an RCHF topological space in V . If the complement of a CHFS is RCHF open, a CHFS in V is said to be an RCHF closed set in V .
Theorem 8.
Suppose that ( V , T ) is an RCHF topological space. Then
1.
0 ¯ V , 1 ¯ V are RCHF closed sets in V .
2.
( R H ^ α ) α Ω is an RCHF closed set in V , where each H α ^ is an RCHF closed set.
3.
( R H ^ i ) is an RCHF closed set in V for any RCHF closed sets H ^ 1 and H ^ 2 .
Proof. 
Proof is obvious.    □
Definition 31.
Let ( V , T 1 ) and ( V , T 2 ) be two RCHF topological spaces over identical universal set V . If T 1 R T 2 then T 1 is said to be an RCHF coarser or an RCHF weaker than T 2 , or T 2 is said to be an RCHF finer or an RCHF stronger than T 1 .
If T 1 R T 2 or T 2 R T 1 , then these RCHF topologies are not camparable.
Example 15.
Let T 1 and T 2 be two RCHF topologies on identical universe of discourse V = { κ 1 θ , κ 2 θ } and T 1 = { 0 ¯ V , 1 ¯ V } is RCHF indiscrete topology on V and T 2 = { 0 ¯ V , 1 ¯ V , H ^ 1 , H ^ 2 , H ^ 3 , H ^ 4 , H ^ 5 } is RCHF topology defined in Example ( 4.2 ) . Clearly T 1 R T 2 , then T 1 is RCHF coaser than T 2 , and T 2 is an RCHF finer than T 1 .
Definition 32.
Assume a universal set V and the assemblage of all CHFSs T is defined in V . Then T is an RCHF discrete topology on V , and ( V , T ) is known as RCHF discrete topological space in V .
Definition 33.
Suppose that V is a universal set and T = { 0 ¯ V , 1 ¯ V } . Then T is an RCHF indiscrete topology on V , and ( V , T ) is an RCHF indiscrete topological space in V .
Definition 34.
Assume that an RCHF topological space is defined as ( V , T ) , and Y is an RCHF subset of V . Let T ¯ consist of those RCHF subsets D ^ of Y for which there is an H ^ in T such that
D ^ = H ^ R Y ˇ
where Y ˇ may be an absolute CHFS or any CHFS defined on Y . We can easily check that ( Y , T ¯ ) is an RCHF topological space. It is called an RCHF subspace of ( V , T ) and T ¯ is known as RCHF subspace or RCHF relative topology on Y .
Example 16.
Consider ( V , T ) to be an RCHF topological space where V = { κ 1 θ , κ 2 θ } and T = { 0 ¯ V , 1 ¯ V , H ^ 1 , H ^ 2 , H ^ 3 , H ^ 4 , H ^ 5 } . Let Y = { κ 1 θ } be an RCHF subset of V such that Y ˇ = κ 1 θ , { [ 1.00 , 1.00 ] } , { 1.00 } is a CHFS defined on Y . Then
0 ¯ V R Y ˇ = 0 ¯ V Y
1 ¯ V R Y ˇ = 1 V Y
H ^ 1 R Y ˇ = H ^ 1 Y
H ^ 2 R Y ˇ = 0 ¯ V Y
H ^ 3 R Y ˇ = 1 V Y
H ^ 4 R Y ˇ = H ^ 1 Y
H ^ 5 R Y ˇ = H ^ 1 Y
where
0 ¯ V Y = κ 1 θ , { [ 0.00 , 0.00 ] } , { 1.00 } ,
1 V Y = κ 1 θ , { [ 1.00 , 1.00 ] } , { 1.00 } ,
H ^ 1 Y = κ 1 θ , { [ 0.30 , 0.51 ] } , { 1.00 } .
We can see that T ¯ = 0 ¯ V Y , H ^ 1 Y , 1 V Y is an RCHF subspace or RCHF relative topology on Y , and ( Y , T ¯ ) is an RCHF topological space. It is called an RCHF subspace of ( V , T ) . If
Y ˇ = κ 1 θ , { [ 0.45 , 0.66 ] } , { 0.57 }
then we can see that T ¯ = 0 ¯ V Y , H ^ 1 Y , H ^ 2 Y , H ^ 3 Y , H ^ 4 Y , H ^ 5 Y , H ^ 6 Y , H ^ 7 Y , Y ˇ is an RCHF subspace on Y and ( Y , T ¯ ) is an RCHF topological space.
where
0 ¯ V Y = κ 1 θ , { [ 0.00 , 0.00 ] } , { 1.00 } , H ^ 1 Y = κ 1 θ , { [ 0.00 , 0.00 ] } , { 0.57 } ,
H ^ 2 Y = κ 1 θ , { [ 0.45 , 0.66 ] } , { 1.00 } , H ^ 3 Y = κ 1 θ , { [ 0.30 , 0.51 ] } , { 0.60 } ,
H ^ 4 Y = κ 1 θ , { [ 0.00 , 0.00 ] } , { 0.60 } , H ^ 5 Y = κ 1 θ , { [ 0.45 , 0.66 ] } , { 0.60 } ,
H ^ 6 Y = κ 1 θ , { [ 0.30 , 0.51 ] } , { 0.57 } , H ^ 7 Y = κ 1 θ , { [ 0 , 30 , 0.51 ] } , { 1.00 } ,
Y ˇ = κ 1 θ , { [ 0.45 , 0.66 ] } , { 0.57 }
Remark 5.
1.
Any RCHF subspace of an RCHF discrete space is RCHF discrete.
2.
Any RCHF subspace of an RCHF indiscrete space is RCHF indiscrete.
3.
An RCHF subspace A ˇ of an RCHF subspace Y ˇ of an RCHF topological space V is an RCHF subspace of V .
Definition 35.
Let ( V , T ) be an RCHF topological space. For any CHFS H ^ of V :
1.
RCHF closure H ^ ¯ is interpreted as the R-intersection of all RCHF closed super sets of H ^ .
Distinctly, H ^ ¯ is the nominal RCHF closed set that contains H ^ .
2.
RCHF interior ( H ^ ) is interpreted as the R-union of all RCHF open subsets of H ^ .
3.
RCHF exterior Ext ( H ^ ) is interpreted as the interior of R-complement of CHFS H ^ .
4.
RCHF frontier Fr ( H ^ ) is interpreted as the R-intersection of H ^ ¯ and ( H ^ ¯ ) c .
Example 17.
Let V = { κ 1 θ , κ 2 θ } be a universe of discourse. From Example 14, we see that T = 0 ¯ V , 1 ¯ V , H ^ 1 , H ^ 2 , H ^ 3 , H ^ 4 , H ^ 5 is an RCHF topology on V . The R-complements of CHFSs 0 ¯ V , 1 ¯ V , H ^ 1 , H ^ 2 , H ^ 3 , H ^ 4 and H ^ 5 are given below:
( 0 ¯ V ) c = 1 ¯ V , ( 1 ¯ V ) c = 0 ¯ V
( H ^ 1 ) c = κ 1 θ , { [ 0.49 , 0.70 ] } , { 0.40 } , κ 2 θ , { [ 0.55 , 0.75 ] , [ 0.40 , 0.65 ] } , { 0.30 , 0.50 } ,
( H ^ 2 ) c = κ 1 θ , { [ 1.00 , 1.00 ] } , { 0.40 } , κ 2 θ , { [ 1.00 , 1.00 ] , [ 1.00 , 1.00 ] } , { 0.30 , 0.50 } ,
( H ^ 3 ) c = κ 1 θ , { [ 0.00 , 0.00 ] } , { 0.40 } , κ 2 θ , { [ 0.00 , 0.00 ] , [ 0.00 , 0.00 ] } , { 0.30 , 0.50 } ,
( H ^ 4 ) c = κ 1 θ , { [ 0.49 , 0.70 ] } , { 1.00 } , κ 2 θ , { [ 0.55 , 0.75 ] , [ 0.40 , 0.65 ] } , { 1.00 , 1.00 } ,
( H ^ 5 ) c = κ 1 θ , { [ 0.49 , 0.70 ] } , { 0.00 } , κ 2 θ , { [ 0.55 , 0.75 ] , [ 0.40 , 0.65 ] } , { 0.00 , 0.00 } .
Consider
H ^ 6 = κ 1 θ , { [ 0.45 , 0.63 ] } , { 0.40 } , κ 2 θ , { [ 0.30 , 0.56 ] , [ 0.35 , 0.60 ] } , { 0.60 , 0.50 } to be a CHFS.
Then
H ^ ¯ 6 = ( H ^ 1 ) c R ( H ^ 2 ) c R ( H ^ 5 ) c = ( H ^ 1 ) c ( H ^ 6 ) = H ^ 1 R H ^ 5 = H ^ 1 E x t ( H ^ 6 ) = H ^ 1 R H ^ 2 R H ^ 5 = H ^ 1 F r ( H ^ 6 ) = H ^ 6 ¯ p ( H ^ 6 ) c ¯ = ( H ^ 1 ) c R ( H ^ 5 ) c = ( H ^ 1 ) c
Theorem 9.
Suppose V is a universe of discourse and ( V , T ) is an RCHF topological space in V ; H ^ 1 and H ^ 2 are CHFSs in V . Then
1.
H ^ 1 R H ^ 1 ¯
2.
H ^ 1 is an RCHF closed set H ^ 1 = H ^ 1 ¯
3.
H ^ 1 ¯ ¯ = H ^ 1 ¯
4.
H ^ 1 ¯ R H ^ 2 ¯ if H ^ 1 R H ^ 2
5.
H ^ 1 ¯ R H ^ 2 ¯ = H ^ 1 R H ^ 2 ¯
6.
H ^ 1 R H ^ 2 ¯ R H ^ 1 ¯ R H ^ 2 ¯
Proof. 
Proof is obvious.    □
Theorem 10.
Let ( V , T ) be an RCHF topological space in V ; H ^ 1 and H ^ 2 are CHFSs in V . Then
1.
( H ^ 1 ) R H ^ 1
2.
( ( H ^ 1 ) ) = ( H ^ 1 )
3.
H ^ 1 is an RCHF open set H ^ 1 = ( H ^ 1 )
4.
( H ^ 1 ) R ( H ^ 2 ) if H ^ 1 R H ^ 2
5.
( H ^ 1 ) R ( H ^ 2 ) = ( H ^ 1 R H ^ 2 )
6.
( H ^ 1 ) R ( H ^ 2 ) R ( H ^ 1 R H ^ 2 )
Proof. 
Proof is straightforward.    □
Theorem 11.
Let ( V , T ) be an RCHF topological space in V and H ^ be a CHFS, then
1.
( ( H ^ ) c ) = H ^ ¯ c
2.
( H ^ ) = ( H ^ ) c ¯ c .
Proof. 
It is obvious.    □
Theorem 12.
Consider an RCHF topological space ( V , T ) in V ; H ^ 1 and H ^ 2 are CHFSs in V . Then
1.
( H ^ 1 ) c contains the largest RCHF open set E x t ( H ^ 1 ) .
2.
( H ^ 1 ) c is RCHF open E x t ( H ^ 1 ) = ( H ^ 1 ) c .
3.
H ^ 1 R H ^ 2 E x t ( H ^ 1 ) R E x t ( H ^ 2 ) .
Proof. 
Proof is obvious.    □
Theorem 13.
Let ( V , T ) be an RCHF topological space in V and H ^ be a CHFS, then
1.
F r ( H ^ ) = F r ( H ^ ) c .
2.
( F r ( H ^ ) ) c = ( H ^ ) R ( ( H ^ ) c ) .
3.
If H ^ is RCHF open, then F r ( H ^ ) R ( H ^ ) c .
Proof. 
Proof is obvious.    □
Definition 36.
Let ( V , T ) be an RCHF topological space on V . A CHFS H ^ is called dense in V if H ^ ¯ = 1 ¯ V .
Example 18.
We consider the RCHF topological space constructed in Example ( 4.3 ) . Consider
H ^ 7 = κ 1 θ , { [ 0.55 , 0.86 ] } , { 0.35 } , κ 2 θ , { [ 0.60 , 0.79 ] , [ 0.45 , 0.83 ] } , { 0.26 , 0.49 } .
We see that H ^ ¯ 7 = 1 ¯ V . So, H ^ 7 is dense in V .
Definition 37.
Let ( V , T ) be an RCHF topological space. An RCHF subset H ^ ^ of V containing CHFN c ˇ V is known as a neighborhood of c ˇ if there is an RCHF open set H ^ having c ˇ such that H ^ ^ contains H ^
c ˇ H ^ R H ^ ^
Example 19.
From Example 14, a CHFN c ˇ = [ 0.00 , 0.00 ] , 0.60 belongs to RCHF open set H ^ 2 , which is an RCHF subset of H ^ 1 and H ^ 3 . From this, we can say that H ^ 1 and H ^ 3 are neighborhoods of c ˇ .
Definition 38.
An RCHF topological space is defined as ( V , T ) . If every CHFS in T is an R-union of members of B , the sub-collection B of T is said to be an RCHF base for T of V . RCHF basic open sets are made up of the members of B .
Example 20.
From Example 14, we see that T = { 0 ¯ V , 1 ¯ V , H ^ 1 , H ^ 2 , H ^ 3 , H ^ 4 , H ^ 5 } is an RCHF topology on V . A sub-collection B = 1 ¯ V , H ^ 1 , H ^ 2 , H ^ 3 , H ^ 4 , H ^ 5 of T is an RCHF base for T , as every CHFS in T is an R-union of members of B .

4. Extended Cubic Hesitant Fuzzy TOPSIS Method

In this section, we discuss various kinds of heart disease by providing a brief but exhaustive overview of this critical disease, including the symptoms for each category, and we use the proposed TOPSIS technique to rank patients having heart disease.
Case study 
The heart is at the core of your vascular system, which is a series of vessels that conduct blood to all parts of your body. Blood delivers oxygen and other vital nutrients that all vital tissues requires to keep fit and adequately healthy. Heart failure, also known as congestive heart failure, transpires when the heart muscle fails to pump blood as well as it should. When this transpires, blood can pool in the lungs, and fluid can accumulate, causing respiratory distress. Cardiac disorders, such as narrowed carotid arteries (coronary artery disease) or high cholesterol, cause the heart to stiffen over time or to weaken, rendering it unable to fill and pump blood effectively. Heart failure is a potentially fatal condition. People that suffer from heart failure can suffer drastic indications, and some can undergo heart surgery or receive a ventricular assist device (VAD). Heart failure can be persistent (chronic) or develop abruptly (acute). Heart failure symptoms may include the following (https://www.mayoclinic.org/diseases-conditions/heart-failure/symptoms-causes/syc-20373142 accessed on 4 April 2022):
  • Shortness of breath during physical exertion or when resting
  • An erratic or fast heartbeat
  • Fatigue and weakness
  • Reduced exercise capacity
  • Weight gain by retention of fluid
  • Swelling of ankles, legs and feet
  • Persistent wheezing or coughing with white or pink blood-tinged mucous
  • Swollen abdomen
  • Appetite loss and nausea
  • Difficulty focusing
Heart failure frequently arises as a result of the heart being injured or weakened by another disorder. Heart failure can also occur if the heart becomes overly rigid. In heart failure, the crucial pumping chambers of the heart (the ventricles) may stiffen and fail to fill properly between beats. Ejection fraction is used to assist categorization and heart failure diagnosis. In a healthy heart, the ejection fraction is 50 percent or greater—this means that with each beat, more than half of the blood in the ventricle is pushed out. Heart failure can develop even with a normal ejection fraction. This occurs when the heart muscle stiffens due to factors such as high blood pressure. Other causes of abrupt (acute) cardiac failure include (https://www.healthline.com/health/heart-failure accessed on accessed on 4 April 2022):
  • Allergic reactions
  • Disease affecting the entire body
  • Blood clots in the lungs
  • Severe infections
  • Taking some medications
  • Germs that wreak havoc on the cardiac muscle
Types of heart failure (https://www.webmd.com/heart-disease/heart-failure/heart-failure-overview accessed on accessed on 4 April 2022) are given in Table 10.
A lone risk factor may be sufficient to induce heart failure, but a fusion of risk factors raises your chances. Heart failure risk factors include: irregular heartbeats, alcohol use, viruses, coronary artery disease, heart attack, congenital heart disease, sleep apnea, obesity, heart valve disease, diabetes, smoking or using tobacco, etc.
Heart failure is classified into four stages (https://https://www.topdoctors.co.uk/medical-articles/understanding-4-stages-heart-failure accessed on 4 April 2022): A, B, C and D, which vary from higher risk of getting heart failure to progressive disease.
  Stage A 
Stage A is classified as pre-heart failure. It implies you are at risk of developing heart failure because you have had heart failure before or have one or more of the following medical conditions: hyperpiesis and coronary artery disease, rheumatic fever history, diabetes, metabolic disorder, a history of alcoholism and/or family history of cardiomyopathy.
  Stage B 
Asymptomatic or silent heart failure is considered Stage B. It indicates that you have systolic left ventricular dysfunction but have never experienced heart failure symptoms. The majority of people with Stage B heart failure have an ejection fraction (EF) of 40 percent or less on an echocardiogram (echo). People in this cluster have heart failure and low EF (HF rEF) for any reason.
  Stage C 
People in stage C heart failure have been diagnosed with heart failure and are experiencing (or have previously experienced) signs and symptoms. The most common heart failure symptoms are: wheezing, fatigue, reduced exercising capability and/or swelling of the feet, ankles, lower legs and abdomen.
  Stage D 
Patients in Stage D have severe symptoms that do not improve with intervention. This is the most severe stage of heart failure. They exhibit symptoms under modest or minor activity or even at rest.
For making a unanimous judgment, we employ the well-known TOPSIS technique for selecting an optimal alternative from a set of feasible alternatives, with the goal that the chosen solution is next to the ideal solution and farthest away from the worst answer. The TOPSIS approach is suitable to address hesitancy and vagueness in MCDM problems. The proposed extended cubic hesitant fuzzy TOPSIS is an efficient mathematical model for medical diagnosis and other MCDM problems.
We begin by developing the suggested technique step-wise, as shown below Table 11:
A summary of the stages of heart failure are shown in Figure 1.
Example 21.
 
Step 1: Let D = { D 1 , D 2 , D 3 , D 4 } be the set of doctors/decision makers and V = { κ 1 θ , κ 2 θ , κ 3 θ , κ 4 θ } be the set of patients under diagnosis. Let C = { e 1 , e 2 , e 3 , e 4 } be the set of symptoms/criteria, where
  • e 1 = persistent cough,
  • e 2 = fatigue and weakness,
  • e 3 = abdomen,
  • e 4 = irregular heartbeat.
Step 2: The weighted parameters matrix P is given by
P = [ w i j ] 4 × 4
S B S A S C S D S C S B S D S C S D S A S B S B S A S B S C S D
0.300 0.100 0.600 0.900 0.600 0.300 0.900 0.600 0.900 0.100 0.300 0.300 0.100 0.300 0.600 0.900
where w i j depicts the weight given by the decision makers D i under attributes/criteria c j .
Step 3: The weighted normalized matrix is
N = [ n ˜ i j ] 4 × 4
0.266 0.224 0.471 0.625 0.532 0.671 0.707 0.417 0.799 0.224 0.236 0.208 0.089 0.671 0.471 0.625
Then the weight vector becomes K = ( 0.233 , 0.248 , 0.260 , 0.259 ) .
Step 4: Suppose that the four decision makers give the following P-CHF matrices, where the patients are given by the rows and the criteria are expressed in the columns; the ( i , j ) t h position are given in Table 12, Table 13, Table 14 and Table 15.
Thus, the mean proportional matrix
A = [ κ θ ˙ j k ] 4 × 4
is given in Table 16.
Step 5: The weighted CHF matrix
B = [ κ θ ¨ j k ] 4 × 4
where κ θ ¨ j k = ϖ k × κ θ ˙ j k is given in Table 17.
Step 6: The P-CHF PIS and P-CHF NIS, respectively, are
P C H F P I S = { { [ 0.135 , 0.205 ] , [ 0.105 , 0.240 ] , [ 0.163 , 0.271 ] } , { 0.830 , 0.825 , 0.845 } , { [ 0.192 , 0.221 ] , [ 0.181 , 0.220 ] , [ 0.158 , 0.265 ] } , { 0.854 , 0.856 , 0.870 } , { [ 0.187 , 0.232 ] , [ 0.187 , 0.249 ] , [ 0.176 , 0.239 ] } , { 0.831 , 0.831 , 0.842 } , { [ 0.164 , 0.284 ] , [ 0.164 , 0.284 ] , [ 0.172 , 0.250 ] } , { 0.848 , 0.852 , 0.851 } }
P C H F N I S = { { [ 0.090 , 0.115 ] , [ 0.072 , 0.115 ] , [ 0.089 , 0.115 ] } , { 0.773 , 0.773 , 0.773 } { [ 0.116 , 0.164 ] , [ 0.116 , 0.164 ] , [ 0.115 , 0.211 ] } , { 0.761 , 0.761 , 0.834 } , { [ 0.135 , 0.161 ] , [ 0.135 , 0.161 ] , [ 0.134 , 0.161 ] } , { 0.797 , 0.810 , 0.826 } , { [ 0.110 , 0.135 ] , [ 0.110 , 0.135 ] , [ 0.110 , 0.135 ] } , { 0.783 , 0.783 , 0.783 } }
Step 7, 8: The distance of each patient from the P-CHF PIS and the P-CHF NIS and the corresponding relative closeness are given in Table 18.
Step 9: So, the patients’ preferred order is
κ 4 θ κ 3 θ κ 1 θ κ 2 θ
This shows that patient κ 4 θ is in a critical situation.
Example 22.
 
Step 1: Consider the data in Example 21. Let D = { D 1 , D 2 , D 3 , D 4 } be the set of doctors/decision-makers and V = { κ 1 θ , κ 2 θ , κ 3 θ , κ 4 θ } be the set of patients under diagnosis. Let C = { e 1 , e 2 , e 3 , e 4 } be the set of symptoms/criteria. Let { D 1 , D 2 , D 3 , D 4 } be the set of CHFSs.
Step 2: Now we establish P-CHF topology given by
τ = { D 1 , D 2 , D 3 , D 4 } ,
where D 3 and D 4 are the null P-CHFS and absolute P-CHFS, respectively.
Step 3: The score matrices of CHFSs D 1 , D 2 , D 3 and D 4 , are given below.
The score matrix of D 1
0.213 0.248 0.120 0.149 0.031 0.108 0.291 0.024 0.080 0.069 0.269 0.435 0.310 0.401 0.160 0.121
The score matrix of D 2
0.134 0.335 0.198 0.007 0.055 0.368 0.446 0.199 0.225 0.307 0.398 0.514 0.480 0.556 0.367 0.420
The score matrix of D 3
0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000 0.000
The score matrix of D 4
1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000
Step 4: Now we enumerate the decision table of D 1 and D 2 only because there is no need to find the decision table of D 3 and D 4 . The decision table of D 1 and D 2 are given in Table 19 and Table 20.
Step 5: The aggregated decision table can be assessed by adding decision tables D 1 and D 2 . The resulting decision table is given in Table 21.
Step 6: The final ranking is given by
κ 4 θ κ 3 θ κ 2 θ κ 1 θ
This implies that patient κ 4 θ is in critical condition.

Comparison Analysis

We notice that the optimal alternative remains identical by use of Algorithms 1 and 2. However, the ranking of alternatives is not exactly the same. This shows that the optimal alternative is selected unanimously. The numerical values of alternatives are very close by using Algorithm 1. However, the numerical values of alternatives have clear differences by using Algorithm 2. The comparative analysis of ranking of alternatives by using Algorithms 1 and 2 is shown in Table 22 and Figure 2.
Algorithm 1 Extended cubic hesitant fuzzy TOPSIS
  • Step 1: Assume that ‘n’ is the number of doctors/decision-makers D 1 , D 2 , , D n , provided with ‘l’ number of patients κ 1 θ , κ 2 θ , , κ l θ and ‘m’ number of symptoms/criteria e 1 , e 2 , , e m .
  • Step 2: The DMs have to grant preference weights to the symptoms/criteria. Let w i j be the weight given by i th DM to j th attribute. The dialectal/linguistic variables are given in Table 11. For our convenience, we establish weighted parameter matrix P = [ w i j ] n × p .
  • Step 3: The normality of the weights matrix must be ensured. If the weights w i j are not normal, we will normalize by the formula w ˜ i j = w i j i w i j 2 . The normalized values are shown as N = [ n ˜ i j ] n × p . Afterwards, the weight vector can be obtained as K = ( ϖ j : j = 1 , 2 , . . . , p ) , where ϖ j = 1 n i n ˜ i j k n ˜ i k .
  • Step 4: Each DM gives a CHF matrix D i = ( κ θ j k i ) n × p , i = 1 , 2 , , n , where κ θ j k i is the value which DM ‘i’ assigns to attribute ‘k’ corresponding to alternative ‘j’. Then the mean proportional matrix A = [ κ θ ˙ j k ] n × p is obtained by averaging the CHFEs.
  • Step 5: Construct the weighted CHF matrix as B = [ κ θ ¨ j k ] n × p , where κ θ ¨ j k = ϖ k × κ θ ˙ j k .
  • Step 6: In this step, the positive ideal solution (PIS) and negative ideal solution (NIS) of P-order or R-order (whichever is suitable) are obtained in CHF domain by using
  • PIS:   κ θ ¨ j + = P i κ θ ¨ j k  or  κ θ ¨ j + = R i κ θ ¨ j k
  • NIS:   κ θ ¨ j = P i κ θ ¨ j k  or  κ θ ¨ j = R i κ θ ¨ j k .
  • Step 7: Compute the distance ξ i + of the PIS from each of the rows of matrix B and the distance ξ i of the NIS from each of the rows of matrix B. The distance between two CHFNs is
  • H ^ = [ ϱ 1 , ϱ 1 + ] , [ ϱ 2 , ϱ 2 + ] , , [ ϱ m , ϱ m + ] , ϱ 1 , ϱ 2 , , ϱ m = [ ϱ j , ϱ j + ] , ϱ j and
  • D ^ = [ ρ 1 , ρ 1 + ] , [ ρ 2 , ρ 2 + ] , , [ ρ m , ρ m + ] , ρ 1 , ρ 2 , , ρ m = [ ρ j , ρ j + ] , ρ j
    ξ ( H ^ , D ^ ) = j = 1 m ϱ j + ϱ j + 2 ρ j + ρ j + 2 m + j = 1 m | ϱ j ρ j | m 1 / m .
  • The variable ‘m’ varies as CHFNs vary according to alternatives.
  • Step 8: Compute the coefficients of relative closeness by the formula
    i = ξ i ξ i + + ξ i .
  • Step 9: Prioritize the alternatives in descending order so that the desired order of all alternatives is presented.
Algorithm 2 Extended cubic hesitant fuzzy TOPSIS
  • Step 1: Assume that { D 1 , D 2 , , D n } is the set of doctors/decision makers, { κ 1 θ , κ 2 θ , , κ l θ } is the set of patients and { e 1 , e 2 , , e m } is the set of symptoms/criteria. Compute CHFSs H ^ 1 , H ^ 2 , , H ^ n , which show the DM assessments.
  • Step 2: Consider CHF topology τ such that H ^ i , ( i = 1 , · · · , n ) are CHF open sets in τ .
  • Step 3: Determine the score matrix corresponding to each H ^ i .
  • Step 4: Determine the average of the score matrices of CHF open sets. This gives the decision table for each CHF open set.
  • Step 5: By adding the decision tables of CHF open sets H ^ i , compute the aggregated decision table.
  • Step 6: Find the optimal alternative κ i θ by using max ( d i 1 + d i 2 + · · · + d i n ) i = 1 n .

5. Conclusions

A cubic hesitant fuzzy set (CHFS) is a hybrid of a hesitant fuzzy set (HFS) and a cubic set (CS). A CHFS is a new fuzzy model for data analysis, computational intelligence, soft computing and other processes. Cubic hesitant fuzzy topology defined on a CHFS can be utilized to seek solutions of various problems of information analysis, information fusion, big data and decision analysis. We proposed the notions of P-CHF topology with P-order and R-CHF topology with R-order. Certain properties of P-CHF topology and R-CHF topology are defined, such as CHF open set, CHF closed set, CHF closure, CHF interior, CHF exterior, CHF frontier, CHF dense set, CHF neighborhood and CHF basis. Algorithms 1 and 2 were proposed for extended cubic hesitant fuzzy TOPSIS and CHF topology method, respectively. The symmetry of the optimal decision was analyzed by computations with Algorithms 1 and 2. The numerical values of alternatives were very close using Algorithm 1. However, the numerical values of alternatives had clear differences by using Algorithm 2. We applied the proposed methodology for medical diagnosis. A comparative analysis was given to discuss the advantages and validity of the proposed methodology.
For forthcoming analysis, due to flexibility of CHF topology towards data analysis and information analysis, one can extend this work to develop new MCDM techniques with CHF VIKOR, CHF AHP, CHF ELECTRE, CHF aggregation operators, etc.

Author Contributions

M.R.: Conceptualization, Formal analysis and Supervision. S.B.: Methodology and Writing—Review and Editing. Y.A.: Investigation, Supervision and Funding acquisition. D.A.: Investigation and Writing—Review and Editing. 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.

Acknowledgments

The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University, Abha, Saudi Arabia for funding this work through their research groups program under grant number RGP.2/211/43.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Chazal, F.; Michel, B. An introduction to topological data analysis: Fundamental and practical aspects for data scientists. Front. Artif. Intell. 2021, 4, 1–28. [Google Scholar] [CrossRef] [PubMed]
  2. Riihimäki, H.; Chachólski, W.; Theorell, J.; Hillert, J.; Ramanujam, R. A topological data analysis based classification method for multiple measurements. BMC Bioinform. 2020, 21, 1–18. [Google Scholar] [CrossRef] [PubMed]
  3. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–356. [Google Scholar] [CrossRef] [Green Version]
  4. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Set Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  6. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  7. Yager, R.R. Pythagorean membership grades in multi criteria decision-making. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  8. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2017, 25, 1222–1230. [Google Scholar] [CrossRef]
  9. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Green Version]
  10. Smarandache, F. Neutrosophy: Neutrosophic Probability, Set, and Logic: Analytic Synthesis & Synthetic Analysis; American Research Press: Rehoboth, NM, USA, 1998; pp. 1–105. [Google Scholar]
  11. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An Approach towards decision making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019, 31, 7041–7053. [Google Scholar] [CrossRef]
  12. Ashraf, S.; Abdullah, S.; Mahmood, T.; Ghani, F.; Mahmood, T. Spherical fuzzy sets and their applications in multi-attribute decision making problems. J. Intell. Fuzzy Syst. 2019, 36, 2829–2844. [Google Scholar] [CrossRef]
  13. Cuong, B.C. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409–420. [Google Scholar]
  14. Jun, Y.B.; Kim, C.S.; Yang, K.O. Cubic sets. Ann. Fuzzy Math. Inform. 2012, 4, 83–98. [Google Scholar]
  15. Torra, V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010, 25, 529–539. [Google Scholar]
  16. Rodríguez, R.M.; Martínez, L.; Torra, V.; Xu, Z.S.; Herrera, F. Hesitant fuzzy sets: State of the art and future directions. Int. J. Intell. Syst. 2014, 29, 495–524. [Google Scholar] [CrossRef]
  17. Chen, N.; Xu, Z.; Xia, M. Correlation coefficients of hesitant fuzzy sets and their applications to clustering analysis. Appl. Math. Model. 2013, 37, 2197–2211. [Google Scholar] [CrossRef]
  18. Farhadinia, B. Information measures for hesitant fuzzy sets and interval-valued hesitant fuzzy sets. Inf. Sci. 2013, 240, 129–144. [Google Scholar] [CrossRef]
  19. Xia, M.; Xu, Z. Hesitant fuzzy information aggregation in decision making. Int. J. Approx. Reason. 2011, 52, 395–407. [Google Scholar] [CrossRef] [Green Version]
  20. Qian, G.; Wang, H.; Feng, X. Generalized hesitant fuzzy sets and their application in decision support system. Knowl.-Based Syst. 2013, 37, 357–365. [Google Scholar] [CrossRef]
  21. Chang, C.L. Fuzzy topological spaces. J. Math. Anal. Appl. 1968, 24, 182–190. [Google Scholar] [CrossRef] [Green Version]
  22. Coker, D. An introduction to intuitionistic fuzzy topological spaces. Fuzzy Sets Syst. 1997, 88, 81–89. [Google Scholar] [CrossRef]
  23. Olgun, M.; Ãœnver, M.; Yardimci, S. Pythagorean fuzzy topological spaces. Complex Intell. Syst. 2019, 5, 177–183. [Google Scholar] [CrossRef] [Green Version]
  24. Cagman, N.; Karatas, S.; Enginoglu, S. Soft topology. Comput. Math. Appl. 2011, 62, 351–358. [Google Scholar] [CrossRef] [Green Version]
  25. Lee, J.G.; Hur, K. Hesitant fuzzy topological spaces. Mathematics 2020, 8, 188. [Google Scholar] [CrossRef] [Green Version]
  26. Zeb, A.; Abdullah, S.; Khan, M.; Majid, A. Cubic topology. Int. J. Comput. Sci. Inf. Secur. (IJCSIS) 2016, 14, 659–669. [Google Scholar]
  27. Sreedevi, A.; Shankar, N.R. Key properties of hesitant fuzzy soft topological spaces. Int. J. Sci. Eng. Res. (IJSER) 2016, 7, 149–156. [Google Scholar]
  28. Riaz, M.; Tehrim, S.T. Multi-attribute group decision making based cubic bipolar fuzzy information using averaging aggregation operators. J. Intell. Fuzzy Syst. 2019, 37, 2473–2494. [Google Scholar]
  29. Chen, N.; Xu, Z.; Xia, M. Interval-valued hesitant preference relations and their applications to group decision making. Knowl.-Based Syst. 2013, 37, 528–540. [Google Scholar] [CrossRef]
  30. Beg, I.; Rashid, T. Group decision making using intuitionistic hesitant fuzzy sets. Int. J. Fuzzy Log. Intell. Syst. 2014, 14, 181–187. [Google Scholar] [CrossRef] [Green Version]
  31. Zhang, Z. Interval-valued intuitionistic hesitant fuzzy aggregation operators and their application in group decision-making. J. Appl. Math. 2013, 2013, 670285. [Google Scholar] [CrossRef] [Green Version]
  32. Chen, X.; Li, J.; Qian, L.; Hu, X. Distance and similarity measures for intuitionistic hesitant fuzzy sets. In Proceedings of the International Conference on Artificial Intelligence: Technologies and Applications (ICAITA), Bangkok, Thailand, 24–25 January 2016; Atlantis Press: Dordrecht, The Netherlands; pp. 182–186. [Google Scholar] [CrossRef] [Green Version]
  33. Khan, M.S.A.; Abdullah, S.; Ali, A.; Siddiqui, N.; Amin, F. Pythagorean hesitant fuzzy sets and their application to group decision making with incomplete weight information. J. Intell. Fuzzy Syst. 2017, 33, 3971–3985. [Google Scholar] [CrossRef]
  34. Khan, M.S.A.; Abdullah, S.; Ali, A.; Rahman, K. Pythagorean hesitant fuzzy information aggregation and their application to multi-attribute group decision-making problems. J. Intell. Syst. 2018, 29, 154–171. [Google Scholar] [CrossRef] [Green Version]
  35. Zhang, M.; Zheng, T.; Zheng, W.; Zhou, L. Interval-valued pythagorean hesitant fuzzy set and its application to multiattribute group decision-making. Comlexity 2020, 2020, 1724943. [Google Scholar] [CrossRef]
  36. Babitha, K.V.; John, S.J. Hesitant fuzzy soft sets. J. New Results Sci. 2013, 3, 98–107. [Google Scholar]
  37. Wang, F.; Li, X.; Chen, X. Hesitant fuzzy soft set and its applications in multi-criteria decision making. J. Appl. Math. 2014, 3, 1–10. [Google Scholar]
  38. Wang, J.Q.; Li, X.E.; Chen, X.H. Hesitant Fuzzy Soft Sets with Application in Multicriteria Group Decision Making Problems. Sci. World J. 2015, 2015, 806983. [Google Scholar] [CrossRef] [Green Version]
  39. Mahmood, T.; Mehmood, F.; Khan, Q. Cubic Hesitant Fuzzy Sets and Their Applications to Multi Criteria Decision Making. Int. J. Algebra Stat. 2016, 5, 19–51. [Google Scholar] [CrossRef]
  40. Lan, J.; Jin, R.; Zheng, Z.; Hu, M. Priority degrees for hesitant fuzzy sets: Application to multiple attribute decision making. Oper. Res. Perspect. 2017, 4, 67–73. [Google Scholar] [CrossRef]
  41. Feng, L.; Qiang, F.C.; He, X.W. Type-2 hesitant fuzzy sets. Fuzzy Inf. Eng. 2018, 10, 249–259. [Google Scholar] [CrossRef] [Green Version]
  42. Li, X.; Chen, X. D-Intuitionistic hesitant fuzzy sets and their application in multiple attribute decision making. Cogn. Comput. 2018, 10, 496–505. [Google Scholar] [CrossRef]
  43. Wang, R.; Li, Y. Picture hesitant fuzzy set and its application to multiple criteria decision-making. Symmetry 2018, 10, 295. [Google Scholar] [CrossRef] [Green Version]
  44. Zhang, S.; Xu, Z.; Wu, H. Fusions and preference relations based on probabilistic interval-valued hesitant fuzzy information in group decision making. Soft Comput. 2019, 23, 8291–8306. [Google Scholar] [CrossRef]
  45. Akram, M.; Adeel, A.; Alcantud, J.C.R. Multi-criteria group decision-making using an m-polar hesitant fuzzy TOPSIS approach. Symmetry 2019, 11, 795. [Google Scholar] [CrossRef] [Green Version]
  46. Karaaslan, F.; Karamaz, F. Hesitant fuzzy parameterized hesitant fuzzy soft sets and their applications in decision-making. Int. J. Comput. Math. 2022, 10, 496–505. [Google Scholar] [CrossRef]
  47. Hwang, C.L.; Yoon, K. Methods for multiple attribute decision making. Mult. Attrib. Decis. Making, Lect. Notes Econ. Math. Syst. 1981, 186, 58–191. [Google Scholar]
  48. Chen, C.T. Extensions of the TOPSIS for group decision-making under fuzzy environment. Fuzzy Sets Syst. 2000, 114, 1–9. [Google Scholar] [CrossRef]
  49. Rouyendegh, B.D.; Yildizbasi, A.; Ãœstünyer, P. Intuitionistic Fuzzy TOPSIS method for green supplier selection problem. Soft Comput. 2020, 24, 2215–2228. [Google Scholar] [CrossRef]
  50. Akram, M.; Shumaiza; Arshad, M. Bipolar fuzzy TOPSIS and bipolar fuzzy ELECTRE-I methods to diagnosis. Comput. Appl. Math. 2020, 39, 1–21. [Google Scholar]
  51. Eraslan, S.; Karaaslan, F. A group decision making method based on TOPSIS under fuzzy soft environment. J. New Theory 2015, 3, 30–40. [Google Scholar]
  52. Garg, H.; Arora, R. TOPSIS method based on correlation coefficient for solving decision-making problems with intuitionistic fuzzy soft set information. AIMS Math. 2020, 5, 2944–2966. [Google Scholar] [CrossRef]
  53. Lin, M.; Huang, C.; Xu, Z. TOPSIS method based on correlation coefficient and entropy measure for linguistic Pythagorean fuzzy sets and its application to multiple attribute decision making. Complexity 2019, 2019, 1–16. [Google Scholar] [CrossRef]
  54. Rani, P.; Mishra, A.R.; Rezaei, G.; Liao, H.; Mardani, A. Extended Pythagorean fuzzy TOPSIS method based on similarity measure for sustainable recycling partner selection. Int. J. Fuzzy Syst. 2020, 22, 735–747. [Google Scholar] [CrossRef]
  55. Lin, Y.L.; Ho, L.H.; Yeh, S.L.; Chen, T.Y. A Pythagorean fuzzy TOPSIS method based on novel correlation measures and its application to multiple criteria decision analysis of inpatient stroke rehabilitation. Int. J. Comput. Intell. Syst. 2019, 12, 410–425. [Google Scholar] [CrossRef] [Green Version]
  56. Alkan, N.; Kahraman, C. Evaluation of government strategies against COVID-19 pandemic using q-rung orthopair fuzzy TOPSIS method. Appl. Soft Comput. 2021, 110, 107653. [Google Scholar] [CrossRef] [PubMed]
  57. Dung, V.; Thuy, L.T.; Mai, P.Q.; Dan, N.V.; Lan, N.T.M. TOPSIS Approach Using Interval Neutrosophic Sets for Personnel Selection. Asian J. Sci. Res. 2018, 11, 434–440. [Google Scholar] [CrossRef]
  58. Saqlain, M.; Jafar, M.N.; Riaz, M. A New Approach of Neutrosophic Soft Set with Generalized Fuzzy TOPSIS in Application of Smart Phone Selection. Neutrosophic Sets Syst. 2020, 32, 1–10. [Google Scholar]
  59. Kahraman, C.; Gundogdu, F.K.; Onar, S.C.; Oztaysi, B. Hospital Location Selection Using Spherical Fuzzy TOPSIS. Atlantis Studies in Uncertainty Modelling. In Proceedings of the 11th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT 2019), Prague, Czech Republic, 9–13 September 2019; pp. 77–82. [Google Scholar] [CrossRef] [Green Version]
  60. Naeem, K.; Riaz, M.; Afzal, D. Pythagorean m-polar fuzzy sets and TOPSIS method for the selection of advertisement mode. J. Intell. Fuzzy Syst. 2019, 37, 8441–8458. [Google Scholar] [CrossRef]
  61. Senvar, O.; Otay, I.; Bolturk, E. Hospital Site Selection via Hesitant Fuzzy TOPSIS. IFAC-Pap. Online 2016, 49, 1140–1145. [Google Scholar] [CrossRef]
  62. Zhang, X.L.; Xu, Z.S. Extension of TOPSIS to multi criteria decision making with Pythagorean fuzzy sets. Int. J. Intell. Syst. 2014, 29, 1061–1078. [Google Scholar] [CrossRef]
  63. Xu, Z.S.; Zhang, X.L. Hesitant fuzzy multi-attribute decision making based on TOPSIS with incomplete weight information. Knowl.-Bsed Syst. 2013, 52, 53–64. [Google Scholar] [CrossRef]
  64. Riaz, M.; Hashmi, M.R. Linear Diophantine fuzzy set and its applications towards multi-attribute decision making problems. J. Intell. Fuzzy Syst. 2019, 37, 5417–5439. [Google Scholar] [CrossRef]
  65. Kamaci, H. Linear Diophantine fuzzy algebraic structures. J. Ambient. Intell. Humaniz. Comput. 2021, 12, 10353–10373. [Google Scholar] [CrossRef]
  66. Kamaci, H. Complex linear Diophantine fuzzy sets and their cosine similarity measures with applications. Complex Intell. Syst. 2021, 1–25. [Google Scholar] [CrossRef]
  67. Sreedevi, A.; Shankar, N.R. Results on hesitant fuzzy soft topological spaces. Int. J. Adv. Res. (IJOAR) 2016, 4, 1–9. [Google Scholar]
  68. Akram, M.; Adeel, A.; Alcantud, J.C.R. Group decision-making methods based on hesitant N-soft sets. Expert Syst. Appl. 2019, 115, 95–105. [Google Scholar] [CrossRef]
  69. Mehmood, F.; Hayat, K.; Mahmood, T.; Cao, B.Y. A multi criteria decision making method for cubic hesitant fuzzy sets based on Einstein operational laws. Ital. J. Pure Appl. Math. 2019, 42, 652–669. [Google Scholar]
  70. Garg, H.; Kaur, G. TOPSIS based on nonlinear-programming methodology for solving decision-making problems under cubic intuitionistic fuzzy set environment. Comput. Appl. Math. 2019, 38, 1–19. [Google Scholar] [CrossRef]
  71. Kamaci, H.; Petchimuthu, S.; Akçetin, E. Dynamic aggregation operators and Einstein operations based on interval-valued picture hesitant fuzzy information and their applications in multi-period decision making. Comput. Appl. Math. 2021, 40, 1–52. [Google Scholar] [CrossRef]
  72. Deepak, D.; Mathew, B.; John, S.J.; Garg, H. A topological structure involving hesitant fuzzy sets. J. Intell. Fuzzy Syst. 2019, 36, 6401–6412. [Google Scholar] [CrossRef]
  73. Tanay, B.; Kandemir, M.B. Topological structure of fuzzy soft sets. Comput. Math. Appl. 2011, 61, 2952–2957. [Google Scholar] [CrossRef] [Green Version]
  74. Riaz, M.; Davvaz, B.; Fakhar, A.; Firdous, A. Hesitant fuzzy soft topology and its applications to multi-attribute group decision-making. Soft Comput. 2020, 24, 16269–16289. [Google Scholar] [CrossRef]
  75. Hashmi, M.R.; Riaz, M.; Smarandache, F. m-Polar neutrosophic topology with applications to multi-criteria decision-making in medical diagnosis and clustering analysis. Int. J. Fuzzy Syst. 2020, 22, 273–292. [Google Scholar] [CrossRef]
  76. Duponchel, L. When remote sensing meets topological data analysis. J. Spectr. Imaging 2018, 7, 1–10. [Google Scholar] [CrossRef] [Green Version]
  77. Xuan, Q.; Du, F.; Li, Y.; Wu, T.J. A framework to model the topological structure of supply networks. IEEE Trans. Autom. Sci. Eng. 2010, 8, 442–446. [Google Scholar] [CrossRef]
Figure 1. A summary of the stages of heart failure.
Figure 1. A summary of the stages of heart failure.
Symmetry 14 00865 g001
Figure 2. Comparative bar chart of ranking of patients.
Figure 2. Comparative bar chart of ranking of patients.
Symmetry 14 00865 g002
Table 1. Some rudimentary concepts of hesitant fuzzy sets.
Table 1. Some rudimentary concepts of hesitant fuzzy sets.
HFS ModelsApplications
HFSs (Torra [15,16])Operational laws of HFSs
Interval-valued hesitant fuzzy set
(Chen et al. [17])
IVHF clustring algorithm
Information measures for HFSs and IVHFSs (Farhadinia [18])Entropy, similarity measures, clustering
HF information aggregation (Xia and Xu [19])Development of large project (strategy initiatives)
Generalized HFSs (Qian et al. [20])Adopting an information system to stimulate university work productivity
Table 2. Some applications based on hesitant fuzzy sets.
Table 2. Some applications based on hesitant fuzzy sets.
HFS ModelsApplications
IVH preference relations (Chen et al. [29])Supply chain management
IHFSs (Beg and Rashid [30])Funds allocation to schools based on their performance
IVIHF aggregation (Zhang [31])Site selection for factory buildings
IHFSs (Chen et al. [32])Distance and similarity measures; recommendation of movies
PHFSs (Khan et al. [33])Investment problem
PHF information aggregation (Khan et al. [34])Selection of air-conditioning system
IVPHFS (Zhang et al. [35])Site selection for company buildings
HFSSs (Babitha and John [36])Problem of job allocation
HFSSs (Wang et al. [37])Site selection for opening new store in a city
HFSSs (Wang et al. [38])Selection of attractive house
CHFSs (Mahmood et al. [39])Calculation of performance for different imaging techniques used to detect female breast cancer
Priority degrees for HFSs (Lan et al. [40])Evaluation of nemerous engines
Type-2 HFSs (Feng et al. [41])Dealing with fact problems
D-IHFSs (Li and Chen [42])Selection of a car
PiHFS (Wang and Li [43])Construction of an enterprise resource planning (ERP) system
Probabilistic IVHF (Zhang et al. [44])Intelligent transportation system evaluation
m-Polar HFS (Akram et al. [45])Selection of a perfect brand name
HF parameterized (Karaaslan and Karamaz [46])Investment in one of six firms in a company and selection of computers
Table 3. Some applications of TOPSIS method.
Table 3. Some applications of TOPSIS method.
ModelsApplications
Crisp-TOPSIS (Hwang and Yoon [47])Fighter aircraft problem
Fuzzy-TOPSIS (Chen [48])To hire a system analysis engineer
IF-TOPSIS (Rouyendegh et al. [49])Green supplier selection problem
BF-TOPSIS (Akram et al. [50])Skin disorder diagnosis
FSS-TOPSIS (Eraslan and Karaaslan [51])House selection priorities
IFSS-TOPSIS (Garg and Arora [52])Outsourcing supplier selection
Linguistic PFSs (Lin et al. [53])Firewall production selection
Extended PF-TOPSIS (Rani et al. [54])Partner selection for sustainable recycling
PF-TOPSIS (Lin et al. [55])Inpatient stroke rehabilitation
q-ROF TOPSIS (Alkan and Kahraman [56])Government methods to tackle the COVID-19 pandemic
Interval neutrosophic TOPSIS (Dung et al. [57])Personnel selection
Generalized NSS-TOPSIS (Saqlain et al. [58])Smartphone selection
SF-TOPSIS (Kahraman et al. [59])Selection of hospital location
PmpF (Naeem et al. [60])Selection of advertisement mode
HFS-TOPSIS (Senvar et al. [61])Hospital site selection
PF-TOPSIS (Zhang and Xu [62])MCDM based on PFSs to examine efficiency among domestic airlines
HFS-TOPSIS (Xu and Zhang [63])MCDM based on HFSs to discuss energy policy selection
Table 4. P-union of CHFSs.
Table 4. P-union of CHFSs.
P-Union 0 V H ^ 1 H ^ 2 1 V
0 V 0 V H ^ 1 H ^ 2 1 V
H ^ 1 H ^ 1 H ^ 1 H ^ 2 1 V
H ^ 2 H ^ 2 H ^ 2 H ^ 2 1 V
1 V 1 V 1 V 1 V 1 V
Table 5. P-intersection of CHFSs.
Table 5. P-intersection of CHFSs.
P-Intersection 0 V H ^ 1 H ^ 2 1 V
0 V 0 V 0 V 0 V 0 V
H ^ 1 0 V H ^ 1 H ^ 1 H ^ 1
H ^ 2 0 V H ^ 1 H ^ 2 H ^ 2
1 V 0 V H ^ 1 H ^ 2 1 V
Table 6. R-union of CHFSs.
Table 6. R-union of CHFSs.
R-Union 0 ¯ V H ^ 1 H ^ 2 1 ¯ V
0 ¯ V 0 ¯ V H ^ 1 H ^ 2 1 V
H ^ 1 H ^ 1 H ^ 1 H ^ 2 1 ¯ V
H ^ 2 H ^ 2 H ^ 2 H ^ 2 1 ¯ V
1 V 1 ¯ V 1 ¯ V 1 ¯ V 1 ¯ V
Table 7. R-intersection of CHFSs.
Table 7. R-intersection of CHFSs.
R-Intersection 0 ¯ V H ^ 1 H ^ 2 1 ¯ V
0 V 0 ¯ V 0 ¯ V 0 ¯ V 0 ¯ V
H ^ 1 0 ¯ V H ^ 1 H ^ 1 H ^ 1
H ^ 2 0 ¯ V H ^ 1 H ^ 2 H ^ 2
1 ¯ V 0 ¯ V H ^ 1 H ^ 2 1 ¯ V
Table 8. R-union of CHFSs.
Table 8. R-union of CHFSs.
R-Union 0 ¯ V H ^ 1 H ^ 2 H ^ 3 H ^ 4 H ^ 5 1 ¯ V
0 ¯ V 0 ¯ V H 1 H ^ 2 H ^ 3 H ^ 4 H ^ 5 1 ¯ V
H ^ 1 H ^ 3 H ^ 1 H ^ 1 H ^ 3 H ^ 4 H ^ 1 1 ¯ V
H ^ 2 H ^ 3 H ^ 1 H ^ 2 H ^ 3 1 ¯ V H ^ 1 1 ¯ V
H ^ 3 H ^ 3 H ^ 3 H ^ 3 H ^ 3 1 ¯ V H ^ 3 1 ¯ V
H ^ 4 H ^ 4 H ^ 4 H ^ 4 1 ¯ V H 4 ^ H ^ 4 1 ¯ V
H ^ 5 H ^ 5 H ^ 1 H ^ 1 H 3 ^ H 4 ^ H ^ 5 1 ¯ V
1 ¯ V 1 ¯ V 1 ¯ V 1 ¯ V 1 ¯ V 1 ¯ V 1 ¯ V 1 ¯ V
Table 9. R-intersection of CHFSs.
Table 9. R-intersection of CHFSs.
R-Intersection 0 ¯ V H ^ 1 H ^ 2 H ^ 3 H ^ 4 H ^ 5 1 ¯ V
0 ¯ V 0 ¯ V 0 ¯ V 0 ¯ V 0 ¯ V 0 ¯ V 0 ¯ V 0 ¯ V
H ^ 1 0 ¯ V H ^ 1 H ^ 2 H ^ 1 H ^ 1 H ^ 5 H ^ 1
H ^ 2 0 ¯ V H ^ 2 H ^ 2 H ^ 2 H ^ 2 0 ¯ V H ^ 2
H ^ 3 0 ¯ V H ^ 1 H ^ 2 H ^ 3 H ^ 1 H ^ 5 H ^ 3
H ^ 4 0 ¯ V H 1 ^ H ^ 2 H ^ 1 H ^ 4 H ^ 5 H 4 ^
H ^ 5 0 ¯ V H 5 ^ 0 ¯ V H ^ 5 H ^ 5 H 5 ^ H ^ 5
1 ¯ V 0 ¯ V H ^ 1 H ^ 2 H ^ 3 H ^ 4 H ^ 5 1 ¯ V
Table 10. Types of heart failure.
Table 10. Types of heart failure.
Types of Heart FailureDescription
Systolic heart failureLeft ventricle is unable to eject blood forcefully, indicating a pumping issue
Right-sided heart failureSwelling can result from fluid backing up into the abdomen, legs and feet
Left-sided heart failureShortness of breath may occur due to fluid buildup in the lungs
Preserved ejection fraction heart failureLeft ventricle is unable to relax or fill completely, indicating a filling issue
Table 11. Dialectal/linguistic variables and fuzzy weights of the stages.
Table 11. Dialectal/linguistic variables and fuzzy weights of the stages.
Dialectal/Linguistic VariablesFuzzy Weights
Stage A: Healthy heart (SA) 0.100
Stage B: Silent heart failure (SB) 0.300
Stage C: Moderate heart failure (SC) 0.600
Stage D: Severe heart failure (SD) 0.900
Table 12. Tabular representation of D 1 .
Table 12. Tabular representation of D 1 .
D 1 e 1
κ 1 θ { [ 0.144 , 0.305 ] } , { 0.125 }
κ 2 θ { [ 0.243 , 0.504 ] , [ 0.155 , 0.445 ] } , { 0.217 , 0.312 }
κ 3 θ { [ 0.215 , 0.600 ] , [ 0.372 , 0.555 ] } , { 0.311 , 0.265 }
κ 4 θ { [ 0.400 , 0.705 ] , [ 0.450 , 0.869 ] , [ 0.432 , 0.982 ] } , { 0.400 , 0.355 , 0.268 }
D 1 e 2
κ 1 θ { [ 0.293 , 0.708 ] } , { 0.495 }
κ 2 θ { [ 0.356 , 0.498 ] , [ 0.258 , 0.863 ] } , { 0.300 , 0.155 }
κ 3 θ { [ 0.250 , 0.576 ] , [ 0.498 , 0.620 ] } , { 0.111 , 0.220 }
κ 4 θ { [ 0.652 , 0.718 ] , [ 0.556 , 0.665 ] , [ 0.444 , 0.838 ] } , { 0.514 , 0.468 , 0.548 }
D 1 e 3
κ 1 θ { [ 0.316 , 0.462 ] { 0.462 }
κ 2 θ { [ 0.415 , 0.683 ] , [ 0.456 , 0.658 ] } , { 0.450 , 0.500 }
κ 3 θ { [ 0.591 , 0.693 ] , [ 0.300 , 0.700 ] } , { 0.405 , 0.384 }
κ 4 θ { [ 0.433 , 0.500 ] , [ 0.212 , 0.821 ] , [ 0.537 , 0.550 ] } , { 0.315 , 0.239 , 0.350 }
D 1 e 4
κ 1 θ { { [ 0.111 , 0.359 ] } , { 0.232 }
κ 2 θ { { [ 0.252 , 0.443 ] , [ 0.398 , 0.493 ] } , { 0.306 , 0.203 }
κ 3 θ { { [ 0.496 , 0.946 ] , [ 0.511 , 0.822 ] } , { 0.505 , 0.460 }
κ 4 θ { { [ 0.182 , 0.698 ] , [ 0.232 , 0.875 ] , [ 0.213 , 0.423 ] } , { 0.409 , 0.350 , 0.343 }
Table 13. Tabular representation of D 2 .
Table 13. Tabular representation of D 2 .
D 2 e 1
κ 1 θ { [ 0.201 , 0.332 ] } , { 0.200 }
κ 2 θ { [ 0.275 , 0.580 ] , [ 0.165 , 0.505 ] } , { 0.321 , 0.375 }
κ 3 θ { [ 0.288 , 0.650 ] , [ 0.400 , 0.600 ] } , { 0.350 , 0.610 }
κ 4 θ { [ 0.455 , 0.800 ] , [ 0.555 , 0.900 ] , [ 0.705 , 0.991 ] } , { 0.400 , 0.400 , 0.675 }
D 2 e 2
κ 1 θ { [ 0.300 , 0.755 ] } , { 0.615 }
κ 2 θ { [ 0.405 , 0.558 ] , [ 0.300 , 0.980 ] } , { 0.355 , 0.875 }
κ 3 θ { [ 0.320 , 0.630 ] , [ 0.500 , 0.852 ] } , { 0.222 , 0.702 }
κ 4 θ { [ 0.655 , 0.817 ] , [ 0.656 , 0.865 ] , [ 0.515 , 0.883 ] } , { 0.550 , 0.665 , 0.730 }
D 2 e 3
κ 1 θ { [ 0.396 , 0.500 ] } , { 0.500 }
κ 2 θ { [ 0.451 , 0.863 ] , [ 0.546 , 0.856 ] } , { 0.503 , 0.565 }
κ 3 θ { [ 0.600 , 0.700 ] , [ 0.400 , 0.900 ] } , { 0.450 , 0.540 }
κ 4 θ { [ 0.435 , 0.550 ] , [ 0.612 , 0.851 ] , [ 0.559 , 0.742 ] } , { 0.351 , 0.539 , 0.565 }
D 2 e 4
κ 1 θ { [ 0.333 , 0.359 ] } , { 0.322 }
κ 2 θ { [ 0.300 , 0.450 ] , [ 0.400 , 0.650 ] } , { 0.362 , 0.632 }
κ 3 θ { [ 0.500 , 0.950 ] , [ 0.555 , 0.855 ] } , { 0.508 , 0.687 }
κ 4 θ { [ 0.594 , 0.700 ] , [ 0.645 , 0.900 ] , [ 0.265 , 0.474 ] } , { 0.710 , 0.800 , 0.434 }
Table 14. Tabular representation of D 3 .
Table 14. Tabular representation of D 3 .
D 3 e 1
κ 1 θ { [ 0.000 , 0.000 ] } , { 0.000 }
κ 2 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 }
κ 3 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 }
κ 4 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 , 0.000 }
D 3 e 2
κ 1 θ { [ 0.000 , 0.000 ] } , { 0.000 }
κ 2 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 }
κ 3 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 }
κ 4 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 , 0.000 }
D 3 e 3
κ 1 θ { [ 0.000 , 0.000 ] } , { 0.000 }
κ 2 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 }
κ 3 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 }
κ 4 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 , 0.000 }
D 3 e 4
κ 1 θ { [ 0.000 , 0.000 ] } , { 0.000 }
κ 2 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 }
κ 3 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 }
κ 4 θ { [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] , [ 0.000 , 0.000 ] } , { 0.000 , 0.000 , 0.000 }
Table 15. Tabular representation of D 4 .
Table 15. Tabular representation of D 4 .
D 4 e 1
κ 1 θ { [ 1.000 , 1.000 ] } , { 1.000 }
κ 2 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 }
κ 3 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 }
κ 4 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 , 1.000 }
D 4 e 2
κ 1 θ { [ 1.000 , 1.000 ] } , { 1.000 }
κ 2 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 }
κ 3 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 }
κ 4 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 , 1.000 }
D 4 e 3
κ 1 θ { [ 1.000 , 1.000 ] } , { 1.000 }
κ 2 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 }
κ 3 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 }
κ 4 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 , 1.000 }
D 4 e 4
κ 1 θ { [ 1.000 , 1.000 ] } , { 1.000 }
κ 2 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 }
κ 3 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 }
κ 4 θ { [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] , [ 1.000 , 1.000 ] } , { 1.000 , 1.000 , 1.000 }
Table 16. Tabular representation of aggregation matrix A.
Table 16. Tabular representation of aggregation matrix A.
A e 1
κ 1 θ { [ 0.336 , 0.409 ] } , { 0.331 }
κ 2 θ { [ 0.379 , 0.521 ] , [ 0.330 , 0.486 ] } , { 0.385 , 0.422 }
κ 3 θ { [ 0.376 , 0.563 ] , [ 0.443 , 0.539 ] } , { 0.415 , 0.469 }
κ 4 θ { [ 0.464 , 0.626 ] , [ 0.276 , 0.692 ] , [ 0.534 , 0.743 ] } , { 0.450 , 0.439 , 0.486 }
A e 2
κ 1 θ { [ 0.398 , 0.616 ] } , { 0.528 }
κ 2 θ { [ 0.440 , 0.514 ] , [ 0.390 , 0.711 ] } , { 0.414 , 0.508 }
κ 3 θ { [ 0.393 , 0.552 ] , [ 0.500 , 0.618 ] } , { 0.333 , 0.481 }
κ 4 θ { [ 0.577 , 0.634 ] , [ 0.553 , 0.633 ] , [ 0.490 , 0.680 ] } , { 0.516 , 0.533 , 0.570 }
A e 3
κ 1 θ { [ 0.428 , 0.491 ] } , { 0.491 }
κ 2 θ { [ 0.467 , 0.637 ] , [ 0.501 , 0.629 ] } , { 0.488 , 0.516 }
κ 3 θ { [ 0.548 , 0.598 ] , [ 0.425 , 0.650 ] } , { 0.464 , 0.481 }
κ 4 θ { [ 0.467 , 0.513 ] , [ 0.456 , 0.668 ] , [ 0.524 , 0.576 ] } , { 0.417 , 0.445 , 0.479 }
A e 4
κ 1 θ { [ 0.361 , 0.430 ] } , { 0.389 }
κ 2 θ { [ 0.388 , 0.473 ] , [ 0.450 , 0.536 ] } , { 0.417 , 0.459 }
κ 3 θ { [ 0.499 , 0.724 ] , [ 0.517 , 0.670 ] } , { 0.503 , 0.537 }
κ 4 θ { [ 0.444 , 0.600 ] , [ 0.469 , 0.694 ] , [ 0.370 , 0.474 ] } , { 0.530 , 0.538 , 0.444 }
Table 17. Tabular representation of weighted CHF matrix B.
Table 17. Tabular representation of weighted CHF matrix B.
B e 1
κ 1 θ { [ 0.090 , 0.115 ] } , { 0.773 }
κ 2 θ { [ 0.105 , 0.158 ] , [ 0.089 , 0.144 ] } , { 0.801 , 0.818 }
κ 3 θ { [ 0.104 , 0.175 ] , [ 0.127 , 0.165 ] } , { 0.815 , 0.838 }
κ 4 θ { [ 0.135 , 0.205 ] , [ 0.072 , 0.240 ] , [ 0.163 , 0.271 ] } , { 0.830 , 0.825 , 0.845 }
B e 2
κ 1 θ { [ 0.118 , 0.211 ] } , { 0.854 }
κ 2 θ { [ 0.134 , 0.164 ] , [ 0.115 , 0.265 ] } , { 0.804 , 0.845 }
κ 3 θ { [ 0.116 , 0.181 ] , [ 0.158 , 0.212 ] } , { 0.761 , 0.834 }
κ 4 θ { [ 0.192 , 0.221 ] , [ 0.181 , 0.220 ] , [ 0.154 , 0.246 ] } , { 0.849 , 0.856 , 0.870 }
B e 3
κ 1 θ { [ 0.135 , 0.161 ] } , { 0.831
κ 2 θ { [ 0.151 , 0.232 ] , [ 0.165 , 0.227 ] } , { 0.830 , 0.842 }
κ 3 θ { [ 0.187 , 0.211 ] , [ 0.134 , 0.239 ] } , { 0.819 , 0.827 }
κ 4 θ { [ 0.151 , 0.171 ] , [ 0.146 , 0.249 ] , [ 0.176 , 0.200 ] } , { 0.797 , 0.810 , 0.826 }
B e 4
κ 1 θ { [ 0.110 , 0.135 ] } , { 0.783 }
κ 2 θ { [ 0.119 , 0.153 ] , [ 0.143 , 0.180 ] } , { 0.797 , 0.817 }
κ 3 θ { [ 0.164 , 0.284 ] , [ 0.172 , 0.250 ] } , { 0.837 , 0.851 }
κ 4 θ { [ 0.141 , 0.211 ] , [ 0.151 , 0.264 ] , [ 0.113 , 0.152 ] } , { 0.848 , 0.852 , 0.810 }
Table 18. Distance and coefficient of relative closeness.
Table 18. Distance and coefficient of relative closeness.
V ξ i + ξ i i
κ 1 θ 0.348 0.273 0.440
κ 2 θ 0.364 0.281 0.435
κ 3 θ 0.269 0.289 0.518
κ 4 θ 0.313 0.455 0.592
Table 19. The decision table of D 1 .
Table 19. The decision table of D 1 .
d i 1 Values
d 1 1 0.002
d 2 1 0.098
d 3 1 0.213
d 4 1 0.248
Table 20. The decision table of D 2 .
Table 20. The decision table of D 2 .
d i 2 Values
d 1 2 0.102
d 2 2 0.267
d 3 2 0.361
d 4 2 0.456
Table 21. The aggregated decision table.
Table 21. The aggregated decision table.
Patients d i 1 + d i 2 Values
κ 1 θ d 1 1 + d 1 2 0.103
κ 2 θ d 2 1 + d 2 2 0.365
κ 3 θ d 3 1 + d 3 2 0.573
κ 4 θ d 4 1 + d 4 2 0.704
Table 22. Comparative analysis of Algorithms 1 and 2.
Table 22. Comparative analysis of Algorithms 1 and 2.
MethodAlternatives with RankingBest Alternative
m-Polar hesitant fuzzy TOPSIS [45] κ 4 θ κ 3 θ κ 1 θ κ 2 θ κ 4 θ
Fuzzy soft TOPSIS [51] κ 4 θ κ 3 θ κ 1 θ κ 2 θ κ 4 θ
Fuzzy soft TOPSIS [52] κ 4 θ κ 3 θ κ 1 θ κ 2 θ κ 4 θ
HF TOPSIS [63] κ 4 θ κ 3 θ κ 1 θ κ 2 θ κ 4 θ
Algorithm 1 (TOPSIS) κ 4 θ κ 3 θ κ 1 θ κ 2 θ κ 4 θ
Algorithm 2 (CHF topology) κ 4 θ κ 3 θ κ 2 θ κ 1 θ κ 4 θ
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Riaz, M.; Batool, S.; Almalki, Y.; Ahmad, D. Topological Data Analysis with Cubic Hesitant Fuzzy TOPSIS Approach. Symmetry 2022, 14, 865. https://doi.org/10.3390/sym14050865

AMA Style

Riaz M, Batool S, Almalki Y, Ahmad D. Topological Data Analysis with Cubic Hesitant Fuzzy TOPSIS Approach. Symmetry. 2022; 14(5):865. https://doi.org/10.3390/sym14050865

Chicago/Turabian Style

Riaz, Muhammad, Sania Batool, Yahya Almalki, and Daud Ahmad. 2022. "Topological Data Analysis with Cubic Hesitant Fuzzy TOPSIS Approach" Symmetry 14, no. 5: 865. https://doi.org/10.3390/sym14050865

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