Next Article in Journal
Maximizing Four-Wave Mixing in Four-Subband Semiconductor Quantum Wells with Optimal-Shortcut Spatially Varying Control Fields
Previous Article in Journal
Comparison of the Meta-Heuristic Algorithms for Maximum Likelihood Estimation of the Exponentially Modified Logistic Distribution
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Circular q-Rung Orthopair Fuzzy Sets with Dombi Aggregation Operators and Application to Symmetry Analysis in Artificial Intelligence

1
Department of Mathematics and Statistics, Riphah International University, Islamabad 44000, Pakistan
2
Department of Applied Mathematics, Chung Yuan Christian University, Chung-Li, Taoyuan 32023, Taiwan
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(3), 260; https://doi.org/10.3390/sym16030260
Submission received: 18 January 2024 / Revised: 14 February 2024 / Accepted: 18 February 2024 / Published: 20 February 2024

Abstract

:
Circular q-rung orthopair fuzzy sets (FSs) were recently considered as an extension of q-rung orthopair FSs (q-ROFSs), circular intuitionistic FSs (Cir-IFSs), and circular Pythagorean FSs (Cir-PFSs). However, they are only considered for some simple algebraic properties. In this paper, we advance the work on circular q-ROFSs (Cirq-ROFSs) in Dombi aggregation operators (AOs) with more mathematical properties of algebraic laws. These include the circular q-rung orthopair fuzzy (Cirq-ROF) Dombi weighted averaging (Cirq-ROFDWA), Cirq-ROF Dombi ordered weighted averaging (Cirq-ROFDOWA), Cirq-ROF Dombi weighted geometric (Cirq-ROFDWG), and Cirq-ROF Dombi ordered weighted geometric (Cirq-ROFDOWG) operators. Additionally, we present the properties of idempotency, monotonicity, and boundedness for the proposed operators. In the context of artificial intelligence, symmetry analysis plays a significant and efficient role that can refer to several aspects. Thus, to compute the major aspect, we identify the multi-attribute decision-making (MADM) technique based on the proposed operators for Cirq-ROF numbers (Cirq-ROFNs) to enhance the worth of the evaluated operators. Finally, we use some existing techniques for comparison to our results to show the validity and supremacy of the proposed method.

1. Introduction

Symmetry analysis in artificial intelligence [1] is a multi-dimensional technique that spans algorithm design, knowledge representation, data manipulation, and fairness selections [2]. Utilizing symmetry analysis methods can improve the capability, fairness, supremacy, and interpretability of artificial intelligence across many domains. Furthermore, these concepts have been utilized in many fields—for instance, machine learning, game theory, artificial intelligence, neural networks, data mining, and decision-making—under the consideration of the classical set theory [3]. Unfortunately, these procedures have lost a lot of information because of limited options with only zero and one. Therefore, a stronger idea is required to maintain more information. Zadeh [4] initiated a fuzzy set (FS) where the truth grade M Q C Q x ~ of an FS becomes M Q C Q x ~ 0,1 , and this FS theory has been applied in various fields [5,6,7]. Furthermore, Atanassov [8] modified the FS theory by adding another grade of falsity N Q C Q x ~ and initiated the idea of intuitionistic FS (IFS) with the condition that 0 M Q C Q + N Q C Q 1 . IFS has since been studied in different works [9,10,11]. However, in the presence of the pair 0.6,0.5 , the idea of IFS has not worked prominently. Therefore, Yager and Abbasov [12] presented the Pythagorean FS (PFS) with the new condition that 0 M Q C Q 2 + N Q C Q 2 1 , resulting in the PFS having different applications [13,14,15]. However, the PFS still fails in the presence of the pair 0.9,0.8 due to its limited features. Yager [16] then presented the idea of q-rung orthopair FSs (q-ROFSs) with a prominent and dominant condition of 0 M Q C Q q S C + N Q C Q q S C 1 , q S C 1 . These q-ROFSs have been applied in many areas [17,18,19]. Some specifications of q-ROFSs are listed in Table 1.
Table 1 contains the mathematical forms of FSs, IFSs, PFSs, and q-ROFSs. The IFS theory and its applications have been widely used in many areas because the computed structure of an FS is very reliable and dominant due to its features. However, finding the radius between the truth and the falsity grade is very complicated because no one can do it yet. After a long assessment, we noticed that the idea of circular IFS (Cir-IFS) was presented by Atanassov [20], where the truth grade, the falsity grade, and the radius of a circle around the point of both grades are also the major parts of Cir-IFS. Furthermore, Bozyigit et al. [21] proposed the circular PFS (Cir-PFS) as an extension of Cir-IFS, in which Cir-PFS contains the truth grade, represented by M Q C Q x ~ , and the falsity grade is shown by N Q C Q x ~ under the condition of 0 M Q C Q 2 + N Q C Q 2 1 , with the radius R Q C Q 0,1 of a circle around the point M Q C Q x ~ , N Q C Q x ~ on the plane. Cir-IFSs and Cir-PFSs had some applications in [22,23,24,25]. Recently, Yusoff et al. [26] extended Cir-PFS to circular q-ROFSs (Cirq-ROFSs), which have a condition of 0 M Q C Q q S C + N Q C Q q S C 1 , q S C 1 with a radius of a circle around the point M Q C Q x ~ , N Q C Q x ~ with R Q C Q 0,1 , and then gave some simple algebraic properties. Since Cirq-ROFSs are a new form, there is no further research on Cirq-ROFSs in the literature. It is known that Dombi [27] initiated the new concept of t-norm and t-conorm in 1982, calling them the Dombi t-norm (DTN) and the Dombi t-conorm (DTCN). Based on the above DTN and DTCN, some kinds of operators have been derived by different scholars. Khan et al. [28] gave the Dombi operators based on PFSs. Jana et al. [29] initiated the Dombi operators for q-ROFSs and their applications. Du [30] evaluated Dombi aggregation operators (AOs) for q-ROFSs. Seikh and Mandal [31] examined Dombi operators for IFSs. In this paper, we advance the study of Cirq-ROFSs in Dombi AOs. These include the circular q-rung orthopair fuzzy (Cirq-ROF) Dombi weighted averaging (Cirq-ROFDWA), Cirq-ROF Dombi ordered weighted averaging (Cirq-ROFDOWA), Cirq-ROF Dombi weighted geometric (Cirq-ROFDWG), and Cirq-ROF Dombi ordered weighted geometric (Cirq-ROFDOWG) operators. We then consider the mathematical properties of these proposed operators, such as idempotency, monotonicity, and boundedness. Some specifications of the Cirq-ROFSs are listed in Table 2.
The demonstration in Table 1 and Table 2 with different parameters and conditions shows the advantages and disadvantages of these extended types of FSs. Thus, the major contributions of this paper are listed below:
(1)
Identification of the novel technique of Cirq-ROFSs with their flexible properties, such as algebraic laws and Dombi laws.
(2)
Proposal of the Cirq-ROFDWA, Cirq-ROFDOWA, Cirq-ROFDWG, and Cirq-ROF-DOWG operators with their properties, such as idempotency, monotonicity, and boundedness.
(3)
Creation of the multi-attribute decision-making (MADM) technique based on the proposed operators for Cirq-ROF numbers (Cirq-ROFNs) with application to the symmetry analysis in artificial intelligence to compute its major aspects.
(4)
Use of some existing techniques for comparison to our results to show the validity and supremacy of the proposed method.
The remainder of this paper is as follows. In Section 2, we review the DTN and DTCN with q-ROFSs and their operational laws for any universal set. In Section 3, we identify the novel technique of Cirq-ROFSs and their flexible properties, such as algebraic laws and Dombi laws. In Section 4, we propose the Cirq-ROFDWA, Cirq-ROFDOWA, Cirq-ROFDWG, and Cirq-ROFDOWG operators with some basic properties. In the context of artificial intelligence, symmetry analysis can refer to several aspects. Therefore, in Section 5, to compute the major aspect, we create the MADM technique based on the initiated operators for Cirq-ROFNs to enhance the worth of the proposed operators. In Section 6, we illustrate some numerical examples. In Section 7, we use existing techniques for comparison to our results to show the validity and supremacy of the presented theory. Some concluding remarks are stated in Section 8.

2. Preliminaries

This section discusses the DTN and DTCN with q-ROFSs and their operational laws for any universal set.
Definition 1
([27]). Let  f R N , g R N 0,1  with  σ S C 1 . Then
D O M f R N , g R N = 1 1 + 1 f R N f R N σ S C + 1 g R N g R N σ S C σ S C
D O M c f R N , g R N = 1 1 1 + f R N 1 f R N σ S C + g R N 1 g R N σ S C σ S C
Thus, algebraic norms are special cases of the above norms. We next talk about the existing techniques, called q-ROFSs, and discuss their operational laws.
Definition 2
([16]). Let  X U N I  be a universe of discourse. The q-ROFS is defined below:
Q C Q = x ~ , M Q C Q x ~ , N Q C Q x ~ : x ~ X U N I
where the truth grade is represented by M Q C Q x ~  and the falsity grade is shown by  N Q C Q x ~  with  0 M Q C Q q S C + N Q C Q q S C 1 , q S C 1 . Further, the refusal grade is represented by R C Q x ~ = 1 M Q C Q q S C + N Q C Q q S C 1 / q S C ,  where the mathematical shape of q-ROFN is stated by  Q j = M Q j , N Q j , j = 1,2 , , n .
Definition 3
([16]). Let Q j = M Q j , N Q j , j = 1,2 , , n be a family of q-ROFNs. Then
Q 1 Q 2 = M Q 1 q S C + M Q 2 q S C M Q 1 q S C M Q 2 q S C 1 q S C , N Q 1 N Q 2
Q 1 Q 2 = M Q 1 M Q 2 , N Q 1 q S C + N Q 2 q S C N Q 1 q S C N Q 2 q S C 1 q S C
ϱ S C Q j = 1 1 M Q j q S C ϱ S C 1 q S C , N Q j ϱ S C
Q j ϱ S C = M Q j ϱ S C , 1 1 N Q j q S C ϱ S C 1 q S C
Definition 4
([16]). Let Q j = M Q j , N Q j , j = 1,2 , , n be a family of q-ROFNs. Then, the score value S C O Q j and the accuracy value S C O Q j are defined as:
S C O Q j = M Q j q S C N Q j q S C 1,1
A C C Q j = M Q j q S C + N Q j q S C 0,1
The score value and accuracy value have the following properties:
(1) 
If  S C O Q 1 > S C O Q 2 , then  Q 1 > Q 2 .
(2) 
If  S C O Q 1 < S C O Q 2 , then  Q 1 < Q 2 .
(3) 
I f   S C O Q 1 = S C O Q 2 ,   t h e n   w e   h a v e :
(i). 
If  A C C Q 1 > A C C Q 2 , then  Q 1 > Q 2 .
(ii). 
If  A C C Q 1 < A C C Q 2 , then  Q 1 < Q 2 .

3. Circular q-ROFSs with Their Dombi Operational Laws

In this section, we first review the definition of circular q-ROFSs (Cirq-ROFSs). We then consider the novel techniques of Cirq-ROFSs with their operational laws. Moreover, we also evaluate some Dombi operational laws for Cirq-ROFNs with some properties.
Definition 5
([26]). Let X U N I be a universe of discourse. The Cirq-ROFS is defined as
Q C Q = x ~ , M Q C Q x ~ , N Q C Q x ~ , R Q C Q x ~ : x ~ X U N I
where the truth grade is represented by M Q C Q x ~ and the falsity grade is shown by N Q C Q x ~  with  0 M Q C Q q S C + N Q C Q q S C 1 , q S C 1 ,  and  R Q C Q x ~  represents the radius of the circle around the point ( M Q C Q x ~ , N Q C Q x ~ ) on the plane. The refusal grade is presented by R C Q x ~ = 1 M Q C Q q S C + N Q C Q q S C 1 / q S C , where the mathematical shape of the Cirq-ROFN is stated by  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n .
We mention that Definition 5 is more general than the original Cirq-ROFS defined in Yusoff et al. [26]. In Defintion 5, we consider that the radius  R Q C Q x ~  depends on  x ~ X U N I .  In fact, when  R Q C Q x ~ = R Q C Q  (a constant) for all  x ~ X U N I ,  it is the same Cirq-ROFS as defined in Yusoff et al. [26].
Definition 6
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then
Q 1 t c Q 2 = M Q 1 q S C + M Q 2 q S C M Q 1 q S C M Q 2 q S C 1 q S C , N Q 1 N Q 2 , R Q 1 q S C + R Q 2 q S C R Q 1 q S C R Q 2 q S C 1 q S C ;
Q 1 t Q 2 = M Q 1 q S C + M Q 2 q S C M Q 1 q S C M Q 2 q S C 1 q S C , N Q 1 N Q 2 , R Q 1 R Q 2 ;
Q 1 t c Q 2 = M Q 1 M Q 2 , N Q 1 q S C + N Q 2 q S C N Q 1 q S C N Q 2 q S C 1 q S C , R Q 1 R Q 2 ;
Q 1 t Q 2 = M Q 1 M Q 2 , N Q 1 q S C + N Q 2 q S C N Q 1 q S C N Q 2 q S C 1 q S C , R Q 1 q S C + R Q 2 q S C R Q 1 q S C R Q 2 q S C 1 q S C ;
ϱ S C Q j t c = 1 1 M Q j q S C ϱ S C 1 q S C , N Q j ϱ S C , 1 1 R Q j q S C ϱ S C 1 q S C ;
ϱ S C Q j t = 1 1 M Q j q S C ϱ S C 1 q S C , N Q j ϱ S C , R Q j ϱ S C ;
Q j t c ϱ S C = M Q j ϱ S C , 1 1 N Q j q S C ϱ S C 1 q S C , R Q j ϱ S C ;
Q j t ϱ S C = M Q j ϱ S C , 1 1 N Q j q S C ϱ S C 1 q S C , 1 1 R Q j q S C ϱ S C 1 q S C .
These defined equations in Definition 6 are the newly proposed basic operators for Cirq-ROFSs. We next propose some new Dombi operational laws for Cirq-ROFNs in Definition 7 as follows.
Definition 7
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then, Dombi operational laws are as follows:
Q 1 t c Q 2 = 1 1 / 1 + M Q 1 q S C 1 M Q 1 q S C σ S C + M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 N Q 1 q S C N Q 1 q S C σ S C + 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + R Q 1 q S C 1 R Q 1 q S C σ S C + R Q 2 q S C 1 R Q 2 q S C σ S C 1 σ S C 1 q S C ;
Q 1 t Q 2 = 1 1 / 1 + M Q 1 q S C 1 M Q 1 q S C σ S C + M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 N Q 1 q S C N Q 1 q S C σ S C + 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 R Q 1 q S C R Q 1 q S C σ S C + 1 R Q 2 q S C R Q 2 q S C σ S C 1 σ S C 1 q S C , ;
Q 1 t c Q 2 = 1 / 1 + 1 M Q 1 q S C M Q 1 q S C σ S C + 1 M Q 2 q S C M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + N Q 1 q S C 1 N Q 1 q S C σ S C + N Q 2 q S C 1 N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 R Q 1 q S C R Q 1 q S C σ S C + 1 R Q 2 q S C R Q 2 q S C σ S C 1 σ S C 1 q S C
Q 1 t Q 2 = 1 / 1 + 1 M Q 1 q S C M Q 1 q S C σ S C + 1 M Q 2 q S C M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + N Q 1 q S C 1 N Q 1 q S C σ S C + N Q 2 q S C 1 N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + R Q 1 q S C 1 R Q 1 q S C σ S C + R Q 2 q S C 1 R Q 2 q S C σ S C 1 σ S C 1 q S C
ϱ S C Q 1 t c = 1 1 / 1 + ϱ S C M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C
ϱ S C Q 1 t = 1 1 / 1 + ϱ S C M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 R Q 1 q S C R Q 1 q S C σ S C 1 σ S C 1 q S C
Q 1 t c ϱ S C = 1 / 1 + ϱ S C 1 M Q 1 q S C M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C N Q 1 q S C 1 N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 R Q 1 q S C R Q 1 q S C σ S C 1 σ S C 1 q S C
Q 1 t ϱ S C = 1 / 1 + ϱ S C 1 M Q 1 q S C M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C N Q 1 q S C 1 N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C
Theorem 1.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then, we have the following results:
(1) 
Q 1 t c Q 2 = Q 2 t c Q 1 .
(2) 
Q 1 t c Q 2 = Q 2 t c Q 1 .
(3) 
ϱ S C Q 1 t c ϱ S C Q 2 = ϱ S C Q 1 t c Q 2 .
(4) 
Q 1 ϱ S C t c Q 2 ϱ S C = Q 1 t c Q 2 ϱ S C .
(5) 
ϱ S C 1 Q 1 t c ϱ S C 2 Q 1 = ϱ S C 1 + ϱ S C 2 Q 1 .
(6) 
Q 1 ϱ S C 1 t c Q 1 ϱ S C 1 = Q 1 ϱ S C 1 + ϱ S C 2 .
Proof. 
(1)
Based on Definition 7, we obtain:
Q 1 t c Q 2 = 1 1 / 1 + M Q 1 q S C 1 M Q 1 q S C σ S C + M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 N Q 1 q S C N Q 1 q S C σ S C + 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + R Q 1 q S C 1 R Q 1 q S C σ S C + R Q 2 q S C 1 R Q 2 q S C σ S C 1 σ S C 1 q S C = 1 1 / 1 + M Q 2 q S C 1 M Q 2 q S C σ S C + M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 N Q 2 q S C N Q 2 q S C σ S C + 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + R Q 2 q S C 1 R Q 2 q S C σ S C + R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C = Q 2 t c Q 1 .
(2)
Omitted because it is similar to step 1.
(3)
Based on Definition 7, we obtain:
ϱ S C Q 1 t c ϱ S C Q 2 = 1 1 / 1 + ϱ S C M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C t c 1 1 / 1 + ϱ S C M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C R Q 2 q S C 1 R Q 2 q S C σ S C 1 σ S C 1 q S C = 1 1 / 1 + ϱ S C M Q 1 q S C 1 M Q 1 q S C σ S C + M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 N Q 1 q S C N Q 1 q S C σ S C + 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C R Q 1 q S C 1 R Q 1 q S C σ S C + R Q 2 q S C 1 R Q 2 q S C σ S C 1 σ S C 1 q S C = ϱ S C Q 1 t c Q 2 .
(4)
Omitted because it is similar to step 3.
(5)
Based on Definition 7, we obtain:
ϱ S C 1 Q 1 t c ϱ S C 2 Q 1 = 1 1 / 1 + ϱ S C 1 M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C 1 R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C t c 1 1 / 1 + ϱ S C 2 M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 2 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C 2 R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C = 1 1 / 1 + ϱ S C 1 + ϱ S C 2 M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 + ϱ S C 2 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ S C 1 + ϱ S C 2 R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C = ϱ S C 1 + ϱ S C 2 Q 1 .
(6)
Omitted because it is similar to step 5. □
Theorem 2.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then
(1) 
Q 1 t Q 2 = Q 2 t Q 1 .
(2) 
Q 1 t Q 2 = Q 2 t Q 1 .
(3) 
ϱ S C Q 1 t ϱ S C Q 2 = ϱ S C Q 1 t Q 2 .
(4) 
Q 1 ϱ S C t Q 2 ϱ S C = Q 1 t c Q 2 ϱ S C .
(5) 
ϱ S C 1 Q 1 t ϱ S C 2 Q 1 = ϱ S C 1 + ϱ S C 2 Q 1 .
(6) 
Q 1 ϱ S C 1 t Q 1 ϱ S C 1 = Q 1 ϱ S C 1 + ϱ S C 2 .
Proof. 
(1)
Based on Definition 7, we obtain:
Q 1 t Q 2 = 1 1 / 1 + M Q 1 q S C 1 M Q 1 q S C σ S C + M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 N Q 1 q S C N Q 1 q S C σ S C + 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 R Q 1 q S C R Q 1 q S C σ S C + 1 R Q 2 q S C R Q 2 q S C σ S C 1 σ S C 1 q S C = 1 1 / 1 + M Q 2 q S C 1 M Q 2 q S C σ S C + M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 N Q 2 q S C N Q 2 q S C σ S C + 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + 1 R Q 2 q S C R Q 2 q S C σ S C + 1 R Q 1 q S C R Q 1 q S C σ S C 1 σ S C 1 q S C = Q 2 t Q 1 .
(2)
Omitted because it is similar to step 1.
(3)
Based on Definition 7, we obtain:
ϱ S C Q 1 t ϱ S C Q 2 = 1 1 / 1 + ϱ S C M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 R Q 1 q S C R Q 1 q S C σ S C 1 σ S C 1 q S C t 1 1 / 1 + ϱ S C M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 R Q 2 q S C R Q 2 q S C σ S C 1 σ S C 1 q S C = 1 1 / 1 + ϱ S C M Q 1 q S C 1 M Q 1 q S C σ S C + M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 N Q 1 q S C N Q 1 q S C σ S C + 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 R Q 1 q S C R Q 1 q S C σ S C + 1 R Q 2 q S C R Q 2 q S C σ S C 1 σ S C 1 q S C = ϱ S C Q 1 t Q 2 .
(4)
Omitted because it is similar to step 3.
(5)
Based on Definition 7, we obtain:
ϱ S C 1 Q 1 t ϱ S C 2 Q 1 = 1 1 / 1 + ϱ S C 1 M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 1 R Q 1 q S C R Q 1 q S C σ S C 1 σ S C 1 q S C t 1 1 / 1 + ϱ S C 2 M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 2 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 2 1 R Q 1 q S C R Q 1 q S C σ S C 1 σ S C 1 q S C = 1 1 / 1 + ϱ S C 1 + ϱ S C 2 M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 + ϱ S C 2 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ S C 1 + ϱ S C 2 1 R Q 1 q S C R Q 1 q S C σ S C 1 σ S C 1 q S C = ϱ S C 1 + ϱ S C 2 Q 1 .
(6)
Omitted because it is similar to step 5. □

4. Cirq-ROF Dombi Averaging/Geometric Aggregation Operators

This section introduces the Cirq-ROFDWA operator, Cirq-ROFDOWA operator, Cirq-ROFDWG operator, and Cirq-ROFDOWG operator. Further, we evaluate their properties of idempotency, monotonicity, and boundedness.
Definition 8.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then
C i r q R O F D W A t c Q 1 , Q 2 , , Q n = ϱ 1 Q 1 t c t c ϱ 2 Q 2 t c t c t c ϱ n Q n t c = t c j = 1 n ϱ j Q j t c ;
C i r q R O F D W A t Q 1 , Q 2 , , Q n = ϱ 1 Q 1 t c t ϱ 2 Q 2 t c t t ϱ n Q n t c = t j = 1 n ϱ j Q j t c .
These are signified as a Cirq-ROFDWA operator for both t-conorm and t-norm, where the weight vector is represented by   ϱ j 0,1  with  j = 1 n ϱ j = 1 .
Theorem 3.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then, we show that the final result of the Cirq-ROFDWA operator for t-conorm and t-norm is again a Cirq-ROFN:
C i r q R O F D W A t c Q 1 , Q 2 , , Q n = 1 1 / 1 + j = 1 n ϱ j M Q j q S C 1 M Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 n ϱ j 1 N Q j q S C N Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 n ϱ j R Q j q S C 1 R Q j q S C σ S C 1 σ S C 1 q S C ;
C i r q R O F D W A t Q 1 , Q 2 , , Q n = 1 1 / 1 + j = 1 n ϱ j M Q j q S C 1 M Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 n ϱ j 1 N Q j q S C N Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 n ϱ j 1 R Q j q S C R Q j q S C σ S C 1 σ S C 1 q S C .
Proof. 
In the presence of the induction of mathematics, we evaluate our results. To do so, first, we derive it for n = 2 .
ϱ 1 Q 1 t c = 1 1 / 1 + ϱ 1 M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ 1 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ 1 R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C ,
and
ϱ 2 Q 2 t c = 1 1 / 1 + ϱ 2 M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ 2 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ 2 R Q 2 q S C 1 R Q 2 q S C σ S C 1 σ S C 1 q S C .
Thus,
C i r q R O F D W A t Q 1 , Q 2 = ϱ 1 Q 1 t c t c ϱ 1 Q 1 t c = 1 1 / 1 + ϱ 1 M Q 1 q S C 1 M Q 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ 1 1 N Q 1 q S C N Q 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ 1 R Q 1 q S C 1 R Q 1 q S C σ S C 1 σ S C 1 q S C t c 1 1 / 1 + ϱ 2 M Q 2 q S C 1 M Q 2 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ 2 1 N Q 2 q S C N Q 2 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ 2 R Q 2 q S C 1 R Q 2 q S C σ S C 1 σ S C 1 q S C = 1 1 / 1 + j = 1 2 ϱ j M Q j q S C 1 M Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 2 ϱ j 1 N Q j q S C N Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 2 ϱ j R Q j q S C 1 R Q j q S C σ S C 1 σ S C 1 q S C
For our considered value, it has been done. For n = m , we have
C i r q R O F D W A t c Q 1 , Q 2 , , Q m = 1 1 / 1 + j = 1 m ϱ j M Q j q S C 1 M Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 m ϱ j 1 N Q j q S C N Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 m ϱ j R Q j q S C 1 R Q j q S C σ S C 1 σ S C 1 q S C
Then, we derive our target for n = m + 1 .
C i r q R O F D W A t c Q 1 , Q 2 , , Q m + 1 = C i r q R O F D W A t c Q 1 , Q 2 , , Q m t c ϱ m + 1 Q m + 1 t c = 1 1 / 1 + j = 1 m ϱ j M Q j q S C 1 M Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 m ϱ j 1 N Q j q S C N Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 m ϱ j R Q j q S C 1 R Q j q S C σ S C 1 σ S C 1 q S C t c ϱ m + 1 Q m + 1 t c = 1 1 / 1 + j = 1 m ϱ j M Q j q S C 1 M Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 m ϱ j 1 N Q j q S C N Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 m ϱ j R Q j q S C 1 R Q j q S C σ S C 1 σ S C 1 q S C t c 1 1 / 1 + ϱ m + 1 M Q m + 1 q S C 1 M Q m + 1 q S C σ S C 1 σ S C 1 q S C , 1 / 1 + ϱ m + 1 1 N Q m + 1 q S C N Q m + 1 q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + ϱ m + 1 R Q m + 1 q S C 1 R Q m + 1 q S C σ S C 1 σ S C 1 q S C = 1 1 / 1 + j = 1 m + 1 ϱ j M Q j q S C 1 M Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 m + 1 ϱ j 1 N Q j q S C N Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 m + 1 ϱ j R Q j q S C 1 R Q j q S C σ S C 1 σ S C 1 q S C
Hence, our results are proven for all non-negative integers. Similarly, we follow the same procedure to obtain our major target: C i r q R O F D W A t Q 1 , Q 2 , , Q n . The proof is completed. □
Property 1.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then
(1) 
(Idempotency) If  Q j = Q = M Q , N Q , R Q , j = 1,2 , , n , then
C i r q R O F D W A t c Q 1 , Q 2 , , Q n = Q ;
C i r q R O F D W A t Q 1 , Q 2 , , Q n = Q .
(2) 
(Monotonicity) If  Q j Q j # , j = 1,2 , , n , then
C i r q R O F D W A t c Q 1 , Q 2 , , Q n C i r q R O F D W A t c Q 1 # , Q 2 # , , Q n # ;
C i r q R O F D W A t Q 1 , Q 2 , , Q n C i r q R O F D W A t Q 1 # , Q 2 # , , Q n # .
(3) 
(Boundedness) If  Q j t c = min M Q j , max N Q j , min R Q j , Q j t = min M Q j , max N Q j , max R Q j  and  Q j + t c = max M Q j , min N Q j , min R Q j ,   Q j + t = max M Q j , min N Q j , max R Q j , then
Q j t c C i r q R O F D W A t c Q 1 , Q 2 , , Q n Q j + t c ;
Q j t c C i r q R O F D W A t Q 1 , Q 2 , , Q n Q j + t c .
Proof. 
The proofs are straightforward. □
Definition 9.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then,
C i r q R O F D O W A t c Q 1 , Q 2 , , Q n = ϱ 1 Q o 1 t c t c ϱ 2 Q o 2 t c t c t c ϱ n Q o n t c = t c j = 1 n ϱ j Q o j t c ;
C i r q R O F D O W A t Q 1 , Q 2 , , Q n = ϱ 1 Q o 1 t t ϱ 2 Q o 2 t t t ϱ n Q o n t = t j = 1 n ϱ j Q o j t
These are signified as a Cirq-ROFDOWA operator for both t-conorm and t-norm, where the weight vector is represented by  ϱ j 0,1  with  j = 1 n ϱ j = 1  with an order  o j o j 1 .
Theorem 4.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be a family of Cirq-ROFNs. Then, we show that the final result of the Cirq-ROFDOWA operator for t-conorm and t-norm is again a Cirq-ROFN:
C i r q R O F D O W A t c Q 1 , Q 2 , , Q n = 1 1 / 1 + j = 1 n ϱ j M Q o j q S C 1 M Q o j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 n ϱ j 1 N Q o j q S C N Q o j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 n ϱ j R Q o j q S C 1 R Q o j q S C σ S C 1 σ S C 1 q S C
C i r q R O F D O W A t Q 1 , Q 2 , , Q n = 1 1 / 1 + j = 1 n ϱ j M Q o j q S C 1 M Q o j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 n ϱ j 1 N Q o j q S C N Q o j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 n ϱ j 1 R Q o j q S C R Q o j q S C σ S C 1 σ S C 1 q S C
Proof. 
The proof is similar to Theorem 3. □
Property 2.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be family of Cirq-ROFNs. Then
(1) 
(Idempotency) If  Q j = Q = M Q , N Q , R Q , j = 1,2 , , n , then
C i r q R O F D O W A t c Q 1 , Q 2 , , Q n = Q ;
C i r q R O F D O W A t Q 1 , Q 2 , , Q n = Q .
(2) 
(Monotonicity) If  Q j Q j # , j = 1,2 , , n , then
C i r q R O F D O W A t c Q 1 , Q 2 , , Q n C i r q R O F D O W A t c Q 1 # , Q 2 # , , Q n # ;
C i r q R O F D O W A t Q 1 , Q 2 , , Q n C i r q R O F D O W A t Q 1 # , Q 2 # , , Q n # .
(3) 
(Boundedness) If  Q j t c = min M Q j , max N Q j , min R Q j , Q j t = min M Q j , max N Q j , max R Q j  and  Q j + t c = max M Q j , min N Q j , min R Q j ,   Q j + t = max M Q j , min N Q j , max R Q j , then
Q j t c C i r q R O F D O W A t c Q 1 , Q 2 , , Q n Q j + t c ;
Q j t c C i r q R O F D O W A t Q 1 , Q 2 , , Q n Q j + t c .
Proof. 
The proofs are straightforward. □
Definition 10.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be family of Cirq-ROFNs. Then
C i r q R O F D W G t c Q 1 , Q 2 , , Q n = Q 1 t c ϱ 1 t c Q 2 t c ϱ 2 t c t c Q n t c ϱ n = t c j = 1 n Q j t c ϱ j ;
C i r q R O F D W G t Q 1 , Q 2 , , Q n = Q 1 t ϱ 1 t Q 2 t ϱ 2 t t Q n t ϱ n = t j = 1 n Q j t ϱ j .
 These are signified as a Cirq-ROFDWG operator for both t-conorm and t-norm, where the weight vector is represented by  ϱ j 0,1  with  j = 1 n ϱ j = 1 .
Theorem 5.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be family of Cirq-ROFNs. Then, we show that the final result of the Cirq-ROFDWG operator for t-conorm and t-norm is again a Cirq-ROFN:
C i r q R O F D W G t c Q 1 , Q 2 , , Q n = 1 / 1 + j = 1 n ϱ j 1 M Q j q S C M Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 n ϱ j N Q j q S C 1 N Q j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 n ϱ j 1 R Q j q S C R Q j q S C σ S C 1 σ S C 1 q S C
C i r q R O F D W G t Q 1 , Q 2 , , Q n = 1 / 1 + j = 1 n ϱ j 1 M Q j q S C M Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 n ϱ j N Q j q S C 1 N Q j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 n ϱ j R Q j q S C 1 R Q j q S C σ S C 1 σ S C 1 q S C
Proof. 
The proof is similar to Theorem 3. □
Property 3.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be family of Cirq-ROFNs. Then
(1) 
(Idempotency) If  Q j = Q = M Q , N Q , R Q , j = 1,2 , , n , then
C i r q R O F D W G t c Q 1 , Q 2 , , Q n = Q ;
C i r q R O F D W G t Q 1 , Q 2 , , Q n = Q .
(2) 
(Monotonicity) If  Q j Q j # , j = 1,2 , , n , then
C i r q R O F D W G t c Q 1 , Q 2 , , Q n C i r q R O F D W G t c Q 1 # , Q 2 # , , Q n # ;
C i r q R O F D W G t Q 1 , Q 2 , , Q n C i r q R O F D W G t Q 1 # , Q 2 # , , Q n # .
(3) 
(Boundedness) If  Q j t c = min M Q j , max N Q j , min R Q j , Q j t = min M Q j , max N Q j , max R Q j and Q j + t c = max M Q j , min N Q j , min R Q j ,   Q j + t = max M Q j , min N Q j , max R Q j , then
Q j t c C i r q R O F D W G t c Q 1 , Q 2 , , Q n Q j + t c ;
Q j t c C i r q R O F D W G t Q 1 , Q 2 , , Q n Q j + t c .
Proof. 
The proofs are straightforward. □
Definition 11.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be family of Cirq-ROFNs. Then
C i r q R O F D O W G t c Q 1 , Q 2 , , Q n = Q o 1 t c ϱ 1 t c Q o 2 t c ϱ 2 t c t c Q o n t c ϱ n = t c j = 1 n Q o j t c ϱ j ;
C i r q R O F D O W G t Q 1 , Q 2 , , Q n = Q o 1 t ϱ 1 t Q o 2 t ϱ 2 t t Q o n t ϱ n = t j = 1 n Q o j t ϱ j
These are signified as a Cirq-ROFDOWG operator for both t-conorm and t-norm, where the weight vector is represented by  ϱ j 0,1  with  j = 1 n ϱ j = 1  with order  o j o j 1 .
Theorem 6.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be family of Cirq-ROFNs. Then, we show that the final result of the Cirq-ROFDOWG operator for t-conorm and t-norm is again a Cirq-ROFN:
C i r q R O F D O W G t c Q 1 , Q 2 , , Q n = 1 / 1 + j = 1 n ϱ j 1 M Q o j q S C M Q o j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 n ϱ j N Q o j q S C 1 N Q o j q S C σ S C 1 σ S C 1 q S C , 1 / 1 + j = 1 n ϱ j 1 R Q o j q S C R Q o j q S C σ S C 1 σ S C 1 q S C
C i r q R O F D O W G t Q 1 , Q 2 , , Q n = 1 / 1 + j = 1 n ϱ j 1 M Q o j q S C M Q o j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 n ϱ j N Q o j q S C 1 N Q o j q S C σ S C 1 σ S C 1 q S C , 1 1 / 1 + j = 1 n ϱ j R Q o j q S C 1 R Q o j q S C σ S C 1 σ S C 1 q S C
Proof. 
The proof is similar to Theorem 3. □
Property 4.
Let  Q j = M Q j , N Q j , R Q j , j = 1,2 , , n  be family of Cirq-ROFNs. Then
(1) 
(Idempotency) If  Q j = Q = M Q , N Q , R Q , j = 1,2 , , n , then
C i r q R O F D O W G t c Q 1 , Q 2 , , Q n = Q ;
C i r q R O F D O W G t Q 1 , Q 2 , , Q n = Q .
(2) 
(Monotonicity) If  Q j Q j # , j = 1,2 , , n , then
C i r q R O F D O W G t c Q 1 , Q 2 , , Q n C i r q R O F D O W G t c Q 1 # , Q 2 # , , Q n # ;
C i r q R O F D O W G t Q 1 , Q 2 , , Q n C i r q R O F D O W G t Q 1 # , Q 2 # , , Q n # .
(3) 
(Boundedness) If  Q j t c = min M Q j , max N Q j , min R Q j , Q j t = min M Q j , max N Q j , max R Q j  and  Q j + t c = max M Q j , min N Q j , min R Q j ,   Q j + t = max M Q j , min N Q j , max R Q j , then
Q j t c C i r q R O F D O W G t c Q 1 , Q 2 , , Q n Q j + t c ;
Q j t c C i r q R O F D O W G t Q 1 , Q 2 , , Q n Q j + t c .
Proof. 
The proofs are straightforward. □
The proposed techniques in this section can be extensions of the existing techniques based on FSs, IFSs, PFSs, q-ROFSs, Cir-FSs, Cir-IFSs, and Cir-PFSs. We next used these proposed operators to create a Cirq-ROF multi-attribute decision-making (MADM) technique.

5. The MADM Method Based on the Initiated Operators

In this section, we present the MADM technique based on the proposed operators, such as the Cirq-ROFDWA and Cirq-ROFDWG operators for both norms, called DTN and DTCN, to improve the validity of the initiated techniques. Consider Q 1 , Q 2 , , Q n to be the collection of alternative information with the family of attributes for each alternative, such as Q 1 A T , Q 2 A T , , Q m A T with weight vectors such as ϱ j 0,1 , where the condition of the weight vector is j = 1 n ϱ j = 1 . Further, we assign Cirq-ROFNs to each attribute in every alternative. We know that the truth grade is represented by M Q C Q x ~ and the falsity grade is shown by N Q C Q x ~ with 0 M Q C Q q S C + N Q C Q q S C 1 , q S C 1 , and a radius for the truth grade and falsity grade is R Q C Q x ~ 0,1 . The refusal grade is R C Q x ~ = 1 M Q C Q q S C + N Q C Q q S C 1 / q S C , where the Cirq-ROFN is presented by Q j = M Q j , N Q j , R Q j , j = 1,2 , , n . We present the major steps of the MADM technique for evaluating any kind of real-life problems as follows:
Step 1:
To compute the matrix, we use Cirq-ROFNs Q j = M Q j , N Q j , R Q j , j = 1,2 , , n . Further, we evaluate the normalization of the matrix by using the theory below:
N = M Q j , N Q j , R Q j f o r   b e n e f i t N Q j , M Q j , R Q j f o r   c o s t .
The normalization in the matrix is not carried out if we have beneficial types of information.
Step 2:
To consider the normalization information, we evaluate the aggregated values with the help of the Cirq-ROFDWA operators of C i r q R O F D W A t c Q 1 , Q 2 , , Q n and C i r q R O F D W A t Q 1 , Q 2 , , Q n , and the Cirq-ROFDWG operators of C i r q R O F D W G t c Q 1 , Q 2 , , Q n and C i r q R O F D W G t Q 1 , Q 2 , , Q n for both the DTN and DTCN norms, which are presented in Theorems 3 and 5 in Section 4.
Step 3:
Calculate the score values based on the information of the score function.
S C O Q j = R Q j q S C * M Q j q S C N Q j q S C 1,1 ;
A C C Q j = R Q j q S C * M Q j q S C + N Q j q S C 0,1 .
Step 4:
Calculate the ranking of alternatives by using the score values and evaluate the best one.
We next used the above-created Cirq-ROF-MADM technique for the application of symmetry analysis in artificial intelligence.

6. Symmetry Analysis in Artificial Intelligence Based on the Proposed Cirq-ROF-MADM

In this section, we evaluate the supremacy and validity of the derived operators by resolving the problem of symmetry analysis in artificial intelligence under the presence of the initiated Cirq-ROF-MADM technique. Symmetry analysis plays a significant and efficient role in various fields, including machine learning, artificial intelligence, neural networks, and data mining, to cope with vague and complicated problems. In the context of artificial intelligence, symmetry analysis can refer to many aspects. In general, the following six aspects are important: Q 1 : algorithmic symmetry (optimization algorithm and machine learning models), Q 2 : data symmetry (data augmentation), Q 3 : knowledge representation (symbolic artificial intelligence), Q 4 : natural language processing (semantic symmetry), Q 5 : fairness and bias (algorithm fairness), and Q 6 : explainability (interpretability of models).
To evaluate the best decision among the above six, we select the following weight vectors: 0.2,0.2,0.2,0.4 T . For these weight vectors, we have the following attributes: growth analysis, social impact, political impact, and environmental impact. Finally, we present the major steps of the Cirq-ROF-MADM technique for evaluating the real-life problem as follows:
Step 1:
To compute the matrix as shown in Table 3, we use the Cirq-ROFNs Q j = M Q j , N Q j , R Q j , j = 1,2 , , n . Further, we evaluate the normalization of the matrix by using the theory below:
N = M Q j , N Q j , R Q j f o r   b e n e f i t N Q j , M Q j , R Q j f o r   c o s t .
Further, the normalization in the matrix is not carried out if we have beneficial types of information, so the data in Table 3 do not need to be normalized.
Step 2:
To consider the normalization information, we evaluate the aggregated values with the help of the Cirq-ROFDWA and Cirq-ROFDWG operators, as shown in Table 4.
Table 3. Cirq-ROF decision matrix.
Table 3. Cirq-ROF decision matrix.
Q 1 A T Q 2 A T Q 3 A T Q 4 A T
Q 1 0.9,0.5,0.7 0.9,0.5,0.7 0.9,0.5,0.7 0.9,0.5,0.7
Q 2 0.8,0.7,0.3 0.8,0.7,0.3 0.8,0.7,0.3 0.8,0.7,0.3
Q 3 0.7,0.5,0.1 0.7,0.5,0.1 0.7,0.5,0.1 0.7,0.5,0.1
Q 4 0.6,0.3,0.5 0.6,0.3,0.5 0.6,0.3,0.5 0.6,0.3,0.5
Q 5 0.5,0.3,0.4 0.5,0.3,0.4 0.5,0.3,0.4 0.5,0.3,0.4
Q 6 0.9,0.7,0.3 0.9,0.7,0.3 0.9,0.7,0.3 0.9,0.7,0.3
Table 4. Cirq-ROF aggregated matrix.
Table 4. Cirq-ROF aggregated matrix.
C i r q R O F D W A t c C i r q R O F D W A t C i r q R O F D W G t c C i r q R O F D W G t
Q 1 0.9236,0.51,0.9493 0.9236,0.51,0.5137 0.91,0.9994,0.874 0.91,0.9994,0.9994
Q 2 0.9743,0.7118,0.9785 0.9743,0.7118,0.7062 0.8116,0.9915,0.7951 0.8116,0.9915,0.992
Q 3 0.9915,0.51,0.992 0.9915,0.51,0.5097 0.7116,0.9994,0.7062 0.7116,0.9994,0.9994
Q 4 0.9976,0.4087,0.9976 0.9976,0.4087,0.4088 0.6109,0.9999,0.6099 0.6109,0.9999,0.9999
Q 5 0.9976,0.6109,0.9976 0.9976,0.6109,0.6096 0.6109,0.0076,0.6096 0.6109,0.0076,0.9976
Q 6 0.9236,0.7116,0.9519 0.9236,0.7116,0.7062 0.91,0.9915,0.8692 0.91,0.9915,0.992
Step 3:
Calculate the score values based on the information in the score function, as shown in Table 5.
Step 4:
The score values are used to obtain the ranking results of all alternatives and evaluate the best one, as shown in Table 6.
According to the results in Table 6, the best choice is as follows: C i r q R O F D W A t c chooses Q 4 , C i r q R O F D W A t chooses Q 5 , C i r q R O F D W G t c chooses Q 1 , and C i r q R O F D W G t chooses Q 6 .

7. Comparative Analysis

For the evaluation comparisons, in this section, we consider the data in Table 3 and try to evaluate them by using some prevailing techniques. To do so, we collected some existing techniques and tried to compare their ranking results with our initial ranking results to show the supremacy and validity of the derived theory. For comparison, we use the following existing techniques, such as that of Liu and Wang [17], who presented aggregation operators for q-ROFSs. The Dombi operators based on the PFSs were presented by Khan et al. [28]. Jana et al. [29] initiated the Dombi operators for q-ROFSs and their applications. Du [30] evaluated more about Dombi aggregation operators for q-ROFSs, and Seikh and Mandal [31] examined the Dombi operators for IFSs. Further, Akram et al. [32] proposed the fuzzy N-soft sets, Yang et al. [33] exposed the partitioned Bonferroni mean operators for complex q-rung orthopair uncertain linguistic sets, and Suri et al. [34] exposed the entropy measures for q-ROFSs. Finally, based on the data in Table 3, the comparative analysis is listed in Table 7.
Based on the initiated technique, we obtained the following best optimal features: Q 4 , Q 5 , Q 1 , and Q 6 . From the results in Table 7, we can see that these existing techniques have a problem with limited features, and so they failed to evaluate the data in Table 3. The weakness of the existing techniques by Liu and Wang [17], Khan et al. [28], Jana et al. [29], Du [30], Seikh and Mandal [31], Akram et al. [32], Yang et al. [33], and Suri et al. [34] are that they are operators, methods, and measures based on existing techniques of q-ROFSs without circular behavior. However, the proposed methods are computed based on a new way of Cirq-ROFSs that provides circular behavior. The advantages and disadvantages of the proposed methods and existing techniques are discussed as follows:
(1)
Seikh and Mandal [31] proposed the AOs for intuitionistic FSs (IFSs), and Khan et al. [28] proposed the AOs for Pythagorean FSs (PFSs), where the IFSs and PFSs contain the truth grade and the falsity grade but without circular behavior. However, our proposed AOs are based on Cirq-ROFSs, which are a circular extended version of IFSs and PFSs. This means that the methods of Seikh and Mandal [31] and Khan et al. [28] cannot handle the data in Table 3.
(2)
Akram et al. [32] proposed the AOs for fuzzy N-soft sets, which only contain the truth grade, so they fail to process the data in Table 3 under the Cirq-ROF environment.
(3)
Liu and Wang [17], Jana et al. [29], Du [30], Yang et al. [33], and Suri et al. [34] proposed the AOs for q-ROFSs, which are special cases of Cirq-ROFSs without circular behavior. This means that these existing methods can not deal with the Cirq-ROF data shown in Table 3.

8. Conclusions

Since circular q-rung orthopair fuzzy sets (Cirq-ROFSs) were recently proposed as an extension of FSs, IFSs, q-ROFSs, Cir-IFSs, and Cir-PFSs by Yusoff et al. [26] with no other research in the literature, we conduct an advanced study of Cirq-ROFSs with more properties. Cirq-ROFSs are good for depicting vagueness and fuzziness for life problems. In this paper, we continue working on Cirq-ROFSs by proposing Dombi aggregation operators (AOs) for Cirq-ROFSs with more operational laws. These include the Cirq-ROFDWA, Cirq-ROFDOWA, Cirq-ROFDWG, and Cirq-ROFDOWG operators. We also provide more properties, such as idempotency, monotonicity, and boundedness, for the proposed operators. We then construct the Cirq-ROF multi-attribute decision-making technique and apply it to the context of artificial intelligence in which symmetry analysis can compute the major aspect based on the proposed operators for Cirq-ROFNs. We use some existing techniques to compare our results to show the validity and supremacy of the proposed method. Up to now, no one had proposed the distances, similarity measures, or entropy based on Cirq-ROFSs. In the future, we will conduct these advanced studies on Cirq-ROFSs. We should also consider new extensions of Cirq-ROFSs to ball-extended T-spherical FSs and complex versions of them by utilizing some phase terms. Furthermore, we will discuss their applications in the field of artificial intelligence, machine learning, neural networks, green supply chain management, and decision-making to enhance the worth of the proposed theory.

Author Contributions

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

Funding

This research was supported 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 conflict of interest.

References

  1. Chertok, M.; Keller, Y. Spectral symmetry analysis. IEEE Trans. Pattern Anal. Mach. Intell. 2010, 32, 1227–1238. [Google Scholar] [CrossRef] [PubMed]
  2. Parui, S.K.; Majumder, D.D. Symmetry analysis by computer. Pattern Recognit. 1983, 16, 63–67. [Google Scholar] [CrossRef]
  3. Belokoneva, E.L. Borate crystal chemistry in terms of the extended OD theory: Topology and symmetry analysis. Crystallogr. Rev. 2005, 11, 151–198. [Google Scholar] [CrossRef]
  4. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  5. Lu, K.P.; Chang, S.T.; Yang, M.S. Change-point detection for shifts in control charts using fuzzy shift change-point algorithms. Comput. Ind. Eng. 2016, 93, 12–27. [Google Scholar] [CrossRef]
  6. 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]
  7. Yang, M.S.; Sinaga, K.P. Collaborative feature-weighted multi-view fuzzy c-means clustering. Pattern Recognit. 2021, 119, 108064. [Google Scholar] [CrossRef]
  8. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  9. Hwang, C.M.; Yang, M.S. New construction for similarity measures between intuitionistic fuzzy sets based on lower, upper and middle fuzzy sets. Int. J. Fuzzy Syst. 2013, 15, 359–366. [Google Scholar]
  10. Yang, M.S.; Hussian, Z.; Ali, M. Belief and plausibility measures on intuitionistic fuzzy sets with construction of belief-plausibility TOPSIS. Complexity 2020, 2020, 7849686. [Google Scholar] [CrossRef]
  11. 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]
  12. 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]
  13. Meng, Z.; Lin, R.; Wu, B. Multi-criteria group decision making based on graph neural networks in Pythagorean fuzzy environment. Expert Syst. Appl. 2024, 242, 122803. [Google Scholar] [CrossRef]
  14. Akram, M.; Nawaz, H.S.; Deveci, M. Attribute reduction and information granulation in Pythagorean fuzzy formal contexts. Expert Syst. Appl. 2023, 222, 119794. [Google Scholar] [CrossRef]
  15. Salari, S.; Sadeghi-Yarandi, M.; Golbabaei, F. An integrated approach to occupational health risk assessment of manufacturing nanomaterials using Pythagorean fuzzy AHP and fuzzy inference system. Sci. Rep. 2024, 14, 180. [Google Scholar] [CrossRef]
  16. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  17. Liu, P.; Wang, P. Some q-rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making. Int. J. Intell. Syst. 2018, 33, 259–280. [Google Scholar] [CrossRef]
  18. Yang, M.S.; Ali, Z.; Mahmood, T. Three-way decisions based on q-rung orthopair fuzzy 2-tuple linguistic sets with generalized Maclaurin symmetric mean operators. Mathematics 2021, 9, 1387. [Google Scholar] [CrossRef]
  19. Alcantud, J.C.R. Complemental fuzzy sets: A semantic justification of q-rung orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2023, 31, 4262–4270. [Google Scholar] [CrossRef]
  20. Atanassov, K.T. Circular intuitionistic fuzzy sets. J. Intell. Fuzzy Syst. 2020, 39, 5981–5986. [Google Scholar] [CrossRef]
  21. Bozyiğit, M.C.; Olgun, M.; Ünver, M. Circular Pythagorean fuzzy sets and applications to multi-criteria decision making. Informatica 2023, 34, 713–742. [Google Scholar] [CrossRef]
  22. Xu, C.; Wen, Y. New measure of circular intuitionistic fuzzy sets and its application in decision making. AIMS Math. 2023, 8, 24053–24074. [Google Scholar] [CrossRef]
  23. Chen, T.Y. A circular intuitionistic fuzzy evaluation method based on distances from the average solution to support multiple criteria intelligent decisions involving uncertainty. Eng. Appl. Artif. Intell. 2023, 117 Pt A, 105499. [Google Scholar] [CrossRef]
  24. Alsattar, H.A.; Qahtan, S.; Mourad, N.; Zaidan, A.A.; Deveci, M.; Jana, C.; Ding, W. Three-way decision-based conditional probabilities by opinion scores and Bayesian rules in circular-Pythagorean fuzzy sets for developing sustainable smart living framework. Inf. Sci. 2023, 649, 119681. [Google Scholar] [CrossRef]
  25. Alreshidi, N.A.; Shah, Z.; Khan, M.J. Similarity and entropy measures for circular intuitionistic fuzzy sets. Eng. Appl. Artif. Intell. 2024, 131, 107786. [Google Scholar] [CrossRef]
  26. Yusoff, B.; Kilicman, A.; Pratama, D.; Hasni, R. Circular q-rung orthopair fuzzy set and its algebraic properties. Malays. J. Math. Sci. 2023, 17, 363–378. [Google Scholar] [CrossRef]
  27. Dombi, J. A general class of fuzzy operators, the DeMorgan class of fuzzy operators and fuzziness measures induced by fuzzy operators. Fuzzy Sets Syst. 1982, 8, 149–163. [Google Scholar] [CrossRef]
  28. Khan, A.A.; Ashraf, S.; Abdullah, S.; Qiyas, M.; Luo, J.; Khan, S.U. Pythagorean fuzzy Dombi aggregation operators and their application in decision support system. Symmetry 2019, 11, 383. [Google Scholar] [CrossRef]
  29. Jana, C.; Muhiuddin, G.; Pal, M. Some Dombi aggregation of Q-rung orthopair fuzzy numbers in multiple-attribute decision making. Int. J. Intell. Syst. 2019, 34, 3220–3240. [Google Scholar] [CrossRef]
  30. Du, W.S. More on Dombi operations and Dombi aggregation operators for q-rung orthopair fuzzy values. J. Intell. Fuzzy Syst. 2020, 39, 3715–3735. [Google Scholar] [CrossRef]
  31. Seikh, M.R.; Mandal, U. Intuitionistic fuzzy Dombi aggregation operators and their application to multiple attribute decision-making. Granul. Comput. 2021, 6, 473–488. [Google Scholar] [CrossRef]
  32. 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]
  33. Yang, M.S.; Ali, Z.; Mahmood, T. Complex q-rung orthopair uncertain linguistic partitioned Bonferroni mean operators with application in antivirus mask selection. Symmetry 2021, 13, 249. [Google Scholar] [CrossRef]
  34. Suri, G.; Svitenko, H.; Guleria, A.; Gandotra, N.; Saini, N.; Sałabun, W. Biparametric Q Rung Orthopair Fuzzy Entropy Measure for Multi Criteria Decision Making Problem. Information 2023, 14, 304. [Google Scholar] [CrossRef]
Table 1. Specifications of q-ROFSs.
Table 1. Specifications of q-ROFSs.
ParametersMethodsConditionsMathematical Forms
q S C = 1 ,   N Q C Q = 0 Fuzzy sets (FSs) 0 M Q C Q 1 x ~ , M Q C Q x ~ , N Q C Q x ~ : x ~ X U N I
q S C = 1 Intuitionistic FSs 0 M Q C Q + N Q C Q 1 x ~ , M Q C Q x ~ , N Q C Q x ~ : x ~ X U N I
q S C = 2 Pythagorean FSs 0 M Q C Q 2 + N Q C Q 2 1 x ~ , M Q C Q x ~ , N Q C Q x ~ : x ~ X U N I
q S C 1 q-Rung orthopair FSs 0 M Q C Q q S C + N Q C Q q S C 1 x ~ , M Q C Q x ~ , N Q C Q x ~ : x ~ X U N I
Table 2. Specifications of Cirq-ROFSs.
Table 2. Specifications of Cirq-ROFSs.
ParametersMethodsConditionsMathematical Form
q S C = 1 , N Q C Q = 0 ,   R Q C Q = 0 Fuzzy sets (FSs) 0 M Q C Q 1 x ~ , M Q C Q x ~ , N Q C Q x ~ , R Q C Q : x ~ X U N I
q S C = 1 , R Q C Q = 0 Intuitionistic FSs (IFSs) 0 M Q C Q + N Q C Q 1 x ~ , M Q C Q x ~ , N Q C Q x ~ , R Q C Q : x ~ X U N I
q S C = 1 Circular IFSs 0 M Q C Q + N Q C Q 1 , R Q C Q [ 0,1 ] x ~ , M Q C Q x ~ , N Q C Q x ~ , R Q C Q : x ~ X U N I
q S C = 2 , R Q C Q = 0 Pythagorean FSs (PFSs) 0 M Q C Q 2 + N Q C Q 2 1 x ~ , M Q C Q x ~ , N Q C Q x ~ , R Q C Q : x ~ X U N I
q S C = 2 Circular PFSs 0 M Q C Q 2 + N Q C Q 2 1 , R Q C Q [ 0,1 ] x ~ , M Q C Q x ~ , N Q C Q x ~ , R Q C Q : x ~ X U N I
q S C 1 , R Q C Q = 0 q-Rung orthopair FSs (q-ROFSs) 0 M Q C Q q S C + N Q C Q q S C 1 x ~ , M Q C Q x ~ , N Q C Q x ~ , R Q C Q : x ~ X U N I
q S C 1 Circular q-ROFSs 0 M Q C Q q S C + N Q C Q q S C 1 , R Q C Q [ 0,1 ] x ~ , M Q C Q x ~ , N Q C Q x ~ , R Q C Q : x ~ X U N I
Table 5. Representation of the score terms.
Table 5. Representation of the score terms.
C i r q R O F D W A t c C i r q R O F D W A t C i r q R O F D W G t c C i r q R O F D W G t
Q 1 0.4985 0.2697 0.459 0.525
Q 2 0.73 0.5269 0.593 0.74
Q 3 0.9223 0.4739 0.657 0.929
Q 4 0.9775 0.4006 0.598 0.98
Q 5 0.9589 0.586 0.586 0.959
Q 6 0.4416 0.3276 0.403 0.46
Table 6. Representation of ranking values.
Table 6. Representation of ranking values.
MethodsRanking ValuesMost Optimal
C i r q R O F D W A t c Q 4 > Q 5 > Q 3 > Q 2 > Q 1 > Q 6 Q 4
C i r q R O F D W A t Q 5 > Q 2 > Q 3 > Q 4 > Q 6 > Q 1 Q 5
C i r q R O F D W G t c Q 1 > Q 6 > Q 5 > Q 2 > Q 4 > Q 3 Q 1
C i r q R O F D W G t Q 6 > Q 1 > Q 2 > Q 3 > Q 5 > Q 4 Q 6
Table 7. Representation of comparative analysis.
Table 7. Representation of comparative analysis.
MethodsRanking ValuesBest Optimal
Liu and Wang [17]Limited featuresLimited features
Khan et al. [28]Limited featuresLimited features
Jana et al. [29]Limited featuresLimited features
Du [30]Limited featuresLimited features
Seikh and Mandal [31]Limited featuresLimited features
Akram et al. [32]Limited featuresLimited features
Yang et al. [33]Limited featuresLimited features
Suri et al. [34]Limited featuresLimited features
C i r q R O F D W A t c Q 4 > Q 5 > Q 3 > Q 2 > Q 1 > Q 6 Q 4
C i r q R O F D W A t Q 5 > Q 2 > Q 3 > Q 4 > Q 6 > Q 1 Q 5
C i r q R O F D W G t c Q 1 > Q 6 > Q 5 > Q 2 > Q 4 > Q 3 Q 1
C i r q R O F D W G t Q 6 > Q 1 > Q 2 > Q 3 > Q 5 > Q 4 Q 6
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. On Circular q-Rung Orthopair Fuzzy Sets with Dombi Aggregation Operators and Application to Symmetry Analysis in Artificial Intelligence. Symmetry 2024, 16, 260. https://doi.org/10.3390/sym16030260

AMA Style

Ali Z, Yang M-S. On Circular q-Rung Orthopair Fuzzy Sets with Dombi Aggregation Operators and Application to Symmetry Analysis in Artificial Intelligence. Symmetry. 2024; 16(3):260. https://doi.org/10.3390/sym16030260

Chicago/Turabian Style

Ali, Zeeshan, and Miin-Shen Yang. 2024. "On Circular q-Rung Orthopair Fuzzy Sets with Dombi Aggregation Operators and Application to Symmetry Analysis in Artificial Intelligence" Symmetry 16, no. 3: 260. https://doi.org/10.3390/sym16030260

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