Abstract
From the hybrid nature of cubic sets, we develop a new generalized hybrid structure of cubic sets known as cubic vague sets (CVSs). We also define the concept of internal cubic vague sets (ICVSs) and external cubic vague sets (ECVSs) with examples and discuss their interesting properties, including ICVSs and ECVSs under both P and R-Order. Moreover, we prove that the R and R-intersection of ICVSs (or ECVSs) need not be an ICVS (or ECVS). We also derive the different conditions for P-union (P-intersection, R and R-intersection) operations of both ICVSs (ECVSs) to become an ICVS (ECVS). Finally, we introduce a decision-making based on the proposed similarity measure of the CVSs domain and a numerical example is given to elucidate that the proposed similarity measure of CVSs is an important concept for measuring entropy in the information/data. It will be shown that the cubic vague set has the novelty to accurately represent and model two-dimensional information for real-life phenomena that are periodic in nature.
Keywords: cubic set, external cubic, fuzzy set, internal cubic, interval-valued, periodic, similarity measure, vague set
1. Introduction
In order to transact with several complicated problems involving uncertainties in many fields such as engineering, economics, social and medical sciences, classical methods are found to be inadequate. In 1965, Zadeh [1] presented fuzzy sets which helped to handle uncertainty and imprecision. Fuzzy sets had since been applied in many directions especially in decision making such as multi fuzzy sets [2], complex multi fuzzy sets [3,4,5,6,7], vague soft set [8,9,10,11], multiparameterized soft set [12], multi Q-fuzzy soft matrix [13] and intuitionistic fuzzy sets [14].
In fuzzy set theory, the grade of membership of an object to a fuzzy set indicates the belongingness degree of the object to the fuzzy set, which is a point (single) value selected from the unit interval [0, 1]. In real life scenarios, a person may consider that an element belongs to a fuzzy set, but it is possible that person is not sure about it. Therefore, hesitation or uncertainty may exist in which the element can belong to the fuzzy set or not. The traditional fuzzy set is unable to capture this type of hesitation or uncertainty using only the single membership degrees. A possible solution is to use an intuitionistic fuzzy set [14] or a vague set [15] to handle this problem. The vague set [15] is an extension of fuzzy sets and regarded as a special case of context-dependent fuzzy set which has the ability to overcome the problems faced when using fuzzy sets by providing us with an interval-based membership which clearly separates the evidence for and against an element.
From the above existing literature, we can see that those studies mainly focus on the fuzzy set, interval fuzzy set, vague set and their entropies [16,17,18]. Later on, Jun et al. [19] gave the idea of cubic set and it was characterized by interval valued fuzzy set and fuzzy set, which is a more general tool to capture uncertainty and vagueness, since fuzzy set deals with single-value membership while interval valued fuzzy set ranges the membership in the form of intervals. They presented the ideas of internal and external cubic sets and their characteristics. The hybrid platform provided by a cubic set has the main advantage since it contains more information than a fuzzy set and an interval-valued fuzzy set. By using this concept, different problems arising in several areas can be solved by means of cubic sets as in the works of Rashid et al. [20], Ma et al. [21], Khan et al. [22], Jun et al. [23,24], Gulistan et al. [25], Khaleed et al. [26], Fu et al. [27] and Ashraf et al. [28].
As for the Pythagorean fuzzy set (PFS) and its generalizations, an entropy measure was defined by Yang and Hussein [29]. Thao and Smarandache [30] proposed a new entropy measure for Pythagorean fuzzy which discarded the use of natural logarithm, while Wang and Li [31] introduced Pythagorean fuzzy interaction power Bonferroni mean aggregation operators in multiple attribute decision making.
Vague sets have a more powerful ability than fuzzy sets to process fuzzy information to some degree. Human cognition is usually a gradual process. As a result, how to characterize a vague concept and further measure its uncertainty becomes an interesting issue worth studying. Nevertheless, the concept of simple vague set is insufficient to provide the information about the occurrence of ratings or grades with accuracy because information is limited, and it is also unable to describe the occurrence of uncertainty and vagueness well enough, when sensitive cases are involved in decision making problems. Hence, there is a pertinent need for us to introduce the novel concept of cubic vague set (CVS) by incorporating both the ideas of cubic set and vague set. The aim of this model to introduce the notion of cubic vague set by extending the range of the truth-membership function and the false-membership function from a subinterval of [0, 1] to the interval-based membership structure that allows users to record their hesitancy in assigning membership values. This feature and its ability to represent two-dimensional information makes it ideal to be used to handle uncertain and subjective information that are prevalent in most time-periodic phenomena in the real world. These reasons served as the motivation to choose the cubic vague set model and use it in decision making problem.
The contribution of the novel cubic vague set (CVS) in the decision making process is its ability to handle uncertainties, imprecise and vagueness information considering both the truth-membership and falsity-membership values, whereas cubic set can only process the uncertainties information without able to take into account the truth-membership and falsity-membership values. The core advantage of using CVS against CS will be illustrated by an example. Hence, this concept of cubic vague set (CVS) will further enrich the use of various fuzzy methods in decision making such as those current trends which include group decision making using complex q-rung orthopair fuzzy Bonferroni mean [32], air pollution model using neutrosophic cubic Einstein averaging operators [33] and medicine preparation using neutrosophic bipolar fuzzy set [34].
The flow of our research is as follows. Firstly, we examine the concept of cubic vague set (CVS), which is a hybrid of vague set and cubic set. Secondly, we define some concepts related to the notion of CVS as well as some basic operations namely internal cubic vague sets (ICVSs) and external cubic vague sets (ECVSs). The CVS will be used together with a generalized algorithm to determine the similarity measures between two CVSs for a pattern recognition problem. Finally, a numerical example is given to elucidate that the proposed similarity measure of CVS is an important concept for measuring the entropy of uncertain information.
The organization of the paper will be as follows. Fundamentals of vague set, cubic set and interval-valued vague set are presented in Section 2. In Section 3, the concept of a cubic vague set with P- and R-union and P- and R-intersection for CVSs, with various properties are introduced. In Section 4, the similarity measure between CVSs is shown, along with an illustrative example studied, followed by the conclusion in Section 5.
2. Preliminaries
In this section we now state certain useful definitions, properties and several existing results for vague sets and cubic sets that will be useful for our discussion in the next sections.
The notion of vague set theory was first introduced by Gau and Buehrer in 1993 [15] as an extension of fuzzy sets. It is an improvement to deal with the vagueness of problems involving complex data with a high level of uncertainty and imprecision. Some of the basic concepts are as follows:
Definition 1.
(See [15]) A vague set A (VS) in the universe of discourse U is a characterized by two membership functions given by:
- 1.
A truth membership functionand
- 2.
a false membership functionwhere is a lower bound of the grade of membership of u derived from the “evidence for u", and is a lower bound of the negation of u derived from the “evidence against u" and
Thus, the grade of membership of u in the vague set A is bounded by a sub interval of . This indicates that if the actual grade of membership is , then
The vague set A is written as
where the interval is called “vague value" of u in A and denoted by .
Definition 2.
(See [15]) The complement of a vague set A is denoted by and is defined by and
Definition 3.
(See [15]) The intersection of two VSs A and B are a VS C, written as , whose truth and false-membership functions for A and B by and
Definition 4.
(See [15]) The union of two VSs A and B are a VS C, written as , whose truth and false-membership for A and B by and
Jun et al. [19] introduced the concept of a cubic set, as a novel hybrid structure of an interval-valued fuzzy set (IVFS) and a fuzzy set.
Definition 5.
(See [19]) Let X be a non-empty set. A structure
be a cubic set in X in which A is an IVFS and λ is a fuzzy set in X.
We will now introduce the concept of the interval-valued vague set to handle uncertainty of information, the grade of membership and the negation of x.
Definition 6.
(See [15]) Let X be the universe of discourse, denotes the set of all closed subintervals of . An interval valued vague set (IVVS) in X is a structure
where and are truth-membership function and false-membership function of x concerning , respectively. , and denote the lower and upper bound of the grade of membership of x derived from “the evidence for x”, respectively. Similarly, , and denote, respectively, the lower and upper bound of the negation of x derived from “the evidence against x”, and .
3. Cubic Vague Sets
In this section, we will define the concept of a cubic vague set (CVS) and internal/external cubic vague sets.
Definition 7.
Let X be a universal set. A cubic vague set defined over the universal set X is an ordered pair which is defined as follows
where represents IVVS defined on X while represents VS such that and . For clarity, we denote the pairs as , where and . denotes the sets of all cubic vague sets in X.
Example 1.
Let be a universe set. Suppose an IVVS in X is defined by
and a VS is a set of X is defined by
Then the cubic vague set will have the tabular representation as in Table 1.
Table 1.
Cubic vague set .
| X | ||
|---|---|---|
| a | (0.5, 0.7) | |
| b | (0.1, 0.3) |
Definition 8.
Let X be a universal set and V be a non-empty vague set. A cubic vague set is called an internal cubic vague set (brief. ICVS) if for all .
Definition 9.
Let X be a universal set and V be a non-empty vague set. A cubic vague set is called an external cubic vague set (brief. ECVS) if for all .
Remark 1.
Let X be a universal set and V be a non-empty set. A cubic vague set is said to be neither ICVS nor ECVS if and for all .
Example 2.
Let be a cubic vague set in X. If and for all , then is an ICVS. If and , , then is an ECVS. If and , , then is not an ICVS or an ECVS.
Theorem 1.
Let is be a CVS in X which is not an ECVS. Then s.t .
Proof.
Straightforward. □
Theorem 2.
Let is a CVS in X. If is an ICVS and ECVS, then
where
Proof.
Suppose that is an ICVS and ECVS. By using Definition 8 and Definition 9, we get and . Thus, or , and so . □
Definition 10.
Let and be two cubic vague sets in X and V. Then we have
- 1.
(Equality) and .
- 2.
(P-order) and .
- 3.
(R-order) and .
Definition 11.
The complement of is defined to be the cubic vague set , where and is the vague complement and .
Definition 12.
Let and be two cubic vague sets in X and V. Then we have
- 1.
(P-union).
- 2.
(P-intersection).
- 3.
(R-union).
- 4.
(R-intersection).
- 5.
(P-AND).
- 6.
(P-OR).
- 7.
(R-AND).
- 8.
(R-OR).
Theorem 3.
Let be a CVS in X. If is ICVS (resp. ECVS), then is also an ICVS (resp. ECVS).
Proof.
Since is also an ICVS (resp. ECVS) in X, we have (resp. ) for all . That means
(resp. ). Thus,
is an ICVS (resp. ECVS) in X. □
Theorem 4.
Let be a group of ICVSs in X. Then the P-union and intersection of are ICVSs in X.
Proof.
Since is an ICVS in X, we have for . That means
and
Hence and are ICVSs in X. □
The following example shows that the P-union and P-intersection of two ECVSs need not be an ECVS.
Example 3.
Let and be two ECVSs in X such that and , and .
- 1.
Note that and . Then is not an ECVS in I.
- 2.
Note that and . Then is not an ECVS in I.
The example below shows that the R-union and intersection of two ICVSs need not be an ICVS.
Example 4.
Let and be ICVSs in in which , , and for all .
- 1.
Note that and . Then is not an ICVS in I.
- 2.
Note that and . Then is not an ICVS in I.
The example below will show that the R-union and intersection of two ECVSs may not necessarily be an ECVS.
Example 5.
- 1.
Let and be ECVSs in whereas , , and . Since and . Then is not an ECVS in I.
- 2.
Let and be ECVSs in whereas , , and for all . Since and . Then is not an ECVS in I.
We give a condition of a R-union of two ICVSs to become an ICVS.
Theorem 5.
Let and be two ICVSs in X such that
. Then the R-union ofandis an ICVS in X.
Proof.
Let and be two ICVSs in X which satisfy the condition of Definition 7. Then and which means . Now apply the condition of Definition 7 that is so that is an ICVS in X. □
We give a condition of a R-intersection of two ICVSs to become an ICVS.
Theorem 6.
Let and be two ICVSs in X satisfying . Then the R-intersection of and is an IVCS in X.
Proof.
Let and be ICVSs in X which satisfy the condition of Definition 1. Then and so . Now apply the condition of Definition 1 we get and therefore is an ICVS in X. □
Given two CVSs and . Suppose we exchange the for in the two CVSs and we denote the CVSs and , respectively. Then, for to ECVSs and in X, two cubic vague sets and may not be ICVSs in X as shown in the example below.
Example 6.
- 1.
Let and be two EVCSs in in which , , and . Thus, and are not ICVSs in X since and .
- 2.
Let be a set. Let and be ECVSs in X defined by Table 2. Thus, and are not ICVSs in X since and .
Table 2.
VCSs and .
| X | X | ||||
|---|---|---|---|---|---|
| l | (0.1, 0.7) | l | (0.9, 0.9) | ||
| m | (0.7, 0.8) | m | (0.8, 0.9) |
We give an example to show that the P-union of two ECVSs in X does not necessarily become an ICVS in X.
Example 7.
Let be a set. Let and be two ECVSs in X defined by Table 3. Then we will have is not an ICVS in X since
Table 3.
VCSs and .
| X | X | ||||
|---|---|---|---|---|---|
| k | (0.5, 0.7) | k | (0.35, 0.45) | ||
| l | (0.1, 0.5) | l | (0.3, 0.35) | ||
| m | (0.4, 0.6) | m | (0.2, 0.9) |
We give a condition for P-union of two ECVSs to become an ICVS.
Theorem 7.
For two ECVSs and in X, if and are IVCSs in X, then the P-union of and is an ICVS in X.
Proof.
Let and be an ECVSs in X such that and are ICVSs in X. Then , , and for all . Now, for a given , we consider the cases:
and .
and .
and .
and .
We will illustrate the proof of the first case only because proofs of the remaining three cases are similar. Now, we get . Since and are ICVSs in X, we have and . It follows that
(1) Hence is an ICVS in X. □
We give the condition of a P-intersection of two ECVSs to become an ICVS.
Theorem 8.
Let and be CVSs in X such that and are ICVSs in X. Then the P-intersection of and is an ICVS in X.
Proof.
The proof is similar to that of Theorem 7. □
For two ECVSs and in X, two CVSs and may not be ECVSs as shown in the following example.
Example 8.
Let be a set. Let and be ECVSs in X given in Table 4. Thus, and are not ECVSs in X since and .
Table 4.
CVSs and .
| X | X | ||||
|---|---|---|---|---|---|
| l | (0.6, 0.7) | l | (0.2, 0.3) | ||
| m | (0.2, 0.2) | m | (0.4, 0.5) |
Theorem 9.
Let and be two ECVSs in X such that and are ECVSs in X. Thus, the P-union and is an ECVS in X.
Proof.
For each , we get , , and
which means . Then is an ECVS in X. □
We have given an example that shows the P-intersection for two ECVSs may not become an ECVS as in Example 3. Now we will add a condition for the P-itersection of two ECVSs to be an ECVS by using Definition 2.
Theorem 10.
Let and be two ECVSs in X such that ≥. Thus, the P-intersection and is an ECVS in X.
Proof.
For each , substitute
and
Then which is one of the and . We consider or only since the proof of the other cases are similar.
If , thus
and so . Then thus .
If , thus and so . Suppose that, . Thus, then we get
or
of the case . This is the contradiction to and are ECVSs in X. For the case
we get because .
Suppose that, . Thus,
then we get
or
of the case . This is the contradiction to and are ECVSs in X. For the case
we get because . Then P-intersection of and are ECVSs in X. □
We add a condition of a P-intersection of two CVSs to become both an ECVS and ICVS.
Theorem 11.
Let and be two VCSs in X such that for all . Then P-intersection and is an ECVS and an ICVS in X
Proof.
For each , substitute
and
Then which is one of the and . We take or only.
If , thus
and so . This implies that . Thus,
implies that . Thus,
and .
If , thus, and so . Then and . Therefore, the P-intersection of and is an ECVS and ICVS in X. □
We provide the condition of a P-union of two ECVSs to become an ECVS.
Theorem 12.
Let and be two EVCSs in X such that > . Then the P-union and is an ECVS in X.
Proof.
For each , substitute
and
Then is one of the and . We consider or only.
If , thus,
and so . This implies that
hence,
If , thus and so . Suppose that We have,
and
or
That is a contradiction for that fact and are ECVSs in X in the first case. For the next case, we will show that because Suppose We have,
which means
or
It contradicts , for the fact and are ECVSs in X. In the case
we get since . Thus, a P-union of and is an ECVS in X. □
Theorem 13.
Let and be two ECVSs in X. If for each such that , then the R-union and is an ECVS in X.
Proof.
For each , substitute
and
Then is one of the and . Consider the case of or .
If , thus,
and . Then the first part of inequality
and
If , then
and . Suppose . Thus,
which implies that
or
For the case , it contradicts the fact that and are ECVSs in X. For the case
we have since .
Suppose We have,
Hence,
or
For the case , it is a contradiction since and are ECVSs in X. For the case
we notice that since . Hence the R-union of and is an ECVS in X. □
For the R-intersection we provide the condition of two ECVSs to be an ECVS.
Theorem 14.
Let and be two ECVSs in X. If for each such that , then the R-intersection of and is an ECVS in X.
Proof.
The proof is similar to that of Theorem 13. □
For R-intersection we provide the condition of two CVSs to be both an ECVS and ICVS.
Theorem 15.
Let and be CVSs in X. If for each such that , then the R-intersection of and is an ECVS and an ICVS in X.
Proof.
The proof is similar to that of Theorem 11. □
For the R-union we provide the condition of two ICVSs to be an ECVS.
Theorem 16.
Let and be ICVSs in X. If , then the R-union of and is an ECVS in X.
Proof.
Straightforward. □
For the R-intersection we provide the condition of two ICVSs to be an ECVS.
Theorem 17.
Let and be ICVSs in X. If for all , then the R-intersection of and is an ECVS in X.
Proof.
Straightforward. □
For the R-union we provide the condition of two ECVSs to be an ICVS.
Theorem 18.
Let and be ICVSs in X such that for all , then the R-union of and is an ICVS in X.
Proof.
Straightforward. □
4. Similarity Measure of Cubic Vague Sets
The most important mathematical tool for solving problems in pattern recognition and clustering analysis is similarity measure. Therefore, in this section we will propose the similarity measures between two CVSs, which will then be applied to a pattern recognition problem.
Definition 13.
A real valued function is a similarity measure between two CVSs and if S satisfies all of the following axioms:
- (S1)
;
- (S2)
;
- (S3)
⟺
- (S4)
and , if , then and
Next, we give the similarity measurement between two CVSs.
Definition 14.
Let be the universe of the objects, and are two families of cubic vague sets in X. The similarity measurement between and is defined by the function , where
Application of the Similarity Measurement Method in a Pattern Recognition Problem
The measures of fuzzy sets and their hybrid methods help us to solve problems in many real-life areas, especially in the field of pattern recognition and image processing, among others. In this section, we will examine the similarity measures of two CVSs of a pattern recognition problem. We construct an algorithm, and suppose that is the ideal pattern.
-
Step 1.
Firstly, we construct an ideal VCS .
-
Step 2.
Then, we construct cubic vague sets , , on X for a sample patterns which are under consideration.
-
Step 3.
The similarity measures between the sample patterns , and ideal pattern are calculated using the formula given in Definition 14.
-
Step 4.
If then the pattern is to be recognized to belong to the ideal Pattern and if then the pattern is not to be recognized for an ideal Pattern .
Now, we provide a numerical application example for similarity measurement of two CVSs in a pattern recognition problem. Through the example, we will illustrate which one of the sample patterns belongs to the ideal pattern.
Example 9.
Consider a simple pattern recognition problem involving three sample patterns and an ideal pattern. The objective of the problem is to determine which one of the three sample patterns belongs to the ideal pattern. Let be the universe. Three patterns denoted as pattern 1, pattern 2 and pattern 3 are the designated sample patterns, whereas pattern 4 is the designated ideal pattern. These three patterns are modeled using the CVS model, with the CVSs ; ; and representing the information and data of patterns 1, 2, 3 and 4, respectively.
[Step 1.] Construct an ideal CVS on X as;
[Step 2.] Construct CVSs , on X for the sample patterns as;
[Step 3.] Calculate the degree of similarity S between the three sample patterns and the ideal pattern , . then the results obtained are
[Step 4.] Since , and , the sample patterns whose corresponding CVS sets are represented by and are recognized as similar patterns of the family of ideal pattern whose CVS set is represented by and the pattern whose CVS is represented by does not belong to the family of ideal pattern .
To show the advantage of our proposed method using CVS as compared to that of a cubic set [19], let us consider the decision making problem above. It can be seen that cubic set is unable to describe this problem, since it fails to capture the false membership portion of the data in assessing the alternative in the decision-making process.
Note that the CVS is a generalization of a cubic set by adding the concept of vague set to the definition of cubic set. Thus, as shown in the decision making problem above, the CVS has the ability to handle uncertainties, imprecise and vagueness information considering both the truth-membership and falsity-membership values, whereas cubic set can only handle the uncertainties information without taking into account the truth-membership and falsity-membership values. This indeed illustrates the core advantage of CVS against that of CS.
5. Conclusions
A new concept of a cubic set namely the cubic vague set is introduced by incorporating the features of a vague set and a cubic set. Several properties and theorems of cubic vague set are defined and proven involving ECVS or ICVS. We have derived different conditions for different operations of two ICVSs (ECVSs) to be an ICVS (ECVS). We have shown that the proposed set and corresponding algorithm can be applied to a decision making problem containing uncertainties. Our future research is finding ways to apply cubic vague set to groups, rings, numerical analysis [35,36,37] and more real life applications.
Acknowledgments
The authors gratefully acknowledged the financial support from the Deanship of Scientific Research and Graduate studies at Philadelphia University in Jordan.
Author Contributions
Funding acquisition, K.A.; methodology, K.A.; supervision, N.H.; validation, N.H.; writing—original draft, K.A. and Y.A.-Q.; writing—review and editing, N.H. and A.M.N. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by Deanship of Scientific Research and Graduate Studies of Philadelphia University in Jordan.
Conflicts of Interest
The authors declare no conflict of interest.
References
- 1.Zadeh L.A. Fuzzy sets. Inf. Control. 1965;8:338–353. doi: 10.1016/S0019-9958(65)90241-X. [DOI] [Google Scholar]
- 2.Al-Qudah Y., Hassan N. Complex multi-fuzzy soft expert set and its application. Int. J. Math. Comp. Sci. 2019;14:149–176. [Google Scholar]
- 3.Al-Qudah Y., Hassan N. Operations on complex multi-fuzzy sets. J. Intell. Fuzzy. Syst. 2017;33:1527–1540. doi: 10.3233/JIFS-162428. [DOI] [Google Scholar]
- 4.Al-Qudah Y., Hassan N. Complex multi-fuzzy soft set: Its entropy and similarity measure. IEEE Access. 2018;6:65002–65017. doi: 10.1109/ACCESS.2018.2877921. [DOI] [Google Scholar]
- 5.Al-Qudah Y., Hassan M., Hassan N. Fuzzy parameterized complex multi-fuzzy soft expert set theory and its application in decision-making. Symmetry. 2019;11:358. doi: 10.3390/sym11030358. [DOI] [Google Scholar]
- 6.Al-Qudah Y., Hassan N. Mapping on complex multi-fuzzy soft expert classes. J. Phys. Conf. Ser. 2019;1212:012019. doi: 10.1088/1742-6596/1212/1/012019. [DOI] [Google Scholar]
- 7.Hassan N., Al-Qudah Y. Fuzzy parameterized complex multi-fuzzy soft set. J. Phys. Conf. Ser. 2019;1212:012016. doi: 10.1088/1742-6596/1212/1/012016. [DOI] [Google Scholar]
- 8.Alhazaymeh K., Hassan N. Mapping on generalized vague soft expert set. Int. J. Pure Appl. Math. 2014;93:369–376. doi: 10.12732/ijpam.v93i3.7. [DOI] [Google Scholar]
- 9.Alhazaymeh K., Hassan N. Vague soft multiset theory. Int. J. Pure. Appl. Math. 2014;93:511–523. doi: 10.12732/ijpam.v93i4.3. [DOI] [Google Scholar]
- 10.Alhazaymeh K., Hassan N. Generalized interval-valued vague soft set. Appl. Math. Sci. 2013;7:6983–6988. doi: 10.12988/ams.2013.310575. [DOI] [Google Scholar]
- 11.Alhazaymeh K., Hassan N. Application of generalized vague soft expert set in decision making. Int. J. Pure Appl. Math. 2014;93:361–367. doi: 10.12732/ijpam.v93i3.6. [DOI] [Google Scholar]
- 12.Salleh A.R., Alkhazaleh S., Hassan N., Ahmad A.G. Multiparameterized soft set. J. Math. Stat. 2012;8:92–97. [Google Scholar]
- 13.Adam F., Hassan N. Properties on the multi Q-fuzzy soft matrix. AIP Conf. Proc. 2014;1614:834–839. [Google Scholar]
- 14.Atanassov K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986;20:87–96. doi: 10.1016/S0165-0114(86)80034-3. [DOI] [Google Scholar]
- 15.Gau W.L., Buehrer D.J. Vague sets. IEEE Trans. Syst. Man Cybern. 1993;23:610–614. doi: 10.1109/21.229476. [DOI] [Google Scholar]
- 16.Abu Qamar M., Hassan N. Entropy, measures of distance and similarity of Q-neutrosophic soft sets and some applications. Entropy. 2018;20:672. doi: 10.3390/e20090672. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 17.Abu Qamar M., Hassan N. Q-neutrosophic soft relation and its application in decision making. Entropy. 2018;20:172. doi: 10.3390/e20030172. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 18.Al-Quran A., Hassan N. The complex neutrosophic soft expert relation and its multiple attribute decision making method. Entropy. 2018;20:101. doi: 10.3390/e20020101. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 19.Jun Y.B., Kim C.S., Yang K.O. Cubic set. Ann. Fuzzy Math. Inform. 2012;4:83–98. [Google Scholar]
- 20.Rashid S., Yaqoob N., Akram M., Gulistan M. Cubic graphs with application. Int. J. Anal. Appl. 2018;16:733–750. [Google Scholar]
- 21.Ma X.-L., Zhan J., Khan M., Gulistan M., Yaqoob N. Generalized cubic relations in Hv-LA-semigroups. J. Discret. Math. Sci. Cryptogr. 2018;21:607–630. doi: 10.1080/09720529.2016.1191174. [DOI] [Google Scholar]
- 22.Khan M., Jun Y.B., Gulistan M., Yaqoob N. The generalized version of Jun’s cubic sets in semigroups. J. Intell. Fuzzy Syst. 2015;28:947–960. doi: 10.3233/IFS-141377. [DOI] [Google Scholar]
- 23.Jun Y.B., Smarandache F., Kim C.S. Neutrosophic cubic sets. New Math. Nat. Comput. 2017;13:41–54. doi: 10.1142/S1793005717500041. [DOI] [Google Scholar]
- 24.Jun Y.B., Song S.Z., Kim S.J. Cubic interval-valued intuitionistic fuzzy sets and their application in BCK/BCI-algebras. Axioms. 2018;7:7. doi: 10.3390/axioms7010007. [DOI] [Google Scholar]
- 25.Rashid S., Gulistan M., Jun Y.B., Khan S., Kadry S. N-Cubic sets and aggregation operators. J. Intell. Fuzzy Syst. 2019;37:5009–5023. doi: 10.3233/JIFS-182595. [DOI] [Google Scholar]
- 26.Alhazaymeh K., Gulistan M., Khan M., Kadry B.S. Neutrosophic cubic einstein hybrid geometric aggregation operators with application in prioritization using multiple attribute decision-making method. Mathematics. 2019;7:346. [Google Scholar]
- 27.Fu J., Ye J., Cui W. An evaluation method of risk grades for prostate cancer using similarity measure of cubic hesitant fuzzy sets. J. Biomed. Inform. 2018;87:131–137. doi: 10.1016/j.jbi.2018.10.003. [DOI] [PubMed] [Google Scholar]
- 28.Ashraf S., Abdullah S., Qadir A. Novel concept of cubic picture fuzzy sets. J. New Theory. 2018;24:59–72. [Google Scholar]
- 29.Yang M.S., Hussain Z. Fuzzy entropy for pythagorean fuzzy sets with application to multicriterion decision making. Complexity. 2018:2832839. doi: 10.1155/2018/2832839. [DOI] [Google Scholar]
- 30.Thao N.X., Smarandache F. A new fuzzy entropy on Pythagorean fuzzy sets. J. Intell. Fuzzy Syst. 2019;37:1065–1074. doi: 10.3233/JIFS-182540. [DOI] [Google Scholar]
- 31.Wang L., Li N. Pythagorean fuzzy interaction power Bonferroni mean aggregation operators in multiple attribute decision making. Int. J. Intell. Syst. 2020;35:150–183. doi: 10.1002/int.22204. [DOI] [Google Scholar]
- 32.Liu P., Ali Z., Mahmood T., Hassan N. Group decision making using complex q-rung orthopair fuzzy Bonferroni mean. Int. J. Comput. Intell. Syst. 2020;32:822–851. doi: 10.2991/ijcis.d.200514.001. [DOI] [Google Scholar]
- 33.Khan M., Gulistan M., Hassan N., Nasruddin A.M. Air pollution model using neutrosophic cubic Einstein averaging operators. Neutrosophic Sets Syst. 2020;32:372–389. [Google Scholar]
- 34.Hashim R.M., Gulistan M., Rehman I., Hassan N., Nasruddin A.M. Neutrosophic bipolar fuzzy set and its application in medicines preparations. Neutrosophic Sets Syst. 2020;31:86–100. [Google Scholar]
- 35.Sham A.W.M., Monsi M., Hassan N., Suleiman M. A modified interval symmetric single step procedure ISS-5D for simultaneous inclusion of polynomial zeros. AIP Conf. Proc. 2013;1522:61–67. [Google Scholar]
- 36.Sham A.W.M., Monsi M., Hassan N. An efficient interval symmetric single step procedure ISS1-5D for simultaneous bounding of real polynomial zeros. Int. J. Math. Anal. 2013;7:977–981. doi: 10.12988/ijma.2013.13096. [DOI] [Google Scholar]
- 37.Abu Bakar N., Monsi M., Hassan N. An improved parameter regula falsi method for enclosing a zero of a function. Appl. Math. Sci. 2012;6:1347–1361. [Google Scholar]
