Research article Special Issues

Fractional orthotriple fuzzy Choquet-Frank aggregation operators and their application in optimal selection for EEG of depression patients

  • The fractional orthotriple fuzzy sets (FOFSs) are a generalized fuzzy set model that is more accurate, practical, and realistic. It is a more advanced version of the present fuzzy set models that can be used to identify false data in real-world scenarios. Compared to the picture fuzzy set and Spherical fuzzy set, the fractional orthotriple fuzzy set (FOFS) is a powerful tool. Additionally, aggregation operators are effective mathematical tools for condensing a set of finite values into one value that assist us in decision making (DM) challenges. Due to the generality of FOFS and the benefits of aggregation operators, we established two new aggregation operators in this article using the Frank t-norm and conorm operation, which we have renamed the fractional orthotriple fuzzy Choquet-Frank averaging (FOFCFA) and fractional orthotriple fuzzy Choquet-Frank geometric (FOFCFG) operators. A few of these aggregation operators' characteristics are also discussed. To demonstrate the efficacy of the introduced work, the multi-attribute decision making (MADM) algorithm is discussed along with applications. To demonstrate the validity and value of the suggested work, a comparison of the proposed work has also been provided.

    Citation: Muhammad Qiyas, Muhammad Naeem, Neelam Khan. Fractional orthotriple fuzzy Choquet-Frank aggregation operators and their application in optimal selection for EEG of depression patients[J]. AIMS Mathematics, 2023, 8(3): 6323-6355. doi: 10.3934/math.2023320

    Related Papers:

    [1] Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan . Sine hyperbolic fractional orthotriple linear Diophantine fuzzy aggregation operator and its application in decision making. AIMS Mathematics, 2023, 8(5): 11916-11942. doi: 10.3934/math.2023602
    [2] Tehreem, Harish Garg, Kinza Ayaz, Walid Emam . Multi attribute decision-making algorithms using Hamacher Choquet-integral operators with complex intuitionistic fuzzy information. AIMS Mathematics, 2024, 9(12): 35860-35884. doi: 10.3934/math.20241700
    [3] Misbah Rasheed, ElSayed Tag-Eldin, Nivin A. Ghamry, Muntazim Abbas Hashmi, Muhammad Kamran, Umber Rana . Decision-making algorithm based on Pythagorean fuzzy environment with probabilistic hesitant fuzzy set and Choquet integral. AIMS Mathematics, 2023, 8(5): 12422-12455. doi: 10.3934/math.2023624
    [4] Yasir Yasin, Muhammad Riaz, Kholood Alsager . Synergy of machine learning and the Einstein Choquet integral with LOPCOW and fuzzy measures for sustainable solid waste management. AIMS Mathematics, 2025, 10(1): 460-498. doi: 10.3934/math.2025022
    [5] Jian Qi . Artificial intelligence-based intelligent computing using circular q-rung orthopair fuzzy information aggregation. AIMS Mathematics, 2025, 10(2): 3062-3094. doi: 10.3934/math.2025143
    [6] Attaullah, Shahzaib Ashraf, Noor Rehman, Asghar Khan, Muhammad Naeem, Choonkil Park . Improved VIKOR methodology based on $ q $-rung orthopair hesitant fuzzy rough aggregation information: application in multi expert decision making. AIMS Mathematics, 2022, 7(5): 9524-9548. doi: 10.3934/math.2022530
    [7] Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan . Correction: Sine hyperbolic fractional orthotriple linear Diophantine fuzzy aggregation operator and its application in decision making. AIMS Mathematics, 2024, 9(12): 33493-33494. doi: 10.3934/math.20241598
    [8] Hanan Alohali, Muhammad Bilal Khan, Jorge E. Macías-Díaz, Fahad Sikander . On $ \left(\mathit{p}, \mathit{q}\right) $-fractional linear Diophantine fuzzy sets and their applications via MADM approach. AIMS Mathematics, 2024, 9(12): 35503-35532. doi: 10.3934/math.20241685
    [9] Wajid Ali, Tanzeela Shaheen, Iftikhar Ul Haq, Hamza Toor, Faraz Akram, Harish Garg, Md. Zia Uddin, Mohammad Mehedi Hassan . Aczel-Alsina-based aggregation operators for intuitionistic hesitant fuzzy set environment and their application to multiple attribute decision-making process. AIMS Mathematics, 2023, 8(8): 18021-18039. doi: 10.3934/math.2023916
    [10] Muhammad Qiyas, Muhammad Naeem, Muneeza, Arzoo . Logarithmic cubic aggregation operators and their application in online study effect during Covid-19. AIMS Mathematics, 2023, 8(3): 5847-5878. doi: 10.3934/math.2023295
  • The fractional orthotriple fuzzy sets (FOFSs) are a generalized fuzzy set model that is more accurate, practical, and realistic. It is a more advanced version of the present fuzzy set models that can be used to identify false data in real-world scenarios. Compared to the picture fuzzy set and Spherical fuzzy set, the fractional orthotriple fuzzy set (FOFS) is a powerful tool. Additionally, aggregation operators are effective mathematical tools for condensing a set of finite values into one value that assist us in decision making (DM) challenges. Due to the generality of FOFS and the benefits of aggregation operators, we established two new aggregation operators in this article using the Frank t-norm and conorm operation, which we have renamed the fractional orthotriple fuzzy Choquet-Frank averaging (FOFCFA) and fractional orthotriple fuzzy Choquet-Frank geometric (FOFCFG) operators. A few of these aggregation operators' characteristics are also discussed. To demonstrate the efficacy of the introduced work, the multi-attribute decision making (MADM) algorithm is discussed along with applications. To demonstrate the validity and value of the suggested work, a comparison of the proposed work has also been provided.



    We apply several sentences with attributes that are not considered to be propositioned in our lifestyle problems because it is difficult to say whether or not these sentences are absolutely correct or incorrect. We encounter various forms of these sentences in our day-to-day issues. In order to deal with these kinds of situations, researchers in the fields of engineering, business, and social sciences need to use various modelling techniques. Zadeh [40] developed the notion of fuzzy set (FS) theory in 1965 as a solution to this problem by taking into account the membership degree (MD) that belongs to the range [0,1]. Therefore, using the fuzzy set allows for the incorporation of incomplete and partial information into the decision version [10]. Numerous theories have been created in the context of fuzzy sets, and [6] presents a hybrid MCDM technique built on fuzzy DEMATEL, fuzzy TOPSIS, and fuzzy ANP to calculate green suppliers. One cannot dispute the fact that FS is the foundation of fuzzy set theory. Lin et al. [18] determine OWA operator weights using kernel density estimation. Researchers in this field have noted some short comings with fuzzy set. The intuitionistic fuzzy set (IFS), which takes into account the hesitation of experts, is how Atanassov [1] generalizes the concept of fuzzy set. Entropy is defined in [31] for intuitionistic fuzzy sets. For a moment, consider how IFS can only describe situations when the MD and non-membership degree (NMD) sum does not exceed 1, rendering it essentially useless in those situations. Hani et al. [16] developed linear Diophantine fuzzy graphs with new decision-making approach. Riaz et al. [28] defined an innovative bipolar fuzzy sine trigonometric aggregation operators and SIR method for medical tourism supply chain.

    Yager [37] developed the notion of the Pythagorean fuzzy set (PyFS) to handle this complexity, which can also be used to solve the problem mentioned above. Since many researchers attempt to use this recently developed idea in their research, Akram et al. [2] established a group decision making (GDM) approach based on the Pythagorean fuzzy TOPSIS process. Additionally, based on the Pythagorean fuzzy TOPSIS method, a novel correlation measure and its application are provided in [17]. A Pythagorean fuzzy VIKOR technique was presented by Zhou and Chen [42] who also established a generalized distance measurement. The TODIM technique for MADM with linguistic 2-tuple PyF data was presented by Deng and Gao [13]. Yager [38] introduced a novel concept known in the literature as q-ROFS, which is the generalization of IFS and PyFS, as a result of the ongoing complexity of real-life issues and the development of FS theory. The concept of q-ROFS is also more broad. Because the sum of the qth powers of MD and NMD must fall within the range [0,1], it has a void range. Be aware that q-ROFS gives decision-makers access to a wider range of options. Garg et al. [14] presented some power aggregation operator (AO) and VIKOR method for complex q-ROFS keeping in mind that AOs are the fundamental tools to transform the total data into a unique value. The q-ROFS pointed weighted aggregation operators for MCDM were developed by Xing et al. [35]. Lin et al. [19] proposed linguistic q-rung orthopair fuzzy sets and their interaction partitioned Heronian mean aggregation operators.

    But in many decision-making (DM) issues, like voting, human opinions consist of the following categories: Yes, no, abstinence, and refusal, which are not characterized in IFSs. It should be noted that all of the aforementioned existing literature only uses either MD or both MD and NMD. Therefore, neither the FSs nor the IFSs can treat this issue. Cuong [11] defined the notion of a picture fuzzy set (PFS) and added the neutral membership degree (NuMD) to deal with those types of situation when someone's opinions include more choice types, such as yes, abstention, no, and rejection, it is observed that PFS approaches are more applicable in these situations. Some methods and techniques have been introduced based on PFS, and it is a more general apparatus that is attracting more attention from researchers working in FS theory. In order to use the linguistic picture fuzzy TOPSIS method in enterprise resource systems, Zang et al. [41] provide an expanded version of it. Additionally, [22] describes an expanded picture fuzzy VIKOR technique and its applications in the beef industry. Lin et al. [21] defined picture fuzzy interactional partitioned Heronian mean aggregation operators: An application of MADM process. After that, Mahmood et al. [23] extended the idea of the picture fuzzy set to spherical fuzzy set. Due to the fact that SFS gives decision-makers more room, many researchers have focused on this idea and some new techniques have been created using SFS. Given that the TOPSIS method is well known for handling fuzzy information (FI), Barukab et al. [7] presented a novel technique for the TOPSIS method that is focused on entropy measurement and uses the Spherical fuzzy set. Additionally, Ashraf et al. [4] invented some novel aggregation operator, such as the Spherical fuzzy Dombi aggregation operator. Alaoui et al. [5] defined a novel analysis of fuzzy physical models by generalized fractional fuzzy operators.

    The Frank t-norm and t-conorm are important generalizations of the probabilistic and Lukasiewicz t-norm and t-conorm. They are a large and adjustable family of continuous triangular norms. The Frank t-norm and t-conorm are more adaptable in the information fusion process and are better suited to modelling DMs problems because they both have a parameter. The functional equations of Frank and Alsina [8] were examined in two groups of commutative, associative, and increasing binary operators. Yager [36] defined Frank t-norms' additive generating function and used it to create a model of approximation reasoning. Frank t-norm scalar cardinality was the subject of an axiomatic method proposed by Casasnovas and Torrens [9], who also showed that the properties hold for other t-common and t-norms. In order to build a full algebraic lattice structure, Deschrijver [12] presented Frank t-norms-based extending operations to the lattice of closed interval-valued fuzzy sets (IVFS). Yahya et al. [39] developed Frank aggregation operators and their application to probabilistic hesitant fuzzy MADM. Tang et al. [32] proposed a MADM approaches based on dual hesitant fuzzy Frank aggregation operators. Mahnaz et al. [24] defined the idea of T-spherical fuzzy Frank aggregation operators and their application to decision making with unknown weight information. Riaz et al. [29] defines an interval-valued linear Diophantine fuzzy Frank aggregation operators with MCDM.

    The picture fuzzy set and spherical fuzzy set frameworks have many applications in a variety of real-world contexts. We developed a novel expanded idea of a fractional orthotriple fuzzy set (FOFS) to get free of these restrictions. The proposed framework of FOFS has three membership degree μΩ(),ηΩ(),χΩ()[0,1] in the universal set M with the condition μfΩ()+ηfΩ()+χfΩ()1,fQ+ (positive rational numbers) with f1, i.e., f=p/q,f0,p,qN, for each M. We observe that as rung f rises, the fractional orthotriple fuzzy space expands, giving observers more latitude to express their support for membership. Be aware that in order to deal with uncertainty and inaccurate information, we were able to obtain a fractional orthotriple fuzzy set that produced more precise and accurate rung fuzzy numbers. It is obvious that FOFSs are the general forms of picture fuzzy set and spherical fuzzy set, and if we put p=q (for PFSs) and p=2n;q=n for all nN (for SFSs), the corresponding set becomes too PFSs and SFSs, respectively. Due to their greater flexibility and suitability for dealing with uncertain information, FOFSs express more extensive fuzzy information.

    There are two main advantages to the Frank t-conorm and t-norm. They begin by sharing some advantages with the Algebraic, Hamacher, and Einstein t-norm and t-conorm. Second, they have an additional boundary that results in a flexible and robust total cycle, making them stand out from other general t-norm and t-conorm. Hence, inspired by the previously mentioned investigation, the objective of this study as:

    (1) To initiate the principle of some frank operational laws by using Frank t-norm and Frank t-conorm.

    (2) To proposed fractional orthotriple fuzzy Choquet-Frank averaging operator, fractional orthotriple fuzzy Choquet-Frank geometric operator, and their important properties are also elaborated.

    (3) A multi-attribute decision making (MADM) approach is defined utilizing proposed operator to investigate the supremacy and consistency of the explored work.

    (4) Finally, we discuss the benefits, sensitive analysis, and geometric exposes of the explored works with the aid of numerous examples in order to demonstrate the efficacy and the dominance of the initiated works.

    Additionally, this article is structured as: In Section 2, we have overviews the concept of Frank t-norm and conorm, Choquet integral (CI), and fractional orthotriple fuzzy set. Several operational laws for fractional orthotriple fuzzy numbers are covered in Section 3 by Frank t-norm and t-conorm. The development of new aggregation operators for FOFSs, including the fractional orthotriple fuzzy Choquet-Frank averaging (FOFCFA) and fractional orthopair fuzzy Choquet-Frank geometric (FOFCFG) operators are discussed in detail in Section 4. Utilizing the aforementioned operators, we created the MADM approach for the fractional orthotriple fuzzy environment in Section 5. To verify the effectiveness of our method, numerical examples are discussed in Section 6. Comparative analysis of the proposed work with other techniques is covered in Section 7 to show the validity and impact of the suggested work. The conclusion was discussed in Section 8.

    In this section, we recall basic concept of fuzzy sets (FSs), Frank t-norm and co-norm, and the concept of Choquet integral.

    Definition 2.1. [40] Suppose that M is an arbitrary nonempty set. A fuzzy set L is defined as

    L={(,μL())|M}, (2.1)

    where the function μL is a mapping from M[0,1], and for every M,0μL()1, and function μL() is called the membership degree of in M.

    Definition 2.2. [1] Suppose that M is an arbitrary nonempty set. An IFS Ω in M is defined as

    Ω={(,μΩ(),ηΩ())|M}, (2.2)

    where μΩ:→[0,1] and ηΩ[0,1] are called respectively MD and NMD, such as M:0μΩ+ηΩ1. Hesitancy degree is defined as

    πΩ=1μΩηΩ.

    Definition 2.3. [23] Suppose that M is an arbitrary non-empty set. A SFS is denoted by Ω and defined as

    Ω={(,μΩ(),ηΩ(),χΩ())|M}, (2.3)

    where μΩ,ηΩ and χΩ are MD, NuMD and NMD functions M[0,1] with respect to (μΩ)2+(ηΩ)2+(χΩ)21. The hesitancy degree is defined as

    πΩ=1(μΩ)2(ηΩ)2(χΩ)2.

    Definition 2.4. [27] Suppose that M is an arbitrary non-empty set. A FOFS is denoted by Ω and defined as

    Ω={(,μΩ(),ηΩ(),χΩ())|M}, (2.4)

    where μΩ,ηΩ and χΩ are MD, NuMD and NMD functions M[0,1] with respect to (μΩ)f+(ηΩ)f+(χΩ)f1. The hesitancy degree is defined as

    πΩ=f1(μΩ)f(ηΩ)f(χΩ)f.

    Definition 2.5. [26] Let Ω1=(μ1,η1,χ1) be any FOFNs. Then, the score and accuracy function is defined as

    S(Ω1)=(μΩ)f(ηΩ)f(χΩ)f, (2.5)

    and accuracy as

    E(Ω1)=(μΩ)f+(ηΩ)f+(χΩ)f. (2.6)

    Frank t-norm and t-conormare initiated by Frank [33] and are defined as

    Ti(ϕ,φ)=logθ(1+(θϕ1)(θφ1)θ1), for all ϕ,φ[0,1],θ(0,+), (2.7)
    Si(ϕ,φ)=1logθ(1+(θϕ1)(θφ1)θ1), for all ϕ,φ[0,1],θ(0,+). (2.8)

    Where Ti(ϕ,φ) satisfying;

    (1) Ti(1,1)=1,Ti(ϕ,0)=Ti(0,ϕ)=ϕ.   (Boundary)

    (2) If ϕ1ϕ2,φ1φ2 then Ti(ϕ1,φ2)Ti(ϕ2,φ2).    (Monotonicity)

    (3) Ti(ϕ1,ϕ2)Ti(ϕ2,ϕ1).   (Commutativity)

    (4) Ti(ϕ1,Ti(ϕ2,ϕ3))=Ti(Ti(ϕ2,ϕ2),ϕ3).    (Associativity)

    Also, Si(ϕ,φ) satisfying

    (1) Si(0,0)=0,Si(ϕ,1)=ϕ.   (Boundary)

    (2) If ϕ1ϕ2,φ1φ2 then Si(ϕ1,φ2)Si(ϕ2,φ2).    (Monotonicity)

    (3) Si(ϕ1,ϕ2)Si(ϕ2,ϕ1).   (Commutativity)

    (4) Si(ϕ1,Si(ϕ2,ϕ3))=Si(Si(ϕ2,ϕ2),ϕ3).    (Associativity)

    Two special cases of Frank t-norm and t-conorm [30] are the following:

    (1) If θ0, then Ti(ϕ,φ)ϕ.φ,Si(ϕ,φ)ϕ+φϕφ become to the algebraic t-norm and t-conorm.

    (2) If θ, then Ti(ϕ,φ)max(0,ϕ+φ1),Si(ϕ,φ)min(0,ϕ+φ1) become to Lukasiewicz product and sum.

    Sugeno [30] introduced the idea of a fuzzy measure (FM), which is used to discuss how much weight should be given to each set of criteria in the Choquet integral model. We then talk about fuzzy measure and Choquet integral.

    Definition 2.6. A fuzzy measure on universal set M is a mapping Ξ:Ω()[0,1], with the following condition:

    (1) Ξ(0)=0,Ξ(M)=1,

    (2) uvM and uv then Ξ(u)Ξ(v).

    However, it is typically exceedingly difficult because we have to choose 2n2 values for n criterion. Therefore, it is difficult to provide such a fuzzy measure by Definition 2.6. Thus, the following fuzzy measure is defined by Sugeno [30].

    Ξ(uv)=Ξ(u)+Ξ(v)+Ξ(u)Ξ(v), (2.9)

    where (uv)=ϕ and [1,+].

    (1) If =0, then the fuzzy measure reduces to the Ξ(uv)=Ξ(u)+Ξ(v),uv=ϕ, specified as an additive measure.

    If all M are independent, then

    Ξ(u)=iuΞ(i). (2.10)

    If all M is finite, then

    Ξ(μ)=Ξ(ni=1i)={1(ni=1(1+λΞ(u))1),0iuΞ(i),=0. (2.11)

    Where ij=ϕ, for all i,j=1,...,n and ij.

    (2) If >0, then fuzzy measure reduces to Ξ(uv)>Ξ(u)+Ξ(v), is called a super-additive measure.

    (3) If 1<0, so fuzzy measure reduces to uv<Ξ(u)+Ξ(v), known as a sub-additive measure.

    Definition 2.7. [34] Let is a positive real (PR)-valued mapping on M and Ξ is a fuzzy measure on M. Then, discrete CI of with respect to Ξ is defined as

    dΞ=ni=1(Ξ(uξ(i))Ξ(uξ(i1)))ξ(i), (2.12)

    where ξ(i) is a permutation of (1,...,n) such as ξ(1)ξ(2)...,ξ(n), and uξ(0)=ϕ, uξ(i)=(Gξ(1),...,Gξ(i)).

    In this section of the article, we defined operational laws using the concept of Frank t-norm, t-conorm and fractional orthotriple fuzzy numbers.

    Definition 3.1. Let Ω1=(μ1,η1,χ1) and Ω2=(μ2,η2,χ2) be any two FOFNs. Then, the following addition and multiplication laws are proposed using Frank t-norm and Frank t-conorm as

    (1) Ω1Ω2={f1logθ(1+(θ1μf11)(θ1μf21)θ1),flogθ(1+(θηf11)(θηf21)θ1),flogθ(1+(θχf11)(θχf21)θ1)};

    (2) Ω1Ω2={flogθ(1+(θμf11)(θμf21)θ1),f1logθ(1+(θ1ηf11)(θ1ηf21)θ1),f1logθ(1+(θ1χf11)(θ1χf21)θ1)};

    (3) λΩ1={f1logθ(1+(θ1μf11)λ(θ1)λ1),flogθ(1+(θηf11)λ(θ1)λ1),flogθ(1+(θχf11)λ(θ1)λ1)};

    (4) Ωλ1={flogθ(1+(θμf11)λ(θ1)λ),f1logθ(1+(θ1ηf11)λ(θ1)λ1),f1logθ(1+(θ1χf11)λ(θ1)λ1)}.

    Using Frank operational laws of FOFNs and by Choquet integral, defined in the previous section, we will introduce the fractional orthotriple fuzzy Choquet-Frank aggregation operators, the first one is fractional orthotriple fuzzy Choquet-Frank average (FOFCFA) operator and the second one is fractional orthotriple fuzzy Choquet-Frank geometric (FOFCFG) operator.

    Definition 4.1. Let Ωi=(μi,ηi,χi)(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n) such as Ωξ(i)Ωξ(2)...,Ωξ(n). Then, a FOFCFA operator is defined as;

    FOFCFA(Ω1,...,Ωn)=ni=1(Ξ(uξ(i))Ξ(uξ(i1)))Ωξ(i). (4.1)

    Where uξ(i)=(Gξ(1),...,Gξ(i)),uξ(i)=ϕ, also Gξ(i) is the attribute related to Ωξ(i).

    Theorem 4.1. Let Ωi=(μi,ηi,χi)(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n) such that Ωξ(i)Ωξ(2)...,Ωξ(n). Gξ(i) is the attribute related to Ωξ(i),uξ(i)=ϕ, uξ(i)=(Gξ(1),...,Gξ(i)). Then, using FOFCFA operator the aggregated value is also a FOFN and,

    FOFCFA(Ω1,...,Ωn)={f1logθ(1+ni=1(θ1μfξ(i)1)Ξ(uξ(i))Ξ(uξ(i1 )     )),flogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )),flogθ(1+ni=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     ))}. (4.2)

    Proof. It is very easy to show FOFCFA is a FOFN, so we ignore here. Next, we prove Eq (4.2) by MI on n. If n=2, then by operational law (3).

    (Ξ(uξ(i )     )Ξ(uξ(i1 )     )   ).Ωξ(i)={f1logθ(1+(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     ),flogθ(1+(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     ),flogθ(1+(θχfΩi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     )}.

    Then,

    FOFCFA(Ω1,Ω2)=(Ξ(uξ(1 )     )Ξ(uξ(0 )     )   ).Ωξ(1)(Ξ(uξ(2 )     )Ξ(uξ(1 )     )   ).Ωξ(2)={f1logθ(1+2i=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)2i=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     ),flogθ(1+2i=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)2i=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     ),flogθ(1+2i=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)2i=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     )}.

    Since, 2i=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )=1. So, we get

    FOFCFA(Ω1,Ω2)={f1logθ(1+2i=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+2i=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+2i=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}.

    So Eq (4.2) is true for n=2.

    Now, if Eq (4.2) is true for n=k,

    FOFCFA(Ω1,...,Ωk)={f1logθ(1+ki=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ki=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ki=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}.

    For n=k+1

    FOFCFA(Ω1,...,Ωk,Ωk+1)=FOFCFA(Ω1,...,Ωk)(Ξ(uξ(k )     )Ξ(uξ(k1 )     )   ).Ωξ(k+1)={f1logθ(1+ki=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ki=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ki=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}{f1logθ(1+(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     ),flogθ(1+(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     ),flogθ(1+(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     )}
    ={f1logθ(1+k+1i=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)k+1i=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     ),flogθ(1+k+1i=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)k+1i=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     ),flogθ(1+k+1i=1(θχfξ(i)1)ni=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )(θ1)k+1i=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )1     )}.

    Since, k+1i=1Ξ(uξ(i )     )Ξ(uξ(i1 )     )=1. So, we get

    FOFCFA(Ω1,...,Ωk+1)={f1logθ(1+k+1i=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+k+1i=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+k+1i=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}.

    This implies that Eq (4.2) true for n=k+1. This shows that Eq (4.2) true for all values of n.

    Theorem 4.2. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n) such that Ωξ(i)Ωξ(2)...,Ωξ(n). Then,

    FOFCFA(λ.Ω1,...,λ.Ωn)=λ.FOFCFA(Ω1,...,Ωn). (4.3)

    Proof. By operational law (3) and Theorem 4.1 we have

    λ.Ωi={f1logθ(1+(θ1μfξ(i)1)λ(θ1)λ1),flogθ(1+(θηfξ(i)1)λ(θ1)λ1     ),flogθ(1+(θχfξ(i)1)λ(θ1)λ1)}.

    Then,

    FOFCFA(λ.Ω1,...,λ.Ωn)={f1logθ(1+ni=1(θ1μfξ(i)1)λ(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )(θ1)(λ1)     ),flogθ(1+ni=1(θηfξ(i)1)λ(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )(θ1)(λ1)     ),flogθ(1+ni=1(θχfξ(i)1)λ(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )(θ1)(λ1)     )}.

    Now,

    λ.FOFCFA(Ω1,...,Ωn)=λ.{f1logθ(1+ni=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ni=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}={f1logθ(1+ni=1(θ1μfξ(i)1)λ(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )(θ1)(λ1)     ),flogθ(1+ni=1(θηfξ(i)1)λ(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )(θ1)(λ1)     ),flogθ(1+ni=1(θχfΩi1)λ(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )(θ1)(λ1)     )}=FOFCFA(λ.Ω1,...,λ.Ωn).

    Therefore, Eq (4.3) holds, so proof completed.

    Theorem 4.3. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n) such that Ωξ(i)Ωξ(2)...,Ωξ(n). Then,

    FOFCFA(Ω1Ω,...,ΩnΩ)=FOFCFA(Ω1,...,Ωn)Ω. (4.4)

    Proof. Using operational law (1) and Theorem 4.1, we get

    (ΩiΩ)={f1logθ(1+(θ1μfi1)(θ1μf1)θ1     ),flogθ(1+(θηfi1)(θηf1)θ1     ),flogθ(1+(θχfi1)(θχf1)θ1     )}.

    Thus,

    FOFCFA(Ω1Ω,...,ΩnΩ)={f1logθ(1+(θ1μf1)ni=1(θ1μfi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+(θηf1)ni=1(θηfi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+(θχf1)ni=1(θχfi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     )}.

    Now,

    FOFCFA(Ω1,...,Ωn)Ω={f1logθ(1+ni=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ni=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}(μ,η,χ)={f1logθ(1+(θ1μf1)ni=1(θ1μfi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+(θηf1)ni=1(θηfi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+(θχf1)ni=1(θχfi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     )}=FOFCFA(Ω1Ω,...,ΩnΩ).

    Theorem 4.4. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n) such that Ωξ(i)Ωξ(2)...,Ωξ(n). Then,

    FOFCFA(Ωu1Ωv1,...,ΩunΩvn)=FOFCFA(Ωu1,...,Ωun)FOFCFA(Ωv1,...,Ωvn). (4.5)

    Proof. Using operational law (3) and Theorem 4.1, we get

    (ΩuiΩvi)={f1logθ(1+(θ1μfui1)(θ1μfvi1)θ1     ),flogθ(1+(θηfui1)(θηfvi1)θ1     ),flogθ(1+(θχfui1)(θχfvi1)θ1     )}.

    Thus,

    FOFCFA(Ωu1Ωv1,...,ΩunΩvn)={f1logθ(1+ni=1(θ1μfui1)(θ1μfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+ni=1(θηfui1)(θηfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+ni=1(θχfui1)(θχfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     )}.

    As

    FOFCFA(Ωu1,...,Ωun)={f1logθ(1+ni=1(θ1μfui1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+ni=1(θηfui1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+ni=1(θχfui1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     )}

    and

    FOFCFA(Ωv1,...,Ωvn)={f1logθ(1+ni=1(θ1μfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+ni=1(θηfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+ni=1(θχfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     )}.

    Thus,

    FOFCFA(Ωu1,...,Ωun)FOFCFA(Ωv1,...,Ωvn)={f1logθ(1+ni=1(θ1μfui1)(θ1μfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+ni=1(θηfui1)(θηfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     ),flogθ(1+ni=1(θχfui1)(θχfvi1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )θ1     )}=FOFCFA(Ωu1Ωv1,...,ΩunΩvn).

    Equation (4.5) holds, so proof completed.

    The following properties of the FOFCFA operator can be simply demonstrated.

    Theorem 4.5. (Idempotency) Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, if all Ωi(i=1,...,n) are equal i.e., Ωi=Ω=(μ,η,χ) for all i. Then,

    FOFCFA(Ω1,...,Ωn)=FOFCFA(Ω,...,Ω)=Ω. (4.6)

    Proof. The proof is straight forward.

    Theorem 4.6. (Monotonicity) Let Ωui=(μui,ηui,χui     ) and Ωvi=(μvi,ηvi,χvi     )(i=1,...,n) are two family of FOFNs if μuiμvi,ηuiηviand χuiχvi for all i. Then,

    FOFCFA(Ωu1,...,Ωun)FOFCFA(Ωv1,...,Ωvn). (4.7)

    Proof. The proof is straight forward.

    Theorem 4.7. (Boundedness) Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, if Ω+=(max(μi),min(ηi),min(χi)) and Ω=(min(μi),max(ηi),max(χi)). Then,

    ΩFOFCFA(Ω1,...,Ωn)Ω+. (4.8)

    Proof. The proof is straight forward.

    Next, we discussed some special cases of parameters for different values.

    Theorem 4.8. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs. Then,

    Case 1. If θ1, then FOFCFA operator becomes a FOFCA operator using the algebraic t-norm and t-conorm and represented as;

    limθ1FOFCFA={f1ni=1(1μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     ),f(ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),f(ni=1(χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}. (4.9)

    Case 2. If θ1,Ξi=Ξ(uξ(i )     )Ξ(uξ(i1 )     ), then FOFCFA operator becomes fractional orthotriple fuzzy weighted averaging (FOFWA) operator.

    Case 3. If θ1,Ξi=Ξ(uξ(i )     )Ξ(uξ(i1 )     ) and Ξ(u)=|u|i=1wi for all uX, where w=(w1,...,wn),wj[0,1] and nj=1wj=1. Also, |u| is the ordered set of u, then FOFCFA operator becomes fractional orthotriple fuzzy ordered weighted averaging (FOFOWA) operator.

    Case 4. If θ, then FOFCFA operator becomes traditional arithmetic weighted averaging operator, defined as;

    limθFOFCFA={f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i),fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i),fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )χfξ(i),}. (4.10)

    Proof. We have only proved Cases 1 and 4, Cases 2 and 3 can be easily obtained from Cases 1 and 4.

    (1) As

    limθ1FOFCFA=limθ1{f1logθ(1+ni=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),flogθ(1+ni=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}.

    We only need to prove that

    limθ1f1logθ(1+ni=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(1μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )limθ1flogθ(1+ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f(ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )limθ1flogθ(1+ni=1(χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f(ni=1(χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    We first prove that

    limθ1(flogθ(1+ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     ) )     )=f(ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    As θ1, then (ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )0, thus by equivalent infinitesimal replacement law we have that ln(1+x)x(x>0) and logarithmic transform, we have

    limθ1flogθ(1+ni=1(ηfξ(i)11)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fln(1+ni=1(ηfξ(i)11)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθf(1+ni=1(ηfξ(i)11)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθ.

    By Taylor series and lnθ>0, we get

    ηfξ(i)1=1+ηfξ(i)lnθ+ηfξ(i)2(lnθ)2+...=1+ηfξ(i)lnθ+O(lnθ)ηfξ(i)1=ηfξ(i)lnθ+O(lnθ).

    Thus, ηfξ(i)1ηfξ(i)lnθ. Then,

    limθ1flogθ(1+ni=1(ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fln(1+ni=1(ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθlimθ1f(ni=1(ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθ=limθ1f(ni=1(ηfξ(i)lnθ)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθf(ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθlnθ=f(ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    So,

    limθ1flogθ(1+ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f(ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    Similarly, we can prove that

    limθ1f1logθ(1+ni=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(1μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )limθ1flogθ(1+ni=1(χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f(ni=1(χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    Thus, we can write

    limθ1FOFCFA={f1ni=1(1μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     ),f(ni=1(ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),f(ni=1(χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}.

    Which is the required proof.

    (2) We simply need to demonstrate that for Proof (4).

    {limθf1logθ(1+ni=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i),limθflogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i),limθflogθ(1+ni=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )χfξ(i),}

    We first prove that

    limθflogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i),

    As, flogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ) is continuous, so we get

    limθflogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=flimθlogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    Thus by logarithmic transform and by L-Hospital rule, we get

    limθflogθ(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=flimθln(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθ=flimθni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(1+ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i)θηfξ(i)1ηfξ(i)11θ=flimθ11+1ni=1(θηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i)θηfξ(i)1ηfξ(i)1=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i).

    Similarly, we can prove

    {limθf1logθ(1+ni=1(θ1μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i),limθflogθ(1+ni=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )χfξ(i),}.

    So,

    limθFOFCFA={f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i),fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i),fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )χfξ(i),}.

    Which is the required proof.

    Definition 4.2. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n), such that Ωξ(i)Ωξ(2)...,Ωξ(n). Then, a FOFCFA operator is defined as

    FOFCFG(Ω1,...,Ωn)=ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )Ωξ(i). (4.11)

    Where uξ(i)=(Gξ(1),...,Gξ(i )     ),uξ(i)=ϕ, also Gξ(i) is the attribute related to Ωξ(i).

    Theorem 4.9. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n), such that Ωξ(i)Ωξ(2)...,Ωξ(n). Gξ(i) is the attribute related to Ωξ(i),uξ(i)=ϕ, uξ(i)=(Gξ(1),...,Gξ(i )     ). Then, using FOFCFG operator the aggregated value is also a FOFN and

    FOFCFG(Ω1,...,Ωn)={flogθ(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),f1logθ(1+ni=1(θ1ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),f1logθ(1+ni=1(θ1χfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}. (4.12)

    Proof. Proof is same as Theorem 4.1.

    Theorem 4.10. Let Ωi=(μi,ηi,χi     )(i=1,...,n)) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n) such that Ωξ(i)Ωξ(2)...,Ωξ(n). Then,

    FOFCFG(λ.Ω1,...,λ.Ωn)=λ.FOFCFG(Ω1,...,Ωn). (4.13)

    Proof. Proof is same as Theorem 4.1.

    Theorem 4.11. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n) such as Ωξ(i)Ωξ(2)...,Ωξ(n). Then,

    FOFCFG(Ω1Ω,...,ΩnΩ)=FOFCFG(Ω1,...,Ωn)Ω. (4.14)

    Proof. Proof is same as Theorem 4.1.

    Theorem 4.12. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, and ξ(i) is a permutation of (i=1,...,n) such as Ωξ(i)Ωξ(2)...,Ωξ(n). Then,

    FOFCFG(Ωu1Ωv1,...,ΩunΩvn)=FOFCFG(Ωu1,...,Ωun)FOFCFG(Ωv1,...,Ωvn). (4.15)

    Proof. Proof is same as Theorem 4.1.

    The following properties of the FOFCFG operator can then be simply demonstrated.

    Theorem 4.13. (Idempotency) Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, if all Ωi(i=1,...,n) are equal i.e., Ωi=Ω=(μ,η,χ) for all i. Then,

    FOFCFG(Ω1,...,Ωn)=FOFCFG(Ω,...,Ω)=Ω. (4.16)

    Proof. The proof is straight forward.

    Theorem 4.14. (Monotonicity) Let Ωui=(μui,ηui,χui     ) and Ωvi=(μvi,ηvi,χvi     )(i=1,...,n) are two family of FOFNs if μuiμvi,ηuiηviand χuiχvi for all i. Then,

    FOFCFG(Ωu1,...,Ωun)FOFCFG(Ωv1,...,Ωvn). (4.17)

    Theorem 4.15. (Boundedness) Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs, if Ω+=(max(μi),min(ηi),min(χi)) and Ω=(min(μi),max(ηi),max(χi)). Then,

    ΩFOFCFG(Ω1,...,Ωn)Ω+. (4.18)

    Next, we have different special cases of parameters for different values.

    Theorem 4.16. Let Ωi=(μi,ηi,χi     )(i=1,...,n) is a family of FOFNs. Then,

    Case 5. If θ1, then FOFCFG operator becomes a FOFCG operator using the algebraic t-norm and t-conorm and represented as

    limθ1FOFCFG={f(ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),f1ni=1(1ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     ),f1ni=1(1χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )}. (4.19)

    Case 6. If θ1,Ξi=Ξ(uξ(i )     )Ξ(uξ(i1 )     ), then FOFCFG operator becomes fractional orthotriple fuzzy weighted geometric (FOFWG) operator.

    Case 7. If θ1,Ξi=Ξ(uξ(i )     )Ξ(uξ(i1 )     ) and Ξ(u)=|u|i=1wi for all uX, where w=(w1,...,wn),wj[0,1] and nj=1wj=1. Also, |u| is the ordered set of u, then FOFCFG operator becomes fractional orthotriple fuzzy ordered weighted geometric (FOFOWG) operator.

    Case 8. If θ, then FOFCFG operator becomes traditional geometric weighted averaging operator defined as;

    limθFOFCFG={fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i),f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i),f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )χfξ(i)}. (4.20)

    Proof. We have only proved Cases 1 and 4, Cases 2 and 3 can be easily obtained from Cases 1 and 4.

    (1) As

    limθ1FOFCFG=limθ1{flogθ(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )f1logθ(1+ni=1(θ1ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),f1logθ(1+ni=1(θ1χfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )}.

    We only need to prove that

    limθ1flogθ(1+ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f(ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )limθ1f1logθ(1+ni=1(θ1ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(1ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )limθ1f1logθ(1+ni=1(θ1χfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(1χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     ).

    We first prove that

    limθ1(flogθ(1+ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     ) )     )=f(ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    As θ1, then (μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )0, thus by equivalent infinitesimal replacement law we have that ln(1+x)x(x>0) and logarithmic transform, we have

    limθ1flogθ(1+ni=1(μfξ(i)11)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fln(1+ni=1(μfξ(i)11)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθf(1+ni=1(μfξ(i)11)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθ.

    By Taylor series and lnθ>0, we get

    μfξ(i)1=1+μfξ(i)lnθ+μfξ(i)2(lnθ)2+...=1+μfξ(i)lnθ+O(lnθ)μfξ(i)1=μfξ(i)lnθ+O(lnθ).

    Thus, μfξ(i)1μfξ(i)lnθ. Then,

    limθ1flogθ(1+ni=1(μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fln(1+ni=1(μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθlimθ1f(ni=1(μfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθ=limθ1f(ni=1(μfξ(i)lnθ)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθf(ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθlnθ=f(ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    So,

    limθ1flogθ(1+ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f(ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    Similarly, we can prove that

    limθ1f1logθ(1+ni=1(θ1ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(1ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )limθ1flogθ(1+ni=1(χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f(ni=1(χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    Thus, we can write

    limθ1FOFCFG={f(ni=1(μfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ),f1ni=1(1ηfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     ),f1ni=1(1χfξ(i)     )Ξ(uξ(i )     )Ξ(uξ(i1 )     )}.

    Which is the required proof.

    (2) We simply need to demonstrate that for Proof (4).

    {limθflogθ(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i),limθf1logθ(1+ni=1(θ1ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i),limθf1logθ(1+ni=1(θ1χfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )χfξ(i)}.

    We first prove that

    limθflogθ(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i).

    As, flogθ(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ) is continuous, so we get

    limθflogθ(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=flimθlogθ(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     ).

    Thus by logarithmic transform and by L-Hospital rule, we get

    limθflogθ(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=flimθln(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )lnθ=flimθni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )(1+ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i)θμfξ(i)1μfξ(i)11θ=flimθ11+1ni=1(θμfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i)θμfξ(i)1μfξ(i)1=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i).

    Similarly, we can prove

    {limθf1logθ(1+ni=1(θ1ηfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i),limθflogθ(1+ni=1(θχfξ(i)1)Ξ(uξ(i )     )Ξ(uξ(i1 )     )     )=fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )χfξ(i),}.

    So,

    limθFOFCFG={fni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )μfξ(i),f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )ηfξ(i),f1ni=1(Ξ(uξ(i )     )Ξ(uξ(i1 )     )   )χfξ(i)}.

    Which is the required proof.

    In this section, we establish an approach to MADM difficulties with fractional orthotriple fuzzy information using the established aggregation operators. MADM problem can be explained as; let H=(H1,...,Hm     ) be a set of m alternative, C=(C1,...,Cn     ) be a set of n attributes. Suppose a fractional orthotriple fuzzy number Ωi=(μij,ηij,χij     ) an attribute value is given by decision makers for the alternative hi with respect to the attribute Cj, satisfies the following condition μij,ηij,χij[0,1] and 0μfij+ηfij+χfij1. Then, for any solutions, we can use the proposed operators, with given steps:

    Step 1: Normalize the given decision matrix, normally, attributes can be categorized into two kinds, the first one is the benefit attribute and the second one is the cast attribute. The point to be noted, no need to normalize the decision making matrix if attributes are of the same type (benefit type). If attributes have different values, then normalized decision matrix by;

    Ωij={(μij,ηij,χij     ), if attribute are benefit type(χij,ηij,μij     ), if attribute are cost type

    Step 2: By score function in Definition 2.5, we determine Ξ(Ωij) to rearrange Ωij for every alternative Hi(i=1,...,m) in descending order. If Ξ(Ωij)=Ξ(Ωik), we relate E(Ωij) and E(Ωik), so partial evaluation Ωij of Hi the alternative is rearranged such as Ωi(j)Ωi(j1).

    Step 3: Find the fuzzy measure of n attributes of Hi. To prevent difficulty, we use Eq (2.9) for defining the fuzzy measure.

    Step 4: Determine the whole preferences for every alternative. For the alternative Hi(i=1,...,m), use the FOFCFA or FOFCFG operator to aggregate the values of the attributes.

    Step 5: Determine the score values for each alternative.

    Step 6: Choose the best option after ranking the alternatives.

    Nowadays, a human mental disorder, such as depression, is a serious global health problem. One of the many characteristics of the psychological illness is a significant and ongoing depressed mood. Due to an extremely busy lifestyle, mental illness or depression is on the rise. Persistent depression, , and frustration are three major medical manifestations of the disorder that is affecting an increasing number of people. In some cases, suicidal thoughts also manifest in these conditions. The World Health Organization (WHO) estimated that by the end of 2020, depression affected 350 million people worldwide, making it the second most common disease after heart disease. The depression has been properly studied as a mental disorder disease since the middle of the 19th century. According to Beck's theory of cognitive breakdown, which was developed in the 1960s, depressed people have negative thoughts about both themselves and the people around them. Clinical diagnosis has been hampered, though, by the fact that the etiology of depression is unknown and the manifestations are challenging. The doctors use a variety of diagnostic techniques and routine tests to identify this illness, and each of these tests yields a unique set of diagnostic findings. This leads to the conclusion that patients who exhibit symptoms of depression rely on self-care to carry out a management plan of treatment and that there is no such physical signal that can be used as a measurable constraint. An initial examination, a diagnosis, and overcoming anticipation depression are very difficult. Due to the recent rapid advancements in cognitive science and sensor technology, researchers can now use electroencephalograms (EEGs) to physically record brain activity. Electroencephalograms are used to assess the clinical history of the disorder. EEG physiological signals can be used to measure and record depression's relationship to brain activity. Several clinical tests of brain function can be conducted using EEG recordings.

    According to a large body of research, EEG signals are used to analyze brain activity. Recently, the sample entropy bi-spectrum entropy, approximate entropy and renyi entropy have been studied for classifier selection of EEG signals for depression and classify into different classes of depression EEG signals. It's obvious that more knowledge is needed about the processes that occur in the brain before and during stress in order to monitor diagnosis and treatment. The statistical performance of the resulting features was evaluated, and they were classified as potential neural networks, k-nearest neighbor algorithm (k-NN), Gaussian mixture model (GMM), Decision tree (DT) and Probabilistic neural network (PNN). The proposed intelligent decision technique analyzes the k-nearest neighbour algorithm (k-NN), Gaussian mixture model (GMM), Decision tree (DT) and probabilistic neural network (PNN) of EEG signals of depression using the sample entropy bispectrum entropy, approximate entropy and renyi entropy under the FOF information.

    The decision experts are finalized the following method for classifier selection H1: K-nearest neighbor algorithm(k-NN), H2: Gaussian mixture model (GMM), H3: Decision tree (DT) and H4: Probabilistic neural network (PNN). The classifier is further evaluated by decision experts based on attribute C1: Sample entropy, C2: Bispectrum entropy, C3: Approximate entropy C4: Renyi entropy. The experts give their assessment for the five classifiers of EEG based on five attribute in the Table 1.

    Table 1.  Fractional orthopair fuzzy decision matrix.
    C1 C2 C3 C4
    H1 (0.7,0.5,0.4) (0.5,0.8,0.3) (0.9,0.7,0.3) (0.6,0.8,0.4)
    H2 (0.6,0.8,0.7) (0.9,0.6,0.5) (0.6,0.5,0.8) (0.5,0.4,0.9)
    H3 (0.4,0.9,0.6) (0.6,0.8,0.4) (0.5,0.8,0.6) (0.8,0.3,0.8)
    H4 (0.8,0.4,0.5) (0.7,0.5,0.9) (0.3,0.4,0.9) (0.7,0.5,0.6)

     | Show Table
    DownLoad: CSV

    Step 1: The decision matrix does not require normalization because all attributes are of the benefit type.

    Step 2:To demonstrate a fuzzy measure for the n attributes of Ci. The fuzzy measure of Ci attributes should be as following:

    Ξ(C1)=0.3,Ξ(C2)=0.4,Ξ(C3)=0.2,Ξ(C4)=0.3.

    The fuzzy measure of attribute sets is calculated using the -FM. First, the value of is determined by Eq (2.9). We get =(0.3417), and then Eq (2.11) can be used to find the fuzzy measure of the attribute set C=(C1,...,C4).

    Ξ(C1,C2)=0.271,Ξ(C1,C3)=0.482,Ξ(C1,C4)=0.162,Ξ(C2,C4)=0.370,Ξ(C3,C4)=0.517,Ξ(C2,C3)=0.209,Ξ(C1,C2,C3)=0.116,Ξ(C1,C2,C4)=0.464,Ξ(C1,C3,C4)=0.487,Ξ(C2,C3,C4)=0.541,Ξ(C1,C2,C3,C4)=1.

    Step 3: By using score functions, we reorder the FOFNs in the following order, according to Table 1:

    Ω1ξ(1)=(0.9,0.7,0.3),Ω1ξ(2)=(0.7,0.5,0.4),Ω1ξ(3)=(0.6,0.8,0.4),Ω1ξ(4)=(0.5,0.8,0.3)Ω2ξ(1)=(0.9,0.6,0.5),Ω2ξ(2)=(0.6,0.8,0.7),Ω2ξ(3)=(0.6,0.5,0.8),Ω2ξ(4)=(0.5,0.4,0.9)Ω3ξ(1)=(0.8,0.3,0.8),Ω3ξ(2)=(0.6,0.8,0.4),Ω3ξ(3)=(0.5,0.8,0.6),Ω3ξ(4)=(0.4,0.9,0.6)Ω4ξ(1)=(0.8,0.4,0.5),Ω4ξ(2)=(0.7,0.5,0.6),Ω4ξ(3)=(0.7,0.5,0.9),Ω4ξ(4)=(0.3,0.4,0.9).

    Then, we obtain

    u1ξ(1)=(C1,C2,C3,C4),u1ξ(2)=(C1,C3,C4),u1ξ(3)=(C1,C4),u1ξ(4)=C4u2ξ(1)=(C1,C2,C3,C4),u2ξ(2)=(C2,C3,C4),u2ξ(3)=(C2,C4),u2ξ(4)=C2u3ξ(1)=(C1,C2,C3,C4),u3ξ(2)=(C1,C3,C4),u3ξ(3)=(C3,C4),u3ξ(4)=C4u4ξ(1)=(C1,C2,C3,C4),u4ξ(2)=(C2,C3,C4),u4ξ(3)=(C2,C4),u4ξ(4)=C2.

    Step 4: Using the FOFCFA operator and f=3, to combine the attribute values for alternative H=(H1,...,H4). We have a set of overall values if θ=2.

    Ω1=(0.4291,0.6385,0.3816),Ω2=(0.5982,0.3997,0.4872)Ω3=(0.6271,0.4208,0.2752),Ω4=(0.5183,0.3174,0.5309).

    Step 5: Find the scores of Ωi(i=1,...,4), using Definition 2.5, we obtained.

    S(Ω1)=0.3525,S(Ω2)=0.3702,S(Ω3)=0.4492,S(Ω4)=0.4137.

    Thus, the ranking of the overall values is Ω3>Ω4>Ω2>Ω1.

    Step 6: Give ranking to the alternatives Hi(i=1,...,4) according to the rank values of Ωi(i=1,...,4), we get a result: H3>H4>H2>H1. Thus, H3 is the best alternative, indicating that the Decision Tree is the best choice.

    Based on the DM's preferences, a variety of values may be applied to the parameter. To examine the variation in the ranking of the four options depending on the value of the parameter, we assigned θ values ranging from 1 to 50 and computed the scores for these four alternatives. Table 2 provides a summary of the scores assigned to the alternatives by the FOFCFA operator. It is clear that when the value of θ rises from 1 to 50, the scores assigned to each alternative rise as well. We can see that the four options are always in the same order when we use θ[1,50], and Decision Tree is the best choice. When the parameter is between (1,+), we can observe that the FOFCFA operator increases monotonically with respect to that parameter. The values of the alternative increasing if we adjust the parameter. In Table 2, the fluctuations in the scores are readily seen in relation to the values of the parameter θ.

    Table 2.  Overall ranking of alternatives using different value of parameter.
    Parameter θScores valuesRanking
    S(Ω1)S(Ω2)S(Ω3)S(Ω4)
    θ=1 0.21460.23720.26410.2277 H3>H4>H2>H1
    θ=2 0.35250.37020.44920.4136 H3>H4>H2>H1
    θ=3 0.44170.46020.49970.4736 H3>H4>H2>H1
    θ=10 0.57520.58910.61420.5975 H3>H4>H2>H1
    θ=25 0.73500.74240.78460.7570 H3>H4>H2>H1
    θ=50 0.77640.79820.88690.8473 H3>H4>H2>H1

     | Show Table
    DownLoad: CSV

    We can see from the analysis of Table 2 above that the parameter θ represents the decision makers' preferences, and the decision makers can select the appropriate values of θ in accordance with their preferences. We may generate several scoring functions, which in turn allow us to generate various ranks of the alternatives as well as many optimal alternatives, by selecting various values for the parameter θ. In other words, different choices of the parameter θ could result in different ultimate optimal decisions. Since we can choose different values for the parameter in light of various practical situations, using the developed aggregation operators.

    Figure 1 shows graphically the ranking of the alternatives.

    Figure 1.  Ranking of the alternatives using proposed operator.

    In this section, we'll lay the groundwork for a collaborative analysis of the previously presented work using a few tried-and-true techniques from the literature. The main points of discussion are listed below.

    Here, we will compare our work with concepts; some new Pythagorean fuzzy Choquet-Frank aggregation operators for multi-attribute decision making [34]; an approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets [23]; T-spherical fuzzy Frank aggregation operators and their application to decision making with unknown weight information [24]; similarity measures for fractional orthotriple fuzzy sets using cosine and cotangent functions [25], Banzhaf-Choquet Copula based operators for managing fractional orthotriple fuzzy information [26] and Fractional orthotriple fuzzy rough Hamacher aggregation operators [27]. The final results are now presented in Table 3 for this discussion.

    Table 3.  Ranking and score values of alternatives using different operators.
    MethodScores values Ranking
    S(Ω1)S(Ω2)S(Ω3)S(Ω4)
    Xing et al. [34] 0.15260.16270.19050.1724 H3>H4>H2>H1
    Mahmood et al. [23] 0.38510.37250.35190.6472 H3>H1>H2>H3
    Mahnaz et al. [24] 0.51360.54720.59610.4620 H3>H2>H1>H4
    Naeem et al. [25] 0.61680.62910.66340.6472 H3>H4>H2>H1
    Qiyas et al. [26] 0.60970.59970.58210.6015 H3>H4>H1>H2
    Qiyas et al. [27] 0.43170.44210.48720.4543 H3>H4>H2>H1

     | Show Table
    DownLoad: CSV

    Figure 2 shows graphically the ranking of the alternatives.

    Figure 2.  Ranking of the alternatives using different methods.

    Fractional orthotriple set is more strong apparatus than picture fuzzy set and spherical fuzzy set, and it provides extra space to decision makers for decision making in several real-life problems. Also, aggregation operators are wont to reduce the set of finite values into one value, so motivated by the generality of fractional orthotriple fuzzy set and basic characteristics of aggregation operators, during this article. We've initiated some new aggregation operator supported Frank t-norm and t-conorm, called FOFCFA and FOFCFG operators. Moreover, some basic properties of those aggregation operators are elaborated intimately. Multi-attribute decision making algorithm supported these operators has introduced an alongside application to point out the effectiveness of introduced work. The proposed algorithm is considered for classifier selection for EEG under depression information based on given attribute. The proposed decision making method analyzes the k-nearest neighbor algorithm, Gaussian mixture model, decision tree and probabilistic neural network. The proposed method is attribute based for analyzing optimal classifier selection for EEG under depression patients. We used the classifier method to obtain depression patients data in normal situations and abnormal situation based on the given attributes. Furthermore, a comparative study of the proposed work has been given to point out the authenticity and the superiority of the proposed work. Although the focus of this paper is hybrid sets of fuzzy sets, it can also be applied to other types of structures.

    How to determine the parameter θ in the proposed operators according to the practical situations has not been discussed in the current paper, which is an interesting topic and is worthy to be further studied in the future. Moreover, in the future we will apply the proposed operators and approach to some practical applications such as soft sets, Cubic fuzzy sets, Bipolar fuzzy sets, fractional orthotriple fuzzy rough sets, Linear Diophantine fuzzy sets, Linear Diophantine fuzzy graphs.

    The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work under grant code 22UQU4310396DSR42.

    The authors declare that they have no conflicts of interest.



    [1] K. T. Atanassov, More on intuitionistic fuzzy sets, Fuzzy Set. Syst., 33 (1989), 37–45. https://doi.org/10.1016/0165-0114(89)90215-7 doi: 10.1016/0165-0114(89)90215-7
    [2] M. Akram, W. A. Dudek, F. Ilyas, Group decision-making based on pythagorean fuzzy TOPSIS method, Int. J. Intell. Syst., 34 (2019), 1455–1475. https://doi.org/10.1002/int.22103 doi: 10.1002/int.22103
    [3] S. S. Abosuliman, S. Abdullah, M. Qiyas, Three-way decisions making using covering based fractional Orthotriple fuzzy rough set model, Mathematics, 8 (2020), 1121. https://doi.org/10.3390/math8071121 doi: 10.3390/math8071121
    [4] S. Ashraf, S. Abdullah, T. Mahmood, Spherical fuzzy Dombi aggregation operators and their application in group decision making problems, J. Amb. Intell. Hum. Comput., 11 (2020), 2731–2749. https://doi.org/10.1007/s12652-019-01333-y doi: 10.1007/s12652-019-01333-y
    [5] M. K. Alaoui, F. M. Alharbi, S. Zaland, Novel analysis of fuzzy physical models by generalized fractional fuzzy operators, J. Funct. Space., 2022. https://doi.org/10.1155/2022/2504031
    [6] G. Büyüközkan, G. Çifçi, A novel hybrid MCDM approach based on fuzzy DEMATEL, fuzzy ANP and fuzzy TOPSIS to evaluate green suppliers, Expert Syst. Appl., 39 (2012), 3000–3011. https://doi.org/10.1016/j.eswa.2011.08.162 doi: 10.1016/j.eswa.2011.08.162
    [7] O. Barukab, S. Abdullah, S. Ashraf, M. Arif, S. A. Khan, A new approach to fuzzy TOPSIS method based on entropy measure under spherical fuzzy information, Entropy, 21 (2019), 1231. https://doi.org/10.3390/e21121231 doi: 10.3390/e21121231
    [8] T. Calvo, B. De Baets, J. Fodor, The functional equations of Frank and Alsina for uninorms and nullnorms, Fuzzy Set. Syst., 120 (2001), 385–394. https://doi.org/10.1016/S0165-0114(99)00125-6 doi: 10.1016/S0165-0114(99)00125-6
    [9] J. Casasnovas, J. Torrens, An axiomatic approach to fuzzy cardinalities of finite fuzzy sets, Fuzzy Set. Syst., 133 (2003), 193–209. https://doi.org/10.1016/S0165-0114(02)00345-7 doi: 10.1016/S0165-0114(02)00345-7
    [10] T. Y. Chou, C. L. Hsu, M. C. Chen, A fuzzy multi-criteria decision model for international tourist hotels location selection, Int. J. Hosp. Manag., 27 (2008), 293–301. https://doi.org/10.1016/j.ijhm.2007.07.029 doi: 10.1016/j.ijhm.2007.07.029
    [11] B. C. Cuong, V. Kreinovich, Picture fuzzy sets-a new concept for computational intelligence problems, In 2013 Third World Congress on Information and Communication Technologies, 2013, 1–6. https://doi.org/10.1109/WICT.2013.7113099
    [12] G. Deschrijver, Generalized arithmetic operators and their relationship to t-norms in interval-valued fuzzy set theory, Fuzzy Set. Syst., 160 (2009), 3080–3102. https://doi.org/10.1016/j.fss.2009.05.002 doi: 10.1016/j.fss.2009.05.002
    [13] X. Deng, H. Gao, TODIM method for multiple attribute decision making with 2-tuple linguistic pythagorean fuzzy information, J. Intell. Fuzzy Syst., 37 (2019), 1769–1780. https://doi.org/10.3390/sym10100486 doi: 10.3390/sym10100486
    [14] H. Garg, J. Gwak, T. Mahmood, Z. Ali, Power aggregation operators and VIKOR methods for complex q-rung orthopair fuzzy sets and their applications, Mathematics, 8 (2020), 538. https://doi.org/10.3390/math8040538 doi: 10.3390/math8040538
    [15] K. Hayat, M. I. Ali, F. Karaaslan, B. Y. Cao, M. H. Shah, Design concept evaluation using soft sets based on acceptable and satisfactory levels: An integrated TOPSIS and Shannon entropy, Soft Comput., 24 (2020), 2229–2263. https://doi.org/10.1007/s00500-019-04055-7 doi: 10.1007/s00500-019-04055-7
    [16] M. Z. Hanif, N. Yaqoob, M. Riaz, M. Aslam, Linear Diophantine fuzzy graphs with new decision-making approach, AIMS Math., 7 (2022), 14532–14556. https://doi.org/10.3934/math.2022801 doi: 10.3934/math.2022801
    [17] Y. L. Lin, L. H. Ho, S. L. Yeh, T. Y. Chen, A Pythagorean fuzzy TOPSIS method based on novel correlation measures and its application to multiple criteria decision analysis of inpatient stroke rehabilitation, Int. J. Comput. Intel. Syst., 12 (2019), 410–425. https://doi.org/10.2991/ijcis.2018.125905657 doi: 10.2991/ijcis.2018.125905657
    [18] M. Lin, W. Xu, Z. Lin, R. Chen, Determine OWA operator weights using kernel density estimation, Econ. Res.-Ekon. Istraž., 33 (2020), 1441–1464. https://doi.org/10.1080/1331677X.2020.1748509 doi: 10.1080/1331677X.2020.1748509
    [19] M. Lin, X. Li, L. Chen, Linguistic q-rung orthopair fuzzy sets and their interactional partitioned Heronian mean aggregation operators, Int. J. Intell. Syst., 35 (2020), 217–249. https://doi.org/10.1002/int.22136 doi: 10.1002/int.22136
    [20] Y. Liu, G. Wei, S. Abdullah, J. Liu, L. Xu, H. Liu, Banzhaf-Choquet-copula-based aggregation operators for managing q-rung orthopair fuzzy information, Soft Comput., 25 (2021), 6891–6914. https://doi.org/10.1007/s00500-021-05714-4 doi: 10.1007/s00500-021-05714-4
    [21] M. Lin, X. Li, R. Chen, H. Fujita, J. Lin, Picture fuzzy interactional partitioned Heronian mean aggregation operators: An application to MADM process, Artif. Intell. Rev., 55 (2022), 1171–1208. https://doi.org/10.1007/S10462-021-09953-7 doi: 10.1007/S10462-021-09953-7
    [22] P. Meksavang, H. Shi, S. M. Lin, H. C. Liu, An extended picture fuzzy VIKOR approach for sustainable supplier management and its application in the beef industry, Symmetry, 11 (2019), 468. https://doi.org/10.3390/sym11040468 doi: 10.3390/sym11040468
    [23] T. Mahmood, K. Ullah, Q. Khan, N. Jan, An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets, Neural Comput. Appl., 31 (2019), 7041–7053. https://doi.org/10.1007/s00521-018-3521-2 doi: 10.1007/s00521-018-3521-2
    [24] S. Mahnaz, J. Ali, M. A. Malik, Z. Bashir, T-spherical fuzzy Frank aggregation operators and their application to decision making with unknown weight information, IEEE Access, 10 (2021), 7408–7438. https://doi.org/10.1109/ACCESS.2022.3156764 doi: 10.1109/ACCESS.2022.3156764
    [25] M. Naeem, M. Qiyas, M. M. Al-Shomrani, S. Abdullah, Similarity measures for fractional orthotriple fuzzy sets using cosine and cotangent functions and their application in accident emergency response, Mathematics, 8 (2020), 1653. https://doi.org/10.3390/math8101653 doi: 10.3390/math8101653
    [26] M. Qiyas, S. Abdullah, F. Khan, M. Naeem, Banzhaf-Choquet-Copula-based aggregation operators for managing fractional orthotriple fuzzy information, Alex. Eng. J., 61 (2022), 4659–4677. https://doi.org/10.1016/j.aej.2021.10.029 doi: 10.1016/j.aej.2021.10.029
    [27] M. Qiyas, M. Naeem, S. Abdullah, F. Khan, N. Khan, H. Garg, Fractional orthotriple fuzzy rough Hamacher aggregation operators and-their application on service quality of wireless network selection, Alex. Eng. J., 61 (2022), 10433–10452. https://doi.org/10.1016/j.aej.2022.03.002 doi: 10.1016/j.aej.2022.03.002
    [28] M. Riaz, D. Pamucar, A. Habib, N. Jamil, Innovative bipolar fuzzy sine trigonometric aggregation operators and SIR method for medical tourism supply chain, Math. Probl. Eng., 2022. https://doi.org/10.1155/2022/4182740
    [29] M. Riaz, H. M. A. Farid, W. Wang, D. Pamucar, Interval-valued linear Diophantine fuzzy Frank aggregation operators with multi-criteria, Decis.-Making Math., 10 (2022), 1811. https://doi.org/10.3390/math10111811 doi: 10.3390/math10111811
    [30] M. Sugeno, Theory of fuzzy integrals and its applications, Doct. Thesis, Tokyo Institute of technology, 1974.
    [31] E. Szmidt, J. Kacprzyk, Entropy for intuitionistic fuzzy sets, Fuzzy Set. Syst., 118 (2001), 467–477. https://doi.org/10.1016/S0165-0114(98)00402-3 doi: 10.1016/S0165-0114(98)00402-3
    [32] X. Tang, S. Yang, W. Pedrycz, Multiple attribute decision-making approaches based on dual hesitant fuzzy Frank aggregation operators, Appl. Soft Comput., 68 (2018), 525–547. https://doi.org/10.1016/j.asoc.2018.03.055 doi: 10.1016/j.asoc.2018.03.055
    [33] W. S. Wang, H. C. He, Research on flexible probability logic operator based on Frank T/S norms, Acta Elect. Sin., 37 (2009), 1141. https://doi.org/10.31449/inf.v45i3.3025 doi: 10.31449/inf.v45i3.3025
    [34] Y. Xing, R. Zhang, J. Wang, X. Zhu, Some new Pythagorean fuzzy Choquet-Frank aggregation operators for multi-attribute decision making, Int. J. Intell. Syst., 33 (2018), 2189–2215. https://doi.org/10.1002/int.22025 doi: 10.1002/int.22025
    [35] Y. Xing, R. Zhang, Z. Zhou, J. Wang, Some q-rung orthopair fuzzy point weighted aggregation operators for multi-attribute decision making, Soft Comput., 23 (2019), 11627–11649. https://doi.org/10.1007/s00500-018-03712-7 doi: 10.1007/s00500-018-03712-7
    [36] R. R. Yager, On some new classes of implication operators and their role in approximate reasoning, Inform. Sci., 167 (2004), 193–216. https://doi.org/10.1016/j.ins.2003.04.001 doi: 10.1016/j.ins.2003.04.001
    [37] R. R. Yager, Pythagorean fuzzy subsets, In 2013 joint IFSA world congress and NAFIPS annual meeting (IFSA/NAFIPS), 2013, 57–61. https://doi.org/10.1109/IFSA-NAFIPS.2013.6608375
    [38] R. R. Yager, Generalized orthopedic fuzzy sets, IEEE T. Fuzzy Syst., 25 (2016), 1222–1230. https://doi.org/10.1109/TFUZZ.2016.2604005 doi: 10.1109/TFUZZ.2016.2604005
    [39] M. Yahya, S. Abdullah, R. Chinram, Y. D. Al-Otaibi, M. Naeem, Frank aggregation operators and their application to probabilistic hesitant fuzzy multiple attribute decision-making, Int. J. Fuzzy Syst., 23 (2021), 194–215. https://doi.org/10.1007/s40815-020-00970-2 doi: 10.1007/s40815-020-00970-2
    [40] L. A. Zadeh, Fuzzy sets, Inf. Control, 8 (1965), 338–353. https://doi.org/10.2307/2272014
    [41] S. Zeng, M. Qiyas, M. Arif, T. Mahmood, Extended version of linguistic picture fuzzy TOPSIS method and its applications in enterprise resource planning systems, Math. Probl. Eng., 2019. https://doi.org/10.1155/2019/8594938
    [42] F. Zhou, T. Y. Chen, An extended Pythagorean fuzzy VIKOR method with risk preference and a novel generalized distance measure for multicriteria decision-making problems, Neural Comput. Appl., 33 (2021), 11821–11844. https://doi.org/10.1007/s00521-021-05829-7 doi: 10.1007/s00521-021-05829-7
  • This article has been cited by:

    1. Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan, Sine hyperbolic fractional orthotriple linear Diophantine fuzzy aggregation operator and its application in decision making, 2023, 8, 2473-6988, 11916, 10.3934/math.2023602
    2. Muhammad Qiyas, Darjan Karabasevic, Neelam Khan, Srdjan Maričić, Einstein Exponential Operational Laws Based on Fractional Orthotriple Fuzzy Sets and Their Applications in Decision Making Problems, 2024, 12, 2227-7390, 3216, 10.3390/math12203216
    3. Hsiu-Sen Chiang, Mu-Yen Chen, 2024, Chapter 6, 978-3-031-66841-8, 163, 10.1007/978-3-031-66842-5_6
    4. Ziling Lu, Jian Wang, A novel and efficient multi-scale feature extraction method for EEG classification, 2024, 9, 2473-6988, 16605, 10.3934/math.2024805
    5. Arun Sarkar, Ömer Faruk Görçün, Fatih Ecer, Tapan Senapati, Hande Küçükönder, Evaluating the financial credibility of third-party logistic providers through a novel frank operators-driven group decision-making model with dual hesitant linguistic q-rung orthopair fuzzy information, 2025, 139, 09521976, 109483, 10.1016/j.engappai.2024.109483
    6. Muhammad Qiyas, Neelam Khan, Darjan Karabasevic, Muhammad Luqman Alvi, Decision support model under the fractional orthotriple fuzzy information, 2025, 144, 09521976, 110114, 10.1016/j.engappai.2025.110114
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1609) PDF downloads(73) Cited by(6)

Figures and Tables

Figures(2)  /  Tables(3)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog