Next Article in Journal
Novel Robust Stability Criteria for Lur’e Systems with Time-Varying Delay
Previous Article in Journal
Apriorics: Information and Graphs in the Description of the Fundamental Particles—A Mathematical Proof
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Improving Risk Assessment Model for Cyber Security Using Robust Aggregation Operators for Bipolar Complex Fuzzy Soft Inference Systems

1
Department of Mathematics and Statistics, Riphah International University, Islamabad 44000, Pakistan
2
Department of Applied Mathematics, Chung Yuan Christian University, Taoyuan 32023, Taiwan
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(4), 582; https://doi.org/10.3390/math12040582
Submission received: 18 December 2023 / Revised: 30 January 2024 / Accepted: 9 February 2024 / Published: 15 February 2024

Abstract

:
Improving a risk assessment technique for the problem of cyber security is required to modify the technique’s capability to identify, evaluate, assess, and mitigate potential cyber threats and ambiguities. The major theme of this paper is to find the best strategy to improve and refine the cyber security risk assessment model. For this, we compute some operational laws for bipolar complex fuzzy soft (BCFS) sets and then propose the BCFS weighted averaging (BCFSWA) operator, BCFS ordered weighted averaging (BCFSOWA) operator, BCFS weighted geometric (BCFSWG) operator, and BCFS ordered weighted geometric (BCFSOWG) operator. Furthermore, we give their properties, such as idempotency, monotonicity, and boundedness. Additionally, we improve the risk assessment technique for the cyber security model based on the proposed operators. We illustrate the technique of multi-attribute decision-making (MADM) problems for the derived operators based on BCFS information. Finally, we compare our ranking results with those of some existing operators for evaluating and addressing the supremacy, validity, and efficiency of these operators under BCFS information.

1. Introduction

The application of cyber security plays a critical and valuable role in the field of artificial intelligence and machine learning, and so a risk assessment model for cyber security is very important. However, improving the risk assessment technique for cyber security becomes an awkward and challenging task. Many applications have been presented by different scholars based on the risk assessment model for cyber security under the consideration of the classical set theory. But, in the case of the classical set theory, we may encounter problems because crisp sets are limited with only the two values of zero and one. During the decision-making procedure, we may lose a lot of information due to these limited options with crisp sets. To solve this kind of problem, Zadeh [1] initiated the fuzzy sets (FSs) theory by extending the range of sets to be between zero and one. FSs have various applications, with uncertainty arising from partial belongingness, such as in [2,3,4,5]. The implementation of bipolar FSs (BFSs) is necessary because, in the presence of the positive truth grade only, it is sometimes awkward and ambiguous to handle some problems. In many situations, we may face a problem that contains a positive truth grade as well as a negative truth grade; therefore, a positive truth grade alone is not able to cope with unreliable and complicated information in genuine life problems. For this, Zhang [6] initiated the theory of BFSs, which covered the positive truth grade and negative truth grade in two different directions, where the range of the positive truth grade is [0, 1], and the range of the negative truth grade is [−1, 0]. Thus, FSs are the dominant case of BFSs because of some limitations in FSs, and so BFSs are used to improve FSs. Because of their advantages, researchers have applied BFSs in different fields, such as in [7,8,9].
Complexity and ambiguity are a part of every decision-making procedure because, in many situations, a lot of experts need to face two-dimensional information problems. Since the theory of FSs and BFSs only deals with one-dimensional information, FSs and BFSs are not able to cope with unreliable and vague information. Therefore, Ramot et al. [10] initiated complex FSs (CFSs); the positive truth grade in CFSs is constructed in the shape of complex numbers whose real and imaginary parts are defined from any universal set to unit interval. Moreover, the positive complex-valued truth grade is not able to deal with vague and unreliable data because, in many problems, the negative truth grades are also involved, and so the theory of CFSs has not worked properly or effectively. Therefore, Mahmood and Ur Rehman [11] initiated the power theory of bipolar CFSs (BCFSs). The positive and negative complex-valued truth grades are the parts of the BCFSs where the range of the positive (real and imaginary) truth grade is [0, 1] and the range of negative (real and imaginary) truth grade is [−1, 0]. BCFSs are wider than the prevailing ideas of FSs, BFSs, and CFSs, so they can cope with unreliable and vague information. After the proposal of BCFSs, scholars have utilized them in many fields, such as in [12,13].
The soft set (SS), which is a modified version of FSs, was initiated by Molodtsov [14] in 1999. The idea of SSs is defined from the set of parameters to the power set of a universal set. If we put any parameter to a function, then the resultant value of the parameter will be the subset of the universal set. Further, Roy and Maji [15] derived fuzzy SSs (FSSs), where FSSs are the combination of FSs and SSs. Moreover, Abdullah et al. [16] presented bipolar FSSs (BFSSs). BFSSs are mixtures of BFSs and SSs and are very reliable and dominant sets, which can cope with unreliable or vague information in real-life problems. Additionally, complex FSSs (CFSSs) were considered by Thirunavukarasu et al. [17]. Furthermore, Mahmood et al. [18] derived bipolar CFSSs (BCFSSs) with applications in decision-making problems. We observe that many researchers have developed different kinds of operators on FSs, BFSs, CFSs, BCFSs, SSs, and BFSSs, for instance, aggregation operators (AOs) for FSs [19], geometric and power operators for CFSs [20,21], AOs for BCFSs [22,23], AOs for SSs [24], robust AOs for BFSSs [25], and Aczel–Alsina power AOs for BFSs [26].
From the above analysis, we observe that BCFSSs are very reliable and dominant because of their structure, in which the FSs, BFSs, SSs, CFSs, BCFSs, FSSs, CFSSs, and BFSSs are the special cases of BCFSSs. Although Mahmood et al. [18] initiated these BCFSSs, up until now, there have been no AOs for BCFSSs with application in a risk assessment for cyber security. Since improving a risk assessment technique for cyber security is important and requires modification of the technique’s capability to identify, evaluate, assess, and mitigate potential cyber threats and ambiguities, we advance the study by improving a risk assessment model for the problem of cyber security based on the proposed AOs for BCFSSs. Motivated by the above-mentioned works, the major contributions of this paper are listed as follows:
(1)
To compute some algebraic operational laws for BCFSSs.
(2)
To propose BCFSWA, BCFSOWA, BCFSWG, and BCFSOWG operators with their properties, such as idempotency, monotonicity, and boundedness.
(3)
To improve the risk assessment technique for the cyber security model based on the proposed BCFSWA, BCFSOWA, BCFSWG, and BCFSOWG operators.
(4)
To illustrate the technique of MADM problems for these derived operators based on BCFS information.
(5)
To compare our ranking results with those of existing operators for evaluating or addressing the supremacy and validity of the proposed operators.
This paper is arranged as follows. In Section 2, we review the theory of BCFSSs, and after this, we provide some operational laws such as algebraic laws, score values, and accuracy values for BCFSSs. In Section 3, we compute some operational laws for BCFSSs. Furthermore, we consider the BCFSWA operator, BCFSOWA operator, BCFSWG operator, and BCFSOWG operator, and then give their properties, such as idempotency, monotonicity, and boundedness. In Section 4, we improve the risk assessment technique for the cyber security model based on the proposed operators. For this, we illustrate the technique of MADM problems for the derived operators based on BCFS information. In Section 5, we compare our ranking results with the ranking results of existing operators for evaluating or addressing the supremacy and validity of the proposed operators. Some concluding remarks are stated in Section 6.

2. Preliminaries

In this section, we review the theory of bipolar complex fuzzy soft (BCFS) sets (BCFSSs), and after that, we derive some operational laws such as algebraic laws, score value, and accuracy value for BCFSSs. Further, we list all symbols used in this paper with their meanings, as shown in Table 1.
Definition 1.
(Ref. [18]). Let Y be a universal set and let   A be a parameter set with   E A . A bipolar complex fuzzy set (BCFS)   B B C F S of   Y is defined as the following:
B B C F S = y i , U R y i + z U I y i , V R y i + z V I y i : y i Y , z = 1 .
Further, the pair   B B C F S S , E   is called a BCFSS over   Y   for   E A ,   where   B B C F S S :   E B C F S Y ,   and   B C F S Y   represents the collection of BCFSs of   Y .
Notice that   U R , U I : Y 0 , 1   and   V R , V I : Y 1 , 0   are called supporting truth grade and supporting against truth grade with U R y , U I y 0 , 1   and   V R y , V I y 1 , 0 . Additionally, the simple shape of a BCFS number (BCFSN) is described as B B C i j = U i j R + z U i j I , V i j R + z V i j I , i , j = 1 , 2 , , , g .
We next give the newly defined operators and for any two BCFSNs B B C 11 and B B C 12 and also the score and accuracy values for any BCFSN B B C i j as follows.
Definition 2.
Let   Y   be a universal set. Then, for any two BCFSNs   B B C 11   and   B B C 12 , we define the operators     and     and the scale product and power as follows:
B B C 11 B B C 12 = U 11 R + U 12 R U 11 R U 12 R + z U 11 I + U 12 I U 11 I U 12 I , V 11 R V 12 R + z V 11 I V 12 I ;
B B C 11 B B C 12 = U 11 R U 12 R + z U 11 I U 12 I , V 11 R + V 12 R V 11 R V 12 R + z V 11 I + V 12 I V 11 I V 12 I ;
S s c B B C 11 = 1 1 U 11 R S s c + z 1 1 U 11 I S s c , V 11 R S s c + z V 11 I S s c ;
B B C 11 S s c = U 11 R S s c + z U 11 I S s c , 1 + 1 + V 11 R S s c + z 1 + 1 + V 11 I S s c .
Definition 3.
Let   Y   be a universal set. The score and accuracy values for any BCFSN   B B C i j   are defined as the following:
S C B B C i j = 1 2 U i j R + V i j R + U i j I + V i j I 1 , 1
A C B B C i j = 1 2 U i j R V i j R + U i j I V i j I 0 , 1
For the above information, we have the following properties. If   S C B B C 11 > S C B B C 12 , then   B B C 11 > B B C 12 , and if   A C B B C 11 > A C B B C 12 , then   B B C 11 > B B C 12 .

3. Robust Aggregation Operators for BCFSSs

In this section, we initiate the concept of the BCFSWA operator, BCFSOWA operator, BCFSWG operator, and BCFSOGA operator and then discuss their properties.
Definition 4.
Let   B B C 11 , B B C 12 , , B B C g   be BCFSNs. The BCFSWA operator for   B B C 11 , B B C 12 , , B B C g   is defined as the following:
B C F S W A B B C 11 , B B C 12 , , B B C g = j = 1 g S Ω j i = 1 S Ψ i B B C i j
Notice that   S Ω j ,   S Ψ i 0 , 1   represent weight vectors with the condition of   i = 1 S Ψ i = 1   and   j = 1 g S Ω j = 1 .
Theorem 1.
Let   B B C 11 , B B C 12 , , B B C g   be BCFSNs. Then, the aggregating value of the BCFSWA operator for   B B C 11 , B B C 12 , , B B C g   is again a BCFSN and can be written as follows:
B C F S W A B B C 11 , B B C 12 , , B B C g = 1 j = 1 g i = 1 1 U i j R S Ψ i S Ω j + z 1 j = 1 g i = 1 1 U i j I S Ψ i S Ω j , j = 1 g i = 1 V i j R S Ψ i S Ω j + z j = 1 g i = 1 V i j I S Ψ i S Ω j .
Proof. 
To prove the above result, we use the method of mathematical induction. For this, we have to use = 1 and S Ψ i = 1 , thus
B C F S W A B B C 11 , B B C 12 , , B B C 1 g = j = 1 g S Ω j B B C 1 j = 1 j = 1 g 1 U i j R S Ω j + z 1 j = 1 g 1 U i j I S Ω j , j = 1 g V i j R S Ω j + z j = 1 g V i j I S Ω j
= 1 j = 1 g i = 1 1 1 U i j R S Ψ i S Ω j + z 1 j = 1 g i = 1 1 1 U i j I S Ψ i S Ω j , j = 1 g i = 1 1 V i j R S Ψ i S Ω j + z j = 1 g i = 1 1 V i j I S Ψ i S Ω j
= j = 1 g S Ω j i = 1 1 S Ψ i B B C i j = B C F S W A B B C 11 , B B C 12 , , B B C g .
If we use g = 1 and S Ω j = 1 , thus
B C F S W A B B C 11 , B B C 12 , , B B C 1 = i = 1 S Ψ i B B C i 1 = 1 i = 1 1 U i j R S Ψ i + z 1 i = 1 1 U i j I S Ψ i , i = 1 V i j R S Ψ i + z i = 1 V i j I S Ψ i
= 1 j = 1 1 i = 1 1 U i j R S Ψ i S Ω j + z 1 j = 1 1 i = 1 1 U i j I S Ψ i S Ω j , j = 1 1 i = 1 V i j R S Ψ i S Ω j + z j = 1 1 i = 1 V i j I S Ψ i S Ω j
= j = 1 1 S Ω j i = 1 S Ψ i B B C i j = B C F S W A B B C 11 , B B C 12 , , B B C g
We have proven that = g = 1 . Further, if we assume that for g = ơ 1 + 1 , = ơ 2 and g = ơ 1 , = ơ 2 + 1 , we can obtain the following results:
j = 1 ơ 1 + 1 S Ω j i = 1 ơ 2 S Ψ i B B C i j = ( 1 j = 1 ơ 1 + 1 i = 1 ơ 2 1 U i j R S Ψ i S Ω j + z 1 j = 1 ơ 1 + 1 i = 1 ơ 2 1 U i j I S Ψ i S Ω j , j = 1 ơ 1 + 1 i = 1 ơ 2 V i j R S Ψ i S Ω j + z j = 1 ơ 1 + 1 i = 1 ơ 2 V i j I S Ψ i S Ω j )
and
j = 1 ơ 1 S Ω j i = 1 ơ 2 + 1 S Ψ i B B C i j = ( 1 j = 1 ơ 1 i = 1 ơ 2 + 1 1 U i j R S Ψ i S Ω j + z 1 j = 1 ơ 1 i = 1 ơ 2 + 1 1 U i j I S Ψ i S Ω j , j = 1 ơ 1 i = 1 ơ 2 + 1 V i j R S Ψ i S Ω j + z j = 1 ơ 1 i = 1 ơ 2 + 1 V i j I S Ψ i S Ω j )
Then, we prove that the above theory also holds for g = ơ 1 + 1 and = ơ 2 + 1 :
j = 1 ơ 1 + 1 S Ω j i = 1 ơ 2 + 1 S Ψ i B B C i j = j = 1 ơ 1 + 1 S Ω j i = 1 ơ 2 S Ψ i B B C i j S Ψ ơ 2 + 1 B B C ơ 2 + 1 j
= j = 1 ơ 1 + 1 S Ω j i = 1 ơ 2 S Ψ i B B C i j j = 1 ơ 1 + 1 S Ω j S Ψ ơ 2 + 1 B B C ơ 2 + 1 j
= ( 1 j = 1 ơ 1 + 1 i = 1 ơ 2 1 U i j R S Ψ i S Ω j + z 1 j = 1 ơ 1 + 1 i = 1 ơ 2 1 U i j I S Ψ i S Ω j , j = 1 ơ 1 + 1 i = 1 ơ 2 V i j R S Ψ i S Ω j + z j = 1 ơ 1 + 1 i = 1 ơ 2 V i j I S Ψ i S Ω j ) ( 1 j = 1 ơ 1 + 1 1 U ơ 2 + 1 j R S Ψ ơ 2 + 1 S Ω j + z 1 j = 1 ơ 1 + 1 1 U ơ 2 + 1 j I S Ψ ơ 2 + 1 S Ω j , j = 1 ơ 1 + 1 V ơ 2 + 1 j R S Ψ ơ 2 + 1 S Ω j + z j = 1 ơ 1 + 1 V ơ 2 + 1 j I S Ψ ơ 2 + 1 S Ω j )
= 1 j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 1 U i j R S Ψ i S Ω j + z 1 j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 1 U i j I S Ψ i S Ω j , j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 V i j R S Ψ i S Ω j + z j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 V i j I S Ψ i S Ω j
Hence, the proposed theory holds for values of g = ơ 1 + 1 and = ơ 2 + 1 .
We next simplify the above information with the help of a simple example for which the data are shown in Table 2.
Thus, by using the proposed theory, we obtain the following results:
B C F S W A B B C 11 , B B C 12 , B B C 13 , B B C 14 = 0.8034 + z 0.4583 , 0.3513 + z 0.3085 .
Property 1
(Idempotency). If B B C i j = B B C = U R + z U I , V R + z V I , i , j = 1 , 2 , , , g , then the idempotency property holds for BCFSWA, as
B C F S W A B B C 11 , B B C 12 , , B B C g = B B C
Proof. 
We know that B B C i j = B B C = U R + z U I , V R + z V I ; thus
B C F S W A B B C 11 , B B C 12 , , B B C g = ( 1 j = 1 g i = 1 1 U i j R S Ψ i S Ω j + z 1 j = 1 g i = 1 1 U i j I S Ψ i S Ω j j = 1 g i = 1 V i j R S Ψ i S Ω j + z j = 1 g i = 1 V i j I S Ψ i S Ω j )
= 1 j = 1 g i = 1 1 U R S Ψ i S Ω j + z 1 j = 1 g i = 1 1 U I S Ψ i S Ω j , j = 1 g i = 1 V R S Ψ i S Ω j + z j = 1 g i = 1 V I S Ψ i S Ω j
= 1 1 U R i = 1 S Ψ i j = 1 g S Ω j + z 1 1 U I i = 1 S Ψ i j = 1 g S Ω j , V R i = 1 S Ψ i j = 1 g S Ω j + z V I i = 1 S Ψ i j = 1 g S Ω j
= 1 1 U R + z 1 1 U I , V R + z V I
= U R + z U I , V R + z V I = B B C .
Property 2
(Monotonicity). If B B C i j B # B C i j , then
B C F S W A B B C 11 , B B C 12 , , B B C g B C F S W A B # B C 11 , B B C # 12 , , B # B C g
Proof. 
Consider that B B C i j B B C # i j ; thus, U i j R U i j # R , U i j I U i j # I and V i j R V i j # R , V i j I V i j # I . Then, we simplify the positive truth grade:
U R i j U R i j # 1 U i j R 1 U i j # R
1 U i j R S Ψ i 1 U i j # R S Ψ i
i = 1 1 U i j R S Ψ i i = 1 1 U i j # R S Ψ i
i = 1 1 U i j R S Ψ i S Ω j i = 1 1 U i j # R S Ψ i S Ω j
j = 1 g i = 1 1 U i j R S Ψ i S Ω j j = 1 g i = 1 1 U i j # R S Ψ i S Ω j
j = 1 g i = 1 1 U i j R S Ψ i S Ω j j = 1 g i = 1 1 U i j # R S Ψ i S Ω j
1 j = 1 g i = 1 1 U i j R S Ψ i S Ω j 1 j = 1 g i = 1 1 U i j # R S Ψ i S Ω j
Further, we know that
U I i j U I i j # 1 j = 1 g i = 1 1 U i j I S Ψ i S Ω j 1 j = 1 g i = 1 1 U i j # I S Ψ i S Ω j
Moreover, we evaluate it for negative truth grades:
V R i j V R i j # V i j R V i j # R
V i j R S Ψ i V i j # R S Ψ i
i = 1 V i j R S Ψ i i = 1 V i j # R S Ψ i
i = 1 V i j R S Ψ i S Ω j i = 1 V i j # R S Ψ i S Ω j
j = 1 g i = 1 V i j R S Ψ i S Ω j j = 1 g i = 1 V i j # R S Ψ i S Ω j
j = 1 g i = 1 V i j R S Ψ i S Ω j j = 1 g i = 1 V i j # R S Ψ i S Ω j
Further, we know that V i j I V i j # I j = 1 g i = 1 V i j I S Ψ i S Ω j j = 1 g i = 1 V i j # I S Ψ i S Ω j . Thus, according to the definition of the score value   S C B B C i j , we can easily derive the following inequality: B C F S W A B B C 11 , B B C 12 , , B B C g B C F S W A B B C # 11 , B B C # 12 , , B B C # g . Thus, the proof is completed.
Property 3
(Boundedness). When B B C = m i n i   m i n j U i j R + z m i n i   m i n j U i j I , m a x i   m a x j V i j R + z m a x i   m a x j V i j I and B B C + = m a x i   m a x j U i j R + z m a x i   m a x j U i j I , m i n i   m i n j V i j R + z m i n i   m i n j V i j I , i , j = 1 , 2 , , , g , we know that
B B C B C F S W A B B C 11 , B B C 12 , , B B C g B B C +
Proof. 
Consider that B B C = min i   min j U i j R + z min i   min j U i j I , max i   max j V i j R + z max i   max j V i j I and B B C + = max i   max j U i j R + z max i   max j U i j I , min i   min j V i j R + z min i   min j V i j I , i , j = 1 , 2 , , , g . Thus, by using the information for Property 1 and Property 2, we know that
B C F S W A B B C 11 , B B C 12 , , B B C g B C F S W A B B C + 11 , B B C + 12 , , B B C + g = B B C +
B C F S W A B B C 11 , B B C 12 , , B B C g B C F S W A B B C 11 , B C 12 , , B B C g = B B C
Then, B B C B C F S W A B B C 11 , B B C 12 , , B B C g B B C + .  
Definition 5.
Let   B B C 11 , B B C 12 , , B B C g   be BCFSNs. The BCFSOWA operator for   B B C 11 , B B C 12 , , B B C g   is defined as the following:
B C F S O W A B B C 11 , B B C 12 , , B B C g = j = 1 g S Ω j i = 1 S Ψ i B B C o i o j
Notice that   S Ω j ,   S Ψ i 0 , 1   represent weight vectors with a strong condition, i = 1 S Ψ i = 1   and   j = 1 g S Ω j = 1 , with order o i , o j o i 1 , o j 1 .
Theorem 2.
Let   B B C 11 , B B C 12 , , B B C g   be BCFSNs. Then, the aggregating value of the BCFSOWA operator is again a BCFSN, as
B C F S O W A B B C 11 , B B C 12 , , B B C g = ( 1 j = 1 g i = 1 1 U o i o j R S Ψ i S Ω j + z 1 j = 1 g i = 1 1 U o i o j I S Ψ i S Ω j , j = 1 g i = 1 V o i o j R S Ψ i S Ω j + z j = 1 g i = 1 V o i o j I S Ψ i S Ω j )
Proof. 
It is similar to Theorem 1.
Property 4
(Idempotency). If B B C i j = B B C = U R + z U I , V R + z V I , i , j = 1 , 2 , , , g , then the idempotency property holds for BCFSOWA, as
B C F S O W A B B C 11 , B B C 12 , , B B C g = B B C
Proof. 
It is similar to Property 1.
Property 5
(Monotonicity). When B B C i j B B C # i j , we know that
B C F S O W A B B C 11 , B B C 12 , , B B C g B C F S O W A B B C # 11 , B B C # 12 , , B B C # g
Proof. 
It is similar to Property 2.
Property 6
(Boundedness). When B B C = m i n i   m i n j U i j R + z m i n i   m i n j U i j I , m a x i   m a x j V i j R + z m a x i   m a x j V i j I and B B C + = m a x i   m a x j U i j R + z m a x i   m a x j U i j I , m i n i   m i n j V i j R + z m i n i   m i n j V i j I , i , j = 1 , 2 , , , g , we know that
B B C B C F S O W A B B C 11 , B B C 12 , , B B C g B B C +
Proof. 
It is similar to Property 3.
Definition 6.
Let   B B C 11 , B B C 12 , , B B C g   be BCFSNs. The BCFSWG operator for   B B C 11 , B B C 12 , , B B C g   is defined as the following:
B C F S W G B B C 11 , B B C 12 , , B B C g = j = 1 g i = 1 B B C i j S Ψ i S Ω j
Notice that   S Ω j ,   S Ψ i 0 , 1   represent weight vectors with a strong condition, i = 1 S Ψ i = 1   and   j = 1 g S Ω j = 1 .
Theorem 3.
Let   B B C 11 , B B C 12 , , B B C g   be BCFSNs. Then, the aggregating value of BCFSWG operator is again a BCFSN and
B C F S W G B B C 11 , B B C 12 , , B B C g = ( j = 1 g i = 1 U i j R S Ψ i S Ω j + z j = 1 g i = 1 U i j I S Ψ i S Ω j , 1 + j = 1 g i = 1 1 + V i j R S Ψ i S Ω j + z 1 + j = 1 g i = 1 1 + V i j I S Ψ i S Ω j )
Proof. 
Using the mathematical induction, it is easy to prove the above result. For this, we have to use = 1 and S Ψ i = 1 ; thus
B C F S W G B B C 11 , B B C 12 , , B B C 1 g = j = 1 g B B C 1 j S Ω j = j = 1 g U i j R S Ω j + z j = 1 g U i j I S Ω j , 1 + j = 1 g 1 + V i j R S Ω j + z 1 + j = 1 g 1 + V i j I S Ω j
= j = 1 g i = 1 1 U i j R S Ψ i S Ω j + z j = 1 g i = 1 1 U i j I S Ψ i S Ω j , 1 + j = 1 g i = 1 1 1 + V i j R S Ψ i S Ω j + z 1 + j = 1 g i = 1 1 1 + V i j I S Ψ i S Ω j
= j = 1 g i = 1 1 B B C i j S Ψ i S Ω j = B C F S W G B B C 11 , B B C 12 , , B B C g .
If we use g = 1 and S Ω j = 1 , then
B C F S W G B B C 11 , B B C 12 , , B B C 1 = i = 1 B B C i 1 S Ψ i = i = 1 U i j R S Ψ i + z i = 1 U i j I S Ψ i , 1 + i = 1 1 + V i j R S Ψ i + z 1 + i = 1 1 + V i j I S Ψ i
= j = 1 1 i = 1 U i j R S Ψ i S Ω j + z j = 1 1 i = 1 U i j I S Ψ i S Ω j , 1 + j = 1 1 i = 1 1 + V i j R S Ψ i S Ω j + z 1 + j = 1 1 i = 1 1 + V i j I S Ψ i S Ω j
= j = 1 1 i = 1 B B C i j S Ψ i S Ω j = B C F S W G B B C 11 , B B C 12 , , B B C g
We have proven that = g = 1 . Further, we assume that for g = ơ 1 + 1 , = ơ 2 and g = ơ 1 , = ơ 2 + 1 . Then, we can also obtain the following results:
j = 1 ơ 1 + 1 i = 1 ơ 2 B B C i j S Ψ i S Ω j = ( j = 1 ơ 1 + 1 i = 1 ơ 2 U i j R S Ψ i S Ω j + z j = 1 ơ 1 + 1 i = 1 ơ 2 U i j I S Ψ i S Ω j , 1 + j = 1 ơ 1 + 1 i = 1 ơ 2 1 + V i j R S Ψ i S Ω j + z 1 + j = 1 ơ 1 + 1 i = 1 ơ 2 1 + V i j I S Ψ i S Ω j )
and
j = 1 ơ 1 i = 1 ơ 2 + 1 B B C i j S Ψ i S Ω j = ( j = 1 ơ 1 i = 1 ơ 2 + 1 U i j R S Ψ i S Ω j + z j = 1 ơ 1 i = 1 ơ 2 + 1 U i j I S Ψ i S Ω j , 1 + j = 1 ơ 1 i = 1 ơ 2 + 1 1 + V i j R S Ψ i S Ω j + z 1 + j = 1 ơ 1 i = 1 ơ 2 + 1 1 + V i j I S Ψ i S Ω j )
Then, we prove that the above theory also holds for g = ơ 1 + 1 and = ơ 2 + 1 :
j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 ( B B C i j ) S Ψ i S Ω j = j = 1 ơ 1 + 1 i = 1 ơ 2 B B C i j S Ψ i B B C ơ 2 + 1 j S Ψ ơ 2 + 1 S Ω j
= j = 1 ơ 1 + 1 i = 1 ơ 2 B B C i j S Ψ i S Ω j j = 1 ơ 1 + 1 B B C ơ 2 + 1 j S Ψ ơ 2 + 1 S Ω j
= ( j = 1 ơ 1 + 1 i = 1 ơ 2 U i j R S Ψ i S Ω j + z j = 1 ơ 1 + 1 i = 1 ơ 2 U i j I S Ψ i S Ω j , 1 + j = 1 ơ 1 + 1 i = 1 ơ 2 1 + V i j R S Ψ i S Ω j + z 1 + j = 1 ơ 1 + 1 i = 1 ơ 2 1 + V i j I S Ψ i S Ω j ) ( j = 1 ơ 1 + 1 U ơ 2 + 1 j R S Ψ ơ 2 + 1 S Ω j + z j = 1 ơ 1 + 1 U ơ 2 + 1 j I S Ψ ơ 2 + 1 S Ω j , 1 + j = 1 ơ 1 + 1 1 + V ơ 2 + 1 j R S Ψ ơ 2 + 1 S Ω j + z 1 + j = 1 ơ 1 + 1 1 + V ơ 2 + 1 j I S Ψ ơ 2 + 1 S Ω j )
= j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 U i j R S Ψ i S Ω j + z j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 U i j I S Ψ i S Ω j , 1 + j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 1 + V i j R S Ψ i S Ω j + z 1 + j = 1 ơ 1 + 1 i = 1 ơ 2 + 1 1 + V i j I S Ψ i S Ω j
Hence, the proposed theory holds for values of g = ơ 1 + 1 and = ơ 2 + 1 .
Similarly, we simplify the above information with the same data as shown in Table 2. By using the proposed theory, we obtain the following result:
B C F S W G B B C 11 , B B C 12 , B B C 13 , B B C 14 = 0.7906 + z 0.4121 , 0.4411 + z 0.4608 .
Property 7
(Idempotency). If B B C i j = B B C = U R + z U I , V R + z V I , i , j = 1 , 2 , , , g , then the idempotency property holds for BCFSWG, as
B C F S W G B B C 11 , B B C 12 , , B B C g = B B C
Proof. 
It is similar to Property 1.
Property 8
(Monotonicity). When B B C i j B B C # i j , we know that
B C F S W G B B C 11 , B B C 12 , , B B C g B C F S W G B B C # 11 , B B C # 12 , , B B C # g .
Proof. 
It is similar to Property 2.
Property 9
(Boundedness). When B B C = m i n i   m i n j U i j R + z m i n i   m i n j U i j I , m a x i m a x j V i j R + z m a x i   m a x j V i j I and B B C + = m a x i   m a x j U i j R + z m a x i   m a x j U i j I , m i n i m i n j V i j R + z m i n i   m i n j V i j I , i , j = 1 , 2 , , , g , we know that
B B C B C F S W G B B C 11 , B B C 12 , , B B C g B B C + .
Proof. 
It is similar to Property 3.
Definition 7.
Let   B B C 11 , B B C 12 , , B B C g   be BCFSN. The BCFSOWA operator for   B B C 11 , B B C 12 , , B B C g   is defined as the following:
B C F S O W G B B C 11 , B B C 12 , , B B C g = j = 1 g i = 1 B B C o i o j S Ψ i S Ω j
Notice that   S Ω j ,   S Ψ i 0 , 1   represent weight vectors with a condition of   i = 1 S Ψ i = 1   and   j = 1 g S Ω j = 1   and with the order   o i , o j o i 1 , o j 1 .
Theorem 4.
Let   B B C 11 , B B C 12 , , B B C g   be BCFSNs. Then, the aggregating value of BCFSOWA operator is again a BCFSN and
B C F S O W G B B C 11 , B B C 12 , , B B C g = ( j = 1 g i = 1 U o i o j R S Ψ i S Ω j + z j = 1 g i = 1 U o i o j I S Ψ i S Ω j , 1 + j = 1 g i = 1 1 + V o i o j R S Ψ i S Ω j + z 1 + j = 1 g i = 1 1 + V o i o j I S Ψ i S Ω j )
Proof. 
It is similar to Theorem 3.
Property 10
(Idempotency). If B B C i j = B B C = U R + z U I , V R + z V I , i , j = 1 , 2 , , , g , then the idempotency property holds for BCFSOWG, as
B C F S O W G B B C 11 , B B C 12 , , B B C g = B B C .
Proof. 
It is similar to Property 1.
Property 11
(Monotonicity). If B B C i j B B C # i j , then
B C F S O W G B B C 11 , B B C 12 , , B B C g B C F S O W G B B C # 11 , B B C # 12 , , B B C # g .
Proof. 
It is similar to Property 2.
Property 12
(Boundedness). When B B C = m i n i   m i n j U i j R + z m i n i   m i n j U i j I , m a x i   m a x j V i j R + z m a x i   m a x j V i j I   and   B B C + = m a x i   m a x j U i j R + z m a x i   m a x j U i j I , m i n i   m i n j V i j R + z m i n i   m i n j V i j I , i , j = 1 , 2 , , , g , we know that
B B C B C F S O W G B B C 11 , B B C 12 , , B B C g B B C + .
Proof. 
It is similar to Property 3.

4. The MADM Method with Application to the Risk Assessment Model for Cyber Security

To evaluate the supremacy and validity of the proposed operators, we analyze the ability of the MADM technique to evaluate some genuine life problems based on the proposed operators, such as the BCFSWA and BCFSWG operators, to enhance the worth of the derived techniques.
To evaluate the MADM procedure, we require the collection of alternatives B B C 11 , B B C 12 , , B B C g , and for each alternative, we have a group of attributes A B C 11 , A B C 12 , , A B C g . Further, for every attribute, we require the collection of weight vectors, such as S Ω j ,   S Ψ i 0 , 1 , which represent the weight vectors with a condition of i = 1 S Ψ i = 1 and j = 1 g S Ω j = 1 . In general, the pair   B B C F S S , E is called a BCFSS , and B B C F S S :   E B C F S Y , where B C F S Y represents the collection of BCFSs of Y . Additionally, we calculate the matrix by including the values of BCFS numbers (BCFSNs), where U R , U I : Y 0 , 1 and V R , V I : Y 1 , 0 are called the supporting truth grade and supporting against truth grade and BCFSNs are described as B B C i j = U i j R + z U i j I , V i j R + z V i j I , i , j = 1 , 2 , , , g . Finally, we illustrate the procedure of the MADM technique for addressing our selected problems. Therefore, the major steps of the MADM technique are listed below:
Step 1: Calculate the matrix of BCFS values; if the matrix covers cost types of information, then we normalize the matrix:
N = U i j R + z U i j I , V i j R + z V i j I f o r   b e n e f i t 1 U i j R + z 1 U i j I , 1 V i j R + z 1 V i j I f o r   c o s t .
Furthermore, if the matrix contains a benefit type of information, then we are not able to evaluate the matrix.
Step 2: Calculate the aggregated values of the normalized matrix using the theory of BCFSWA and BCFSWG operators:
B C F S W A B B C 11 , B B C 12 , , B B C g = ( 1 j = 1 g i = 1 1 U i j R S Ψ i S Ω j + z 1 j = 1 g i = 1 1 U i j I S Ψ i S Ω j , j = 1 g i = 1 V i j R S Ψ i S Ω j + z j = 1 g i = 1 V i j I S Ψ i S Ω j )
B C F S W G B B C 11 , B B C 12 , , B B C g = ( j = 1 g i = 1 U i j R S Ψ i S Ω j + z j = 1 g i = 1 U i j I S Ψ i S Ω j , 1 + j = 1 g i = 1 1 + V i j R S Ψ i S Ω j + z 1 + j = 1 g i = 1 1 + V i j I S Ψ i S Ω j )
Step 3: Calculate the score data of each alternative:
S C B B C i j = 1 2 U i j R + V i j R + U i j I + V i j I 1 , 1
Step 4: Calculate the ranking data of the alternatives according to their score information and evaluate the best optimal.
Furthermore, we simplify the above techniques with some numerical data that aim to improve the risk assessment model for cyber security under the consideration of the initiated techniques to enhance the effectiveness of the presented operators. The major influence of this application is to improve the risk assessment technique for cyber security to simplify, identify, or assess cyber threats and complications. For this reason, we select the application of cyber security in the presence of initiated operators. Here are strategies to improve and refine the problem of cyber security risk assessment techniques with the following five alternatives, B B C 1 to B B C 5 , of cyber security risks:
(1)
Threat intelligence integration “ B B C 1 ”.
(2)
Vulnerability assessment “ B B C 2 ”.
(3)
Threat modeling “ B B C 3 ”.
(4)
Collaboration and information sharing “ B B C 4 ”.
(5)
Third-party risk management “ B B C 5 ”.
These five points represent the collection of alternatives, and for each alternative, we have the following four attributes ,   B A T 1 to B A T 4 , with growth analysis, social impact, political impact, and environmental impact. We then apply four parameters, e 1 (internet), e 2 (computers), e 3 (computer lab), and e 4 (specialists). Furthermore, we use the weight vector 0.3 ,   0.3 ,   0.2 ,   0.2 T for each attribute and also use the weight vector 0.2 ,   0.3 ,   0.4 ,   0.1 T for parameters. Finally, we illustrate the procedure of the MADM technique for addressing our application problem. For the given data shown in Table 3 for the first alternative (i.e., B B C 1 ), we can see that the B B C 1 supports the assertion that ( B B C 1 , e 1 ) is suitable at B A T 1 with 0.8 and disproves it with −0.2. However, the B B C 1 supports that the current status of ( B B C 1 , e 1 ) is suitable at B A T 1 with 0.7 and disproves it with −0.3. Thus, the first B B C 1 ’s information regarding ( B B C 1 , e 1 )’s suitability at B A T 1 is represented as 0.8 + z 0.7 , 0.2 + z 0.3 . Similarly, the others have the same interpretations. Therefore, the major steps of the MADM technique are listed as follows.
Step 1: Calculate the matrix of BCFS values, as shown in Table 3, Table 4, Table 5, Table 6 and Table 7, and if the matrix covers cost types of information, then we normalize the matrix:
N = U i j R + z U i j I , V i j R + z V i j I f o r   b e n e f i t 1 U i j R + z 1 U i j I , 1 V i j R + z 1 V i j I f o r   c o s t
Note that the information in Table 3, Table 4, Table 5, Table 6 and Table 7 is not required to be normalized.
Step 2: Calculate the aggregated values of the normalized matrix using the BCFSWA and BCFSWG operators, as shown in Table 8.
Step 3: Calculate the score data of each alternative, as shown in Table 9.
Step 4: Calculate the ranking data of the alternatives according to their score information and evaluate the best optimal, as shown in Table 10.
From the ranking in Table 10, we can see that the best one is B B C 1 based on our proposed BCFSWA and BCFSWG operators. This means that the term B B C 1 : threat intelligence integration” has the most impact on cyber security risks. In fact, according to our intuitive knowledge about the risk assessment for cyber security, “ B B C 1 :   threat intelligence integration” should be the most important among factors B B C 1 ~ B B C 5 . The final result based on the BCFSWA and BCFSWG operators is actually reasonable. Furthermore, we make comparisons between the proposed method and some existing techniques by using the above techniques and information from the above examples. For this, we discuss the comparative analysis in the next section.

5. Comparative Analysis

In this section, we aim to evaluate and discuss the comparisons between the proposed operators with some existing operators for addressing the supremacy and dominancy of the derived techniques. For this, our major influence is to collect some existing operators based on existing information and try to evaluate our selected information with the help of these operators. We use the following existing methods: Mardani et al. [19] considered aggregation operators (AOs) for FSs; Bi et al. [20] presented the geometric operators for CFSs; Hu et al. [21] introduced the power operators for CFSs; Mahmood et al. [22] derived the AOs for BCFSs; Despic and Simonovic [24] initiated the AOs for SSs; and Jana et al. [25] introduced the robust AOs for BFSSs. Based on the information and results in Table 1, Table 2, Table 3, Table 4 and Table 5 in Section 4, the comparative analysis is listed in Table 11.
From the rankings in Table 11, we observe that the best optimal is B B C 1 accordi to the BCFSWA and BCFSWG operators, which represents the threat intelligence integration. We also use Figure 1 to describe the geometrical interpretation of alternatives according to their score values, as shown in Table 11. We discuss the weakness of these existing techniques as follows.
(1)
Mardani et al. [19] proposed AOs for FSs, where the FS theory contains the truth grade from the unit interval. However, the proposed operators based on BCFSS information, which is an extended version of FS, demonstrate that the proposed theory of Mardani et al. [19] is a special case for the proposed operators.
(2)
Bi et al. [20] and Hu et al. [21] presented the GOs and power operators for CFSs, where the CFS theory contains the truth grade in the shape of a complex number whose real and imaginary parts are from the unit interval. In fact, the proposed operators based on BCFSS information not only contain the truth grade but also have the falsity grade, and so the proposed theory of Bi et al. [20] and Hu et al. [21] cannot handle these cases under the BCFSS environment.
(3)
Mahmood et al. [22] derived AOs for BCFSs (bipolar complex fuzzy sets) where the soft sets for parameter setting are not considered. Therefore, the proposed operators in Mahmood et al. [22] cannot handle these cases under the BCFSS environment.
(4)
Despic and Simonovic [24] initiated AOs for SSs that only contain the truth grade and no falsity grade. It means that the proposed AOs of Despic and Simonovic [24] are a special case of the proposed operators for BCFSSs.
(5)
Jana et al. [25] gave robust AOs for BFSSs (bipolar fuzzy soft sets) that can only be used in the real plane but not in a complex system, so they cannot handle these cases under the BCFSS environment.
Anyway, the existing techniques are not able to evaluate the information in Table 1, Table 2, Table 3, Table 4 and Table 5 because of many limitations and problems; the existing techniques are special cases of the proposed information. Therefore, the proposed operators based on BCFS information are reliable and dominant compared to existing techniques.

6. Conclusions

Bipolar complex fuzzy soft (BCFS) sets (BCFSSs) represent vague and unreliable information well in real-life problems. These FSs, BFSs, SSs, CFSs, BCFSs, FSSs, CFSSs, and BFSSs are the special parts of BCFSSs. After BCFSSs were considered by Mahmood et al. [9], there were still few works on aggregation operators (AOs) for BCFSSs in the literature. In this paper, we continue working on BCFSSs by giving operational laws for BCFSSs and then propose some AOs for BCFSSs. These are the BCFS weighted averaging (BCFSWA), BCFS ordered weighted averaging (BCFSOWA), BCFS weighted geometric (BCFSWG), and BCFS ordered weighted geometric (BCFSOWG) operators. We advance the theorems and properties of these proposed operators on BCFSSs. According to these proposed operators, we construct a MADM technique for evaluating some decision-making problems. We then apply it to improve the risk assessment model for cyber security based on the derived operators. We also make some comparisons of the proposed method with some existing methods in the literature to enhance the effectiveness, supremacy, and validity of these operators under BCFS information. In the future, we aim to improve the ideas of fuzzy N soft sets [27] and cubic bipolar fuzzy VIKOR [28] with the BCFSS extensions, evaluate more AOs based on these extended ideas, and then discuss more applications in AHP and TOPSIS decision making and optimization theory [29,30].

Author Contributions

Conceptualization, Z.A.; methodology, Z.A. and M.-S.Y.; formal analysis, Z.A. and M.-S.Y.; investigation, Z.A. and M.-S.Y.; writing—original draft preparation, Z.A.; writing—review and editing, M.-S.Y.; supervision, M.-S.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded in part by the National Science and Technology Council, Taiwan, under Grant NSTC 112-2118-M-033-004.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Chaomurilige, C.; Yu, J.; Yang, M.S. Analysis of parameter selection for Gustafson-Kessel fuzzy clustering using Jacobian matrix. IEEE Trans. Fuzzy Syst. 2015, 23, 2329–2342. [Google Scholar] [CrossRef]
  3. Ruspini, E.H.; Bezdek, J.C.; Keller, J.M. Fuzzy clustering: A historical perspective. IEEE Comput. Intell. Mag. 2019, 14, 45–55. [Google Scholar] [CrossRef]
  4. Yang, M.S.; Sinaga, K.P. Collaborative feature-weighted multi-view fuzzy c-means clustering. Pattern Recognit. 2021, 119, 108064. [Google Scholar] [CrossRef]
  5. Mei, Z.; Zhao, T.; Xie, X. Hierarchical fuzzy regression tree: A new gradient boosting approach to design a TSK fuzzy model. Inf. Sci. 2024, 652, 119740. [Google Scholar] [CrossRef]
  6. Zhang, W.R. Bipolar fuzzy sets and relations: A computational framework for cognitive modeling and multiagent decision analysis. In Proceedings of the NAFIPS/IFIS/NASA’94: Proceedings of the First International Joint Conference of The North American Fuzzy Information Processing Society Biannual Conference. The Industrial Fuzzy Control and Intellige, San Antonio, TX, USA, 18–21 December 1994; IEEE: New York, NY, USA, 1994; pp. 305–309. [Google Scholar]
  7. Zhang, W.R. From equilibrium-based business intelligence to information conservational quantum-fuzzy cryptography—A cellular transformation of bipolar fuzzy sets to quantum intelligence machinery. IEEE Trans. Fuzzy Syst. 2018, 26, 656–669. [Google Scholar] [CrossRef]
  8. Zararsız, Z.; Riaz, M. Bipolar fuzzy metric spaces with application. Comput. Appl. Math. 2022, 41, 49. [Google Scholar] [CrossRef]
  9. Rahman, Z.U.; Ali, G.; Asif, M.; Chen, Y.; Abidin, M.Z.U. Identification of desalination and wind power plants sites using m-polar fuzzy Aczel–Alsina aggregation information. Sci. Rep. 2024, 14, 409. [Google Scholar] [CrossRef] [PubMed]
  10. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  11. Mahmood, T.; Ur Rehman, U. A novel approach towards bipolar complex fuzzy sets and their applications in generalized similarity measures. Int. J. Intell. Syst. 2022, 37, 535–567. [Google Scholar] [CrossRef]
  12. Qiyas, M.; Naeem, M.; Khan, N.; Abdullah, L. Bipolar complex fuzzy credibility aggregation operators and their application in decision making problem. AIMS Math. 2023, 8, 19240–19263. [Google Scholar] [CrossRef]
  13. Gwak, J.; Garg, H.; Jan, N. Hybrid integrated decision-making algorithm for clustering analysis based on a bipolar complex fuzzy and soft sets. Alex. Eng. J. 2023, 67, 473–487. [Google Scholar] [CrossRef]
  14. Molodtsov, D. Soft set theory—First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  15. Roy, A.R.; Maji, P.K. A fuzzy soft set theoretic approach to decision making problems. J. Comput. Appl. Math. 2007, 203, 412–418. [Google Scholar] [CrossRef]
  16. Abdullah, S.; Aslam, M.; Ullah, K. Bipolar fuzzy soft sets and its applications in decision making problem. J. Intell. Fuzzy Syst. 2014, 27, 729–742. [Google Scholar] [CrossRef]
  17. Thirunavukarasu, P.; Suresh, R.; Ashokkumar, V. Theory of complex fuzzy soft set and its applications. Int. J. Innov. Res. Sci. Technol. 2017, 3, 13–18. [Google Scholar]
  18. Mahmood, T.; Ur Rehman, U.; Jaleel, A.; Ahmmad, J.; Chinram, R. Bipolar complex fuzzy soft sets and their applications in decision-making. Mathematics 2022, 10, 1048. [Google Scholar] [CrossRef]
  19. Mardani, A.; Nilashi, M.; Zavadskas, E.K.; Awang, S.R.; Zare, H.; Jamal, N.M. Decision making methods based on fuzzy aggregation operators: Three decades review from 1986 to 2017. Int. J. Inf. Technol. Decis. Mak. 2018, 17, 391–466. [Google Scholar] [CrossRef]
  20. Bi, L.; Dai, S.; Hu, B. Complex fuzzy geometric aggregation operators. Symmetry 2018, 10, 251. [Google Scholar] [CrossRef]
  21. Hu, B.; Bi, L.; Dai, S. Complex fuzzy power aggregation operators. Math. Probl. Eng. 2019, 2019, 1–7. [Google Scholar] [CrossRef]
  22. Mahmood, T.; Ur Rehman, U.; Ali, Z.; Aslam, M.; Chinram, R. Identification and classification of aggregation operators using bipolar complex fuzzy settings and their application in decision support systems. Mathematics 2022, 10, 1726. [Google Scholar] [CrossRef]
  23. Qiyas, M.; Naeem, M.; Khan, N.; Khan, S.; Khan, F. Confidence levels bipolar complex fuzzy aggregation operators and their application in decision making problem. IEEE Access 2024, 12, 6204–6214. [Google Scholar] [CrossRef]
  24. Despic, O.; Simonovic, S.P. Aggregation operators for soft decision making in water resources. Fuzzy Sets Syst. 2000, 115, 11–33. [Google Scholar] [CrossRef]
  25. Jana, C.; Pal, M.; Wang, J. A robust aggregation operator for multi-criteria decision-making method with bipolar fuzzy soft environment. Iran. J. Fuzzy Syst. 2019, 16, 1–16. [Google Scholar]
  26. Garg, H.; Mahmood, T.; ur Rehman, U.; Nguyen, G.N. Multi-attribute decision-making approach based on Aczel-Alsina power aggregation operators under bipolar fuzzy information and its application to quantum computing. Alex. Eng. J. 2023, 82, 248–259. [Google Scholar] [CrossRef]
  27. Akram, M.; Adeel, A.; Alcantud, J.C.R. Fuzzy N-soft sets: A novel model with applications. J. Intell. Fuzzy Syst. 2018, 35, 4757–4771. [Google Scholar] [CrossRef]
  28. Riaz, M.; Habib, A.; Saqlain, M.; Yang, M.S. Cubic bipolar fuzzy VIKOR method using new distance and entropy measures and Einstein averaging aggregation operators with application to renewable energy. Int. J. Fuzzy Syst. 2023, 25, 510–543. [Google Scholar] [CrossRef]
  29. Kahraman, C.; Cebi, S.; Oztaysi, B.; Cevik Onar, S. Intuitionistic fuzzy sets with ordered pairs and their usage in multi-attribute decision making: A novel intuitionistic fuzzy TOPSIS method with ordered pairs. Mathematics 2023, 11, 3867. [Google Scholar] [CrossRef]
  30. Alkan, N.; Kahraman, C. Continuous intuitionistic fuzzy sets (CINFUS) and their AHP&TOPSIS extension: Research proposals evaluation for grant funding. Appl. Soft Comput. 2023, 145, 110579. [Google Scholar]
Figure 1. Geometric representation of the information in Table 11 [19,20,21,22,25].
Figure 1. Geometric representation of the information in Table 11 [19,20,21,22,25].
Mathematics 12 00582 g001
Table 1. Representation of symbols with their meanings.
Table 1. Representation of symbols with their meanings.
SymbolsMeaningsSymbolsMeaningsSymbolsMeanings
Y A universal set U I The imaginary part of truth grade S C B B C i j Score value of B B C i j
A A set of parameters V R The real part of falsity grade A C B B C i j Accuracy value of B B C i j
E A subset of parameters V I The imaginary part of falsity grade S s c A scale number
U R The real part of truth grade y i An element of the universal set Y S Ω j and S Ψ i Weights
z = 1 The complex number i B B C i j A BCFSN e i A parameter   E
Table 2. BCFS decision matrix for expert one.
Table 2. BCFS decision matrix for expert one.
B B C 1 e 1 e 2 e 3 e 4
B A T 1 0.8 + z 0.7 , 0.2 + z 0.3 0.81 + z 0.71 , 0.21 + z 0.31 0.82 + z 0.72 , 0.22 + z 0.32 0.83 + z 0.73 , 0.23 + z 0.33
Table 3. BCFS decision matrix for the term one B B C 1 .
Table 3. BCFS decision matrix for the term one B B C 1 .
B B C 1 e 1 e 2 e 3 e 4
B A T 1 0.8 + z 0.7 , 0.2 + z 0.3 0.81 + z 0.71 , 0.21 + z 0.31 0.82 + z 0.72 , 0.22 + z 0.32 0.83 + z 0.73 , 0.23 + z 0.33
B A T 2 0.7 + z 0.3 , 0.3 + z 0.1 0.71 + z 0.31 , 0.31 + z 0.11 0.72 + z 0.32 , 0.32 + z 0.12 0.73 + z 0.33 , 0.33 + z 0.13
B A T 3 0.8 + z 0.4 , 0.4 + z 0.5 0.81 + z 0.41 , 0.41 + z 0.51 0.82 + z 0.42 , 0.42 + z 0.52 0.83 + z 0.43 , 0.43 + z 0.53
B A T 4 0.9 + z 0.3 , 0.7 + z 0.8 0.91 + z 0.31 , 0.71 + z 0.81 0.92 + z 0.32 , 0.72 + z 0.82 0.93 + z 0.33 , 0.73 + z 0.83
Table 4. BCFS decision matrix for the term two B B C 2 .
Table 4. BCFS decision matrix for the term two B B C 2 .
B B C 2 e 1 e 2 e 3 e 4
B A T 1 0.2 + z 0.3 , 0.4 + z 0.6 0.21 + z 0.31 , 0.41 + z 0.61 0.22 + z 0.32 , 0.42 + z 0.62 0.23 + z 0.33 , 0.43 + z 0.63
B A T 2 0.3 + z 0.4 , 0.6 + z 0.7 0.31 + z 0.41 , 0.61 + z 0.71 0.32 + z 0.42 , 0.62 + z 0.72 0.33 + z 0.43 , 0.63 + z 0.73
B A T 3 0.5 + z 0.6 , 0.7 + z 0.8 0.51 + z 0.61 , 0.71 + z 0.81 0.52 + z 0.62 , 0.72 + z 0.82 0.53 + z 0.63 , 0.73 + z 0.83
B A T 4 0.1 + z 0.2 , 0.8 + z 0.6 0.11 + z 0.21 , 0.81 + z 0.61 0.12 + z 0.22 , 0.82 + z 0.62 0.13 + z 0.23 , 0.83 + z 0.63
Table 5. BCFS decision matrix for the term three B B C 3 .
Table 5. BCFS decision matrix for the term three B B C 3 .
B B C 3 e 1 e 2 e 3 e 4
B A T 1 0.1 + z 0.5 , 0.3 + z 0.7 0.11 + z 0.51 , 0.31 + z 0.71 0.12 + z 0.52 , 0.32 + z 0.72 0.13 + z 0.53 , 0.33 + z 0.73
B A T 2 0.2 + z 0.6 , 0.4 + z 0.8 0.21 + z 0.61 , 0.41 + z 0.81 0.22 + z 0.62 , 0.42 + z 0.82 0.23 + z 0.63 , 0.43 + z 0.83
B A T 3 0.3 + z 0.7 , 0.5 + z 0.9 0.31 + z 0.71 , 0.51 + z 0.91 0.32 + z 0.72 , 0.52 + z 0.92 0.33 + z 0.73 , 0.53 + z 0.93
B A T 4 0.4 + z 0.8 , 0.6 + z 0.9 0.41 + z 0.81 , 0.61 + z 0.91 0.42 + z 0.82 , 0.62 + z 0.92 0.43 + z 0.83 , 0.63 + z 0.93
Table 6. BCFS decision matrix for the term four B B C 4 .
Table 6. BCFS decision matrix for the term four B B C 4 .
B B C 4 e 1 e 2 e 3 e 4
B A T 1 0.5 + z 0.1 , 0.3 + z 0.5 0.51 + z 0.11 , 0.31 + z 0.51 0.52 + z 0.12 , 0.32 + z 0.52 0.53 + z 0.13 , 0.33 + z 0.53
B A T 2 0.4 + z 0.2 , 0.4 + z 0.2 0.41 + z 0.21 , 0.41 + z 0.21 0.42 + z 0.22 , 0.42 + z 0.22 0.43 + z 0.23 , 0.43 + z 0.23
B A T 3 0.3 + z 0.3 , 0.5 + z 0.3 0.31 + z 0.31 , 0.51 + z 0.31 0.32 + z 0.32 , 0.52 + z 0.32 0.33 + z 0.33 , 0.53 + z 0.33
B A T 4 0.2 + z 0.6 , 0.8 + z 0.4 0.21 + z 0.61 , 0.81 + z 0.41 0.22 + z 0.62 , 0.82 + z 0.42 0.23 + z 0.63 , 0.83 + z 0.43
Table 7. BCFS decision matrix for the term five B B C 5 .
Table 7. BCFS decision matrix for the term five B B C 5 .
B B C 5 e 1 e 2 e 3 e 4
B A T 1 0.5 + z 0.2 , 0.7 + z 0.5 0.51 + z 0.21 , 0.71 + z 0.51 0.52 + z 0.22 , 0.72 + z 0.52 0.53 + z 0.23 , 0.73 + z 0.53
B A T 2 0.2 + z 0.3 , 0.7 + z 0.1 0.21 + z 0.31 , 0.71 + z 0.11 0.22 + z 0.32 , 0.72 + z 0.12 0.23 + z 0.33 , 0.73 + z 0.13
B A T 3 0.3 + z 0.4 , 0.9 + z 0.5 0.31 + z 0.41 , 0.91 + z 0.51 0.32 + z 0.42 , 0.92 + z 0.52 0.33 + z 0.43 , 0.93 + z 0.53
B A T 4 0.3 + z 0.5 , 0.7 + z 0.8 0.31 + z 0.51 , 0.71 + z 0.81 0.32 + z 0.52 , 0.72 + z 0.82 0.33 + z 0.53 , 0.73 + z 0.83
Table 8. BCFS aggregated information matrix.
Table 8. BCFS aggregated information matrix.
BCFSWA OperatorBCFSWG Operator
B B C 1 0.8034 + z 0.4583 , 0.3513 + z 0.3085 0.7906 + z 0.4121 , 0.4411 + z 0.4608
B B C 2 0.3690 + z 0.4721 , 0.6188 + z 0.7180 0.3186 + z 0.4280 , 0.6615 + z 0.7292
B B C 3 0.2587 + z 0.6659 , 0.4431 + z 0.8391 0.2334 + z 0.6463 , 0.4876 + z 0.8545
B B C 4 0.3799 + z 0.289 , 0.4558 + z 0.3162 0.3611 + z 0.2428 , 0.5236 + z 0.3425
B B C 5 0.3321 + z 0.3596 , 0.7870 + z 0.3406 0.3076 + z 0.3399 , 0.8133 + z 0.4704
Table 9. BCFS score information.
Table 9. BCFS score information.
BCFSWA OperatorBCFSWG Operator
B B C 1 0.3009 0.1504
B B C 2 0.2478 0.3220
B B C 3 0.1788 0.2311
B B C 4 0.0515 0.1310
B B C 5 0.2179 0.3181
Table 10. Representation of the ranking values.
Table 10. Representation of the ranking values.
MethodsRanking ValuesBest Optimal
BCFSWA Operator B B C 1 > B B C 4 > B B C 3 > B B C 5 > B B C 2 B B C 1
BCFSWG Operator B B C 1 > B B C 4 > B B C 3 > B B C 5 > B B C 2 B B C 1
Table 11. Representation of the comparative analysis.
Table 11. Representation of the comparative analysis.
MethodsScore ValuesRanking Values
Mardani et al. [19]FailedFailed
Bi et al. [20]FailedFailed
Hu et al. [21]FailedFailed
Mahmood et al. [22]FailedFailed
Despic and Simonovic [24]FailedFailed
Jana et al. [25]FailedFailed
BCFSWA Operator0.3009, −0.2478, −0.1788, −0.0515, −0.2179 B B C 1 > B B C 4 > B B C 3 > B B C 5 > B B C 2
BCFSWG Operator0.1504, −0.322, −0.2311, −0.131, −0.3181 B B C 1 > B B C 4 > B B C 3 > B B C 5 > B B C 2
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ali, Z.; Yang, M.-S. Improving Risk Assessment Model for Cyber Security Using Robust Aggregation Operators for Bipolar Complex Fuzzy Soft Inference Systems. Mathematics 2024, 12, 582. https://doi.org/10.3390/math12040582

AMA Style

Ali Z, Yang M-S. Improving Risk Assessment Model for Cyber Security Using Robust Aggregation Operators for Bipolar Complex Fuzzy Soft Inference Systems. Mathematics. 2024; 12(4):582. https://doi.org/10.3390/math12040582

Chicago/Turabian Style

Ali, Zeeshan, and Miin-Shen Yang. 2024. "Improving Risk Assessment Model for Cyber Security Using Robust Aggregation Operators for Bipolar Complex Fuzzy Soft Inference Systems" Mathematics 12, no. 4: 582. https://doi.org/10.3390/math12040582

APA Style

Ali, Z., & Yang, M. -S. (2024). Improving Risk Assessment Model for Cyber Security Using Robust Aggregation Operators for Bipolar Complex Fuzzy Soft Inference Systems. Mathematics, 12(4), 582. https://doi.org/10.3390/math12040582

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