Loading [MathJax]/jax/element/mml/optable/Latin1Supplement.js
Research article

An accelerated conjugate gradient method for the Z-eigenvalues of symmetric tensors

  • Received: 06 February 2023 Revised: 23 March 2023 Accepted: 30 March 2023 Published: 23 April 2023
  • MSC : 15A18, 15A69, 90C55

  • We transform the Z-eigenvalues of symmetric tensors into unconstrained optimization problems with a shifted parameter. An accelerated conjugate gradient method is proposed for solving these unconstrained optimization problems. If solving problem results in a nonzero critical point, then it is a Z-eigenvector corresponding to the Z-eigenvalue. Otherwise, we solve the shifted problem to find a Z-eigenvalue. In our method, the new conjugate gradient parameter is a modified CD conjugate gradient parameter, and an accelerated parameter is presented by using the quasi-Newton direction. The global convergence of new method is proved. Numerical experiments are listed to illustrate the efficiency of the proposed method.

    Citation: Mingyuan Cao, Yueting Yang, Chaoqian Li, Xiaowei Jiang. An accelerated conjugate gradient method for the Z-eigenvalues of symmetric tensors[J]. AIMS Mathematics, 2023, 8(7): 15008-15023. doi: 10.3934/math.2023766

    Related Papers:

    [1] Rana Muhammad Zulqarnain, Xiao Long Xin, Muhammad Saeed . Extension of TOPSIS method under intuitionistic fuzzy hypersoft environment based on correlation coefficient and aggregation operators to solve decision making problem. AIMS Mathematics, 2021, 6(3): 2732-2755. doi: 10.3934/math.2021167
    [2] Yanhong Su, Zengtai Gong, Na Qin . Complex interval-value intuitionistic fuzzy sets: Quaternion number representation, correlation coefficient and applications. AIMS Mathematics, 2024, 9(8): 19943-19966. doi: 10.3934/math.2024973
    [3] Xiaoyan Zhou, Mingwei Lin, Weiwei Wang . Statistical correlation coefficients for single-valued neutrosophic sets and their applications in medical diagnosis. AIMS Mathematics, 2023, 8(7): 16340-16359. doi: 10.3934/math.2023837
    [4] Muhammad Riaz, Maryam Saba, Muhammad Abdullah Khokhar, Muhammad Aslam . Novel concepts of m-polar spherical fuzzy sets and new correlation measures with application to pattern recognition and medical diagnosis. AIMS Mathematics, 2021, 6(10): 11346-11379. doi: 10.3934/math.2021659
    [5] Chunfeng Suo, Yan Wang, Dan Mou . The new construction of knowledge measure on intuitionistic fuzzy sets and interval-valued intuitionistic fuzzy sets. AIMS Mathematics, 2023, 8(11): 27113-27127. doi: 10.3934/math.20231387
    [6] 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
    [7] Harish Garg, Rishu Arora . TOPSIS method based on correlation coefficient for solving decision-making problems with intuitionistic fuzzy soft set information. AIMS Mathematics, 2020, 5(4): 2944-2966. doi: 10.3934/math.2020190
    [8] Changlin Xu, Yaqing Wen . New measure of circular intuitionistic fuzzy sets and its application in decision making. AIMS Mathematics, 2023, 8(10): 24053-24074. doi: 10.3934/math.20231226
    [9] Naveen Kumar Akula, Sharief Basha. S . Regression coefficient measure of intuitionistic fuzzy graphs with application to soil selection for the best paddy crop. AIMS Mathematics, 2023, 8(8): 17631-17649. doi: 10.3934/math.2023900
    [10] Muhammad Zeeshan Hanif, Naveed Yaqoob, Muhammad Riaz, Muhammad Aslam . Linear Diophantine fuzzy graphs with new decision-making approach. AIMS Mathematics, 2022, 7(8): 14532-14556. doi: 10.3934/math.2022801
  • We transform the Z-eigenvalues of symmetric tensors into unconstrained optimization problems with a shifted parameter. An accelerated conjugate gradient method is proposed for solving these unconstrained optimization problems. If solving problem results in a nonzero critical point, then it is a Z-eigenvector corresponding to the Z-eigenvalue. Otherwise, we solve the shifted problem to find a Z-eigenvalue. In our method, the new conjugate gradient parameter is a modified CD conjugate gradient parameter, and an accelerated parameter is presented by using the quasi-Newton direction. The global convergence of new method is proved. Numerical experiments are listed to illustrate the efficiency of the proposed method.



    A medical emergency (ME) is defined as an illness or acute injury that presents a life-threatening or long-term health risk; it is also sometimes referred to as a "life or limb" situation. Many of these emergencies, such as gastrointestinal, cardiovascular (heart), and respiratory emergencies, cannot be handled by the patient alone; therefore, they may require help from a health expert [1]. When someone experiences an ME, getting them medical attention quickly can save their lives. Finding the location and quickest route to the closest emergency department (ED) is one of the main issues for MEs. Unstoppable bleeding, breathing issues (difficulty breathing, shortness of breath), head or spine injury, severe or persistent vomiting, abrupt injury from an accident, burns or smoke inhalation, near drowning, deep or large wounds/injuries, sudden intense pain anywhere in the body, sudden dizziness, weakness, swallowing of a poisonous substance, severe abdominal pain, unusual headache, seizure, bluish or grey skin coloration (cyanosis), shift in mental status, chest pain, choking, persistent coughing, vomiting of blood, fainting or losing consciousness, etc. are some of the warning signs of an ME [2].

    The ED is peopled by physicians, nurses, and other medical professionals. A triage nurse or doctor is the first medical professional to treat a patient in an emergency; they assess the patient's condition and decide whether to call a consultant. The most seriously injured patients are treated right away. For this reason, some patients who arrive at the ED late might receive medical attention first. In the ED, the procedures to be followed are typically triage, registration, treatment, reevaluation, and discharge of the patient. When a patient is brought to the ED, emergency technicians use the patient's medical history and a quick physical examination to ascertain the reason for the visit and severity of the patient's illness. The stages in the ED are as follows: Level 1 (resuscitation immediate life-saving intervention); Level 2 (emergency medical attention); Level 3 (urgent medical attention); Level 4 (semi-urgent medical attention); and Level 5 (non-urgent medical attention). The triage registered nurse assigns a patient to a priority level based on their medical history and current condition. Millions of people are affected by MEs every year. Medical errors, insufficient access to timely care, and subpar healthcare systems can result in fatalities. To shorten the time that patients must wait for medical attention, an emergency registered nurse may occasionally begin diagnostic testing. Most of the time, errors in determining the severity of ME cases have led to the deaths of some patients who were waiting to consult a professional.

    Accurate and prompt diagnosis is crucial for optimizing the possible advantages of therapy. Uncertainty must be controlled throughout the diagnostic process to enable a precise and prompt diagnosis and treatments. However, an inability to control diagnostic uncertainty may result in misdiagnosis or delayed conditions and/or postponed or unneeded tests and/or treatments [3,4]. According to Sklar et al. [5], years of experience in practicing medicine reduces uncertainty in medical decision-making. In actuality, practicing medicine involves a certain amount of uncertainty. As stated by Platts-Mills et al. [6], uncertainty in an ME originates from a variety of sources. Some patients brought to the ED are unknowns; uncertainty about their history, especially the type and timing of symptoms prior to the ED visit, uncertainty about the current understanding of their signs and causes of their disease, uncertainty about the limitations of diagnostic tests, uncertainty about the advantages and disadvantages of their treatments, etc. are a few examples of the uncertainties that may exist. The introduction of fuzzy set theory [7], on the other hand, has significantly reduced uncertainty in decision-making.

    The fuzzy set is described by the membership degree (MD) of elements defined in a closed unit interval [0,1]. But, there are some decision-making problems that require a non-MD (NMD) compartment with the flexibility to accommodate hesitancy, which a fuzzy set is unable to handle. To address such challenges, Atanassov [8] introduced intuitionistic fuzzy sets (IFSs), which combine the MD and NMD in such a way that, 1-MD is not necessarily equal to the NMD and the intuitionistic fuzzy hesitation margin (IFHM) is one minus the sum of MD and NMD. Thses attributes position the theory of IFSs as a formidable soft computing tool for resolving problems of uncertainty and imprecision in everyday encounters. In [9,10,11], applications of IFSs in decision-making have been discussed from the perspective of aggregation operators, and Szmidt et al. [12] discussed the usefulness of IFSs in attributes selection. A ranking technique that applies information fusion under IFSs has been used to address threat assessment [13], and Zeng et al. [14] discussed pattern recognition by employing a distance method for IFSs. Some applications of the theory of IFSs have been discussed via composite relations [15], distance measures [16,17,18,19], and similarity measures [20,21,22,23,24,25] due to the practicality of IFSs. In addition, Alcantud [26] investigated multi-attribute group decision-making (MAGDM) under IFSs by using weighted geometric mean aggregation operators, and a figure skating application based on intuitionistic fuzzy divergences can be found in [27].

    Many real-life applications of IFSs have been discussed from the perspective of IFCC. Correlation analysis is a statistical method that is used to ascertain the grade of connection between two sets of numerically continuous data. This type of analysis is used when an investigator needs to investigate the relationship between two variables. The correlation coefficient is a statistical tool that is applied to calculate the degree of association between two variables. To improve the applicability of IFSs in real-world scenarios, intuitionistic fuzzy information has been integrated into a correlation analysis construct [28]. Intuitionistic fuzzy correlation analysis has been conducted for probability spaces [29]. Huang and Guo [30] presented a strong method, but they did so by taking into account only two parameters of the IFSs, and Hung [31] examined IFCM from a statistical standpoint. Liu et al. [32] developed a statistical technique for computing IFCM via variance and covariance analyses and implemented for decision-making. The method in [31] was independently improved in [33,34] by the inclusion of IFHMs to prevent omission error. Similarly, a statistical approach for computing IFCM has been developed and implemented for decision-making [35]. A novel IFCC method was presented by Xu [36] to discuss disease diagnosis. To improve accuracy, the methodology in [36] was altered by adding all the convention parameters of IFSs [37].

    The study in [38] examined comparable methods for computing the IFCC. Zeng and Li [39] created a similar IFCC approach that incorporated IFHMs into the approach in [28] for the purposes of inclusion and relaibility. In [40], the approach developed by Huang and Guo [30] was enhanced by the inclusion of the complete parameters of IFSs and applied in pattern recognition; additionally, and Bajaj and Kumar [41] modified the approach in [40] and realized better performance. Some IFCMs have been constructed and applied in medical diagnosis [42], decision-making [43,44,45,46], and pattern recognition [47]. In addition, the study of correlation coefficients in the fuzzy domain has been extended to higher variants of fuzzy sets with relevant applications [48,49,50,51,52].

    The existing IFCM approaches have some limitations with regards to the conditions of the correlation coefficient and reliable interpretation. Almost all of the existing approaches were developed based on Pearson's correlation coefficient model, and none of them were constructed by using Spearman's correlation coefficient model. The methods in [28,38,39] fails to provide reliable information if the MDs and NMDs are either one or zero. The methods in [28,31,33,35] indicate that a perfect positive correlation exists, although the IFSs are not identical and thus violate a maxim of the correlation coefficient. In addition, the IFCMs in [30,32,36,37,40,41] provide values that are not defined within either [0,1] or [1,1], which violate another maxim of the correlation coefficient. When the IFSs are equal, the IFCMs of [36,37] produce 0/0, which is mathematically undefined. For equal IFSs, the correlation coefficient should be one. Furthermore, the methods of [36,37] yield a perfect correlation coefficient in the absence of equality between the IFSs. To recap, all of the IFCMs fail the metric conditions of the correlation coefficient in some ways.

    Because of the limitations of the existing IFCMs, we develop two reliable approaches for measuring IFCCs in this work. This study is aimed at creating two new Spearman correlation coefficient-based IFCM approaches that have solid mathematical correctness, a reasonable level of interpretation, and dependable precision. To prevent omission errors, the measures integrate all parameters of the IFSs. The objectives of the work are delineated as follows: (ⅰ) to restate and evaluate the extant methods of IFCM; (ⅱ) to create new IFCMs based on Spearman's correlation coefficient, where all of the parameters of IFSs are incorporated to produce dependable output; (ⅲ) to apply the created IFCMs in the determination of an ME by using a knowledge-based approach; (ⅳ) to conduct comparative analysis between the available IFCMs and the new approaches to showcase the advantage of the former.

    The paper is organized as follows: In Section 2, the basics of IFSs and some of the current IFCMs are covered. In Section 3, the new methods are introduced, along with their numerical proofs and the description of some of their properties. In Section 4, an ME designed based on a knowledge-based approach is determined to ascertain the most critically ill patient to enhance effective treatment. Finally, in Section 5, the findings are summarized and suggestions for additional research are provided.

    In this section, we reiterate the concept of IFSs and present IFCC together with some existing IFCMs.

    Throughout this work, we take X as a non-empty set, which is the underlying set of IFSs.

    Definition 2.1. [7] A set with the structure of the form, ={xj,δ(xj)|xjX}, where δ(xj)[0,1] is the MD of xjX to , is called a fuzzy set.

    Definition 2.2. [8] A set with the form ={xj,δ(xj),κ(xj)|xjX}, where δ(xj),κ(xj)[0,1] denote the MD and NMD of xjX to with the property, 0δ(xj)+κ(xj)1 is called an IFS. In addition, the IFHM of in X is described by ϱ(xj)=1δ(xj)κ(xj). The IFHM indicates whether xjX or xjX.

    Definition 2.3. [8] Suppose that and ˜ are IFSs in X. Then, the following are some basic operations on the IFSs:

    (ⅰ) c={xj,κ(xj),δ(xj)|xjX}, ˜c={xj,κ˜(xj),δ˜(xj)|xjX}.

    (ⅱ) ˜={xj,max{δ(xj),δ˜(xj)},min{κ(xj),κ˜(xj)}|xjX}.

    (ⅲ) ˜={xj,min{δ(xj),κ˜(xj)},max{δ(xj),κ˜(xj)}|xjX}.

    (ⅳ) =˜ iff δ(xj)=δ˜(xj) and κ(xj)=κ˜(xj) xjX.

    (ⅴ) ˜ iff δ(xj)δ˜(xj) and κ(xj)κ˜(xj) xjX.

    Definition 2.4. Suppose that and ˜ are IFSs in X. Then, the arithmetic average of the IFSs and ˜ denoted by ˆ is defined as follows:

    ˆ={xj,δˆ(xj),κˆ(xj)|xjX},

    where

    δˆ(xj)=Average(δ(xj),δ˜(xj))andκˆ(xj)=Average(κ(xj),κ˜(xj)).

    Definition 2.5. [28] If and ˜ are IFSs in X={x1,x2,,xq} and q is the cardinality of X, then the IFCC between and ˜ represented by ρ(,˜) is a function ρ:IFS(X)×IFS(X)[0,1]or[1,1] with the following properties:

    A1. 0ρ(,˜)1 or 1ρ(,˜)1,

    A2. ρ(,˜)=1 iff =˜,

    A3. ρ(,˜)=ρ(˜,).

    To enable better understanding of the IFCC, we present the following information: ρ(,˜) tending to 1 is an indication that and ˜ have strong correlation; ρ(,˜) tending to 1 or 0 is an indication that and ˜ have weak correlation; ρ(,˜)=1 indicates a perfect positive correlation; and ρ(,˜)=0or1 indicates no correlation or a perfect negative correlation.

    Given two IFSs and ˜ in X={x1,x2,,xq}, an existing IFCM can be described as follows [28]:

    ρ1(,˜)=K(,˜)I()I(˜), (2.1)

    where

    K(,˜)=qj=1(δ(xj)δ˜(xj)+κ(xj)κ˜(xj))I()=qj=1(δ2(xj)+κ2(xj))I(˜)=qj=1(δ2˜(xj)+κ2˜(xj))}. (2.2)

    Example 2.1. Suppose that ={x,13,13} and ˜={x,14,14} are IFSs in X={x}. Then, ρ1(,˜)=1, which is a violation of A2 of Definition 2.5 since ˜.

    According to Hung [31],

    ρ2(,˜)=ρm(,˜)+ρn(,˜)2, (2.3)

    where

    ρm(,˜)=Σqj=1(δ(xj)¯δ)(δ˜(xj)¯δ˜)Σqj=1(δ(xj)¯δ)2Σqj=1(δ˜(xj)¯δ˜)2ρn(,˜)=Σqj=1(κ(xj)¯κ)(κ˜(xj)¯κ˜)Σqj=1(κ(xj)¯κ)2Σqj=1(κ˜(xj)¯κ˜)2}, (2.4)

    where

    ¯δ=Σqj=1δ(xj)q,¯δ˜=Σqj=1δ˜(xj)q¯κ=Σqj=1κ(xj)q,¯κ˜=Σqj=1κ˜(xj)q}. (2.5)

    for j=1,2,,q.

    Example 2.2. Let ={x1,14,14,x2,18,18} and ˜={x1,12,12,x2,14,14} be IFSs in X={x1,x2}; then, ρ2(,˜)=1, which violates A2 of Definition 2.5 because ˜.

    According to Zeng and Li [39],

    ρ3(,˜)=K(,˜)I()I(˜), (2.6)

    where

    K(,˜)=qj=1(δ(xj)δ˜(xj)+κ(xj)κ˜(xj)+ϱ(xj)ϱ˜(xj))qI()=qj=1(δ2(xj)+κ2(xj)+ϱ2(xj))qI(˜)=qj=1(δ2˜(xj)+κ2˜(xj)+ϱ2˜(xj))q}. (2.7)

    Example 2.3. Let ={x1,1,0,x2,0,1} and ˜={x1,0,1,x2,1,0} be IFSs in a set X={x1,x2}; then, ρ3(,˜)=0, which gives a misleading information since an imprecise correlation exists between the IFSs.

    According to Xu et al. [38],

    ρ4(,˜)=K(,˜)max{I(),I(˜)}, (2.8)

    where

    K(,˜)=qj=1(δ(xj)δ˜(xj)+κ(xj)κ˜(xj)+ϱ(xj)ϱ˜(xj))I()=qj=1(δ2(xj)+κ2(xj)+ϱ2(xj))I(˜)=qj=1(δ2˜(xj)+κ2˜(xj)+ϱ2˜(xj))}. (2.9)

    Using Example 2.3, we get ρ4(,˜)=0, which is not true because an imprecise correlation exists between the IFSs.

    According to Park et al. [33],

    ρ5(,˜)=ρm(,˜)+ρn(,˜)+ρh(,˜)3, (2.10)

    where

    ρm(,˜)=Σqj=1(δ(xj)¯δ)(δ˜(xj)¯δ˜)Σqj=1(δ(xj)¯δ)2Σqj=1(δ˜(xj)¯δ˜)2ρn(,˜)=Σqj=1(κ(xj)¯κ)(κ˜(xj)¯κ˜)Σqj=1(κ(xj)¯κ)2Σqj=1(κ˜(xj)¯κ˜)2ρh(,˜)=Σqj=1(ϱ(xj)¯ϱ)(ϱ˜(xj)¯ϱ˜)Σqj=1(ϱ(xj)¯ϱ)2Σqj=1(ϱ˜(xj)¯ϱ˜)2}, (2.11)

    where

    ¯δ=Σqj=1δ(xj)q,¯δ˜=Σqj=1δ˜(xj)q¯κ=Σqj=1κ(xj)q,¯κ˜=Σqj=1κ˜(xj)q¯ϱ=Σqj=1ϱ(xj)q,¯ϱ˜=Σqj=1ϱ˜(xj)q} (2.12)

    for j=1,2,,q. Using Example 2.2, we get ρ5(,˜)=1 which violates A2 of Definition 2.5 because ˜.

    According to Xu [36],

    ρ6(,˜)=12qqj=1(Δδmin+ΔδmaxΔδj+Δδmax+Δκmin+ΔκmaxΔκj+Δκmax), (2.13)

    where

    Δδj=|δ(xj)δ˜(xj)|Δκj=|κ(xj)κ˜(xj)|Δδmin=min1jq{Δδj},Δκmin=min1jq{Δκj}Δδmax=max1jq{Δδj},Δκmax=max1jq{Δκj}}. (2.14)

    Using Example 2.2, we get ρ6(,˜)=1.1667 which violates A1 of Definition 2.5 because neither 1.1667[0,1] nor 1.1667[1,1].

    According to Xu and Cai [37],

    ρ7(,˜)=13qqj=1(Δδmin+ΔδmaxΔδj+Δδmax+Δκmin+ΔκmaxΔκj+Δκmax+Δϱmin+ΔϱmaxΔϱj+Δϱmax), (2.15)

    where

    Δδj=|δ(xj)δ˜(xj)|Δκj=|κ(xj)κ˜(xj)|Δϱj=|ϱ(xj)ϱ˜(xj)|Δδmin=min1jq{Δδj},Δκmin=min1jq{Δκj}Δϱmin=min1jq{Δϱj},Δδmax=max1jq{Δδj}Δκmax=max1jq{Δκj},Δϱmax=max1jq{Δϱj}}. (2.16)

    Example 2.4. Let ={x1,25,310,x2,310,15} and ˜={x1,310,15,x2,15,110} be IFSs in X={x1,x2}; then, ρ7(,˜)=1 although ˜, which violates A2 of Definition 2.5. If =˜, we have ρ7(,˜)=00, which violates A1 of Definition 2.5.

    According to Liu et al. [32],

    ρ8(,˜)=ϕ(,˜)ψ()ψ(˜), (2.17)

    where

    ψ()=Σqj=1D2()q1,ψ(˜)=Σqj=1D2(˜)q1ϕ(,˜)=Σqj=1D()D(˜)q1} (2.18)

    for

    D()=(δ(xj)¯δ)(κ(xj)¯κ)D(˜)=(δ˜(xj)¯δ˜)(κ˜(xj)¯κ˜)}, (2.19)

    where ¯δ, ¯κ, ¯δ˜, and ¯κ˜ are as in (2.5).

    Example 2.5. Let ={x1,13,13,x2,12,12} and ˜={x1,14,14,x2,12,13} be IFSs in X={x1,x2}, then we get ρ8(,˜)=00×0=, which violates A1 of Definition 2.5.

    According to Thao et al. [35],

    ρ9(,˜)=ϕ(,˜)ψ()ψ(˜), (2.20)

    where

    ψ()=1q1Σqj=1((δ(xj)¯δ)2+(κ(xj)¯κ)2)ψ(˜)=1q1Σqj=1((δ˜(xj)¯δ˜)2+(κ˜(xj)¯κ˜)2)ϕ(,˜)=1q1Σqj=1((δ(xj)¯δ)(δ˜(xj)¯δ˜)+(κ(xj)¯κ)(κ˜(xj)¯κ˜))}, (2.21)

    where ¯δ, ¯κ, ¯δ˜, and ¯κ˜ are as in (2.5).

    Example 2.6. Let ={x1,12,12,x2,12,12} and ˜={x1,13,13,x2,13,13} be IFSs in X={x1,x2}; then, ρ9(,˜)=00×0=, which violates A1 of Definition 2.5.

    According to Huang and Guo [30],

    ρ10(,˜)=12qqj=1(αj(1Δδj)+βj(1Δκj)), (2.22)

    where

    αj=cΔδjΔδmaxcΔδminΔδmaxβj=cΔκjΔκmaxcΔκminΔκmax} (2.23)

    for c>2, and

    Δδj=|δ(xj)δ˜(xj)|Δκj=|κ(xj)κ˜(xj)|Δδmin=min1jq{Δδj},Δκmin=min1jq{Δκj}Δδmax=max1jq{Δδj},Δκmax=max1jq{Δκj}}. (2.24)

    Example 2.7. Suppose that we have IFSs

    ={x1,25,3160,x2,1115,1160,x3,56,760,x4,35,1960,x5,1330,12,x6,710,15,x7,115,14},
    ˜={x1,1330,715,x2,2330,320,x3,56,760,x4,23,1360,x5,2330,16,x6,710,15,x7,115,14}

    defined in X={x1,x2,,x7}. Then, ρ10(,˜)=1.0399, which is not within [0,1]. Thus, it violates A1 of Definition 2.5.

    According to Ejegwa et al. [40],

    ρ11(,˜)=13qqj=1(αj(1Δδj)+βj(1Δκj)+γj(1Δϱj)), (2.25)

    where

    αj=cΔδjΔδmaxcΔδminΔδmaxβj=cΔκjΔκmaxcΔκminΔκmaxγj=cΔϱjΔϱmaxcΔϱminΔϱmax} (2.26)

    for c>2, and

    Δδj=|δ(xj)δ˜(xj)|Δκj=|κ(xj)κ˜(xj)|Δϱj=|ϱ(xj)ϱ˜(xj)|Δδmin=min1jq{Δδj},Δκmin=min1jq{Δκj}Δϱmin=min1jq{Δϱj},Δδmax=max1jq{Δδj}Δκmax=max1jq{Δκj},Δϱmax=max1jq{Δϱj}}. (2.27)

    Using Example 2.7, we get ρ11(,˜)=1.0272, which is not within [0,1]. Thus, it violates A1 of Definition 2.5.

    According to Bajaj and Kumar [41],

    ρ12(,˜)=13qqj=1(αj(1Δδj)+βj(1Δκj)+γj(1Δϱj)), (2.28)

    where αj, βj and γj are as in (2.26), and

    Δδj=|δ(xj)δ˜(xj)|+|δ2(xj)δ2˜(xj)|2Δκj=|κ(xj)κ˜(xj)|+|κ2(xj)κ2˜(xj)|2Δϱj=|ϱ(xj)ϱ˜(xj)|+|ϱ2(xj)ϱ2˜(xj)|2Δδmin=min1jq{Δδj},Δκmin=min1jq{Δκj}Δϱmin=min1jq{Δϱj},Δδmax=max1jq{Δδj}Δκmax=max1jq{Δκj},Δϱmax=max1jq{Δϱj}}. (2.29)

    Using Example 2.7, we get ρ12(,˜)=1.0266, which violates A1 of Definition 2.5.

    In consideration of the shortcomings of the existing IFCMs, we develop new IFCMs based on the classical Spearman correlation coefficient as follows:

    Definition 3.1. Suppose that and ˜ are IFSs in X={x1,x2,,xq}. Then, the new IFCMs are as follows:

    ρa(,˜)=13(ρm(,˜)+ρn(,˜)+ρh(,˜)), (3.1)

    where

    ρm(,˜)=16qj=1(δ(xj)δ˜(xj))2q(q2+1)ρn(,˜)=16qj=1(κ(xj)κ˜(xj))2q(q2+1)ρh(,˜)=16qj=1(ϱ(xj)ϱ˜(xj))2q(q2+1)}. (3.2)

    In the case of the classical Spearman correlation model, we have q(q21) instead of q(q2+1). If q(q21) is used and q=1, we get

    ρ(,˜)=,

    since

    ρm(,˜)=16qj=1(δ(xj)δ˜(xj))2q(q21)=ρn(,˜)=16qj=1(κ(xj)κ˜(xj))2q(q21)=ρh(,˜)=16qj=1(ϱ(xj)ϱ˜(xj))2q(q21)=}.

    In the case of q(q21), the new IFCM is undefined when q=1. Hence, we used q(q2+1) instead. Similarly, we have

    ρb(,˜)=13(ρm(,˜)+ρn(,˜)+ρh(,˜)), (3.3)

    where

    ρm(,˜)=16qj=1(δ(xj)δ˜(xj))2(q+1)3(q+1)ρn(,˜)=16qj=1(κ(xj)κ˜(xj))2(q+1)3(q+1)ρh(,˜)=16qj=1(ϱ(xj)ϱ˜(xj))2(q+1)3(q+1)}. (3.4)

    Now, we discuss the properties of the new IFCMs through the following theorems.

    Theorem 3.1. The new IFCM ρa(,˜) between IFSs and ˜ in X is comparable to

    16qj=13q(q2+1){(δ(xj)δ˜(xj))2+(κ(xj)κ˜(xj))2+(ϱ(xj)ϱ˜(xj))2}.

    Proof. Recall that

    ρa(,˜)=13{16qj=1(δ(xj)δ˜(xj))2q(q2+1)+16qj=1(κ(xj)κ˜(xj))2q(q2+1)+16qj=1(ϱ(xj)ϱ˜(xj))2q(q2+1)}.

    Then, we have

    ρa(,˜)=13{q(q2+1)6qj=1(δ(xj)δ˜(xj))2q(q2+1)+q(q2+1)6qj=1(κ(xj)κ˜(xj))2q(q2+1)+q(q2+1)6qj=1(ϱ(xj)ϱ˜(xj))2q(q2+1)}=13q(q2+1){3q(q2+1)6qj=1(δ(xj)δ˜(xj))26qj=1(κ(xj)κ˜(xj))26qj=1(ϱ(xj)ϱ˜(xj))2}=13q(q2+1){3q(q2+1)6qj=1((δ(xj)δ˜(xj))2+(κ(xj)κ˜(xj))2+(ϱ(xj)ϱ˜(xj))2)}=16qj=13q(q2+1){(δ(xj)δ˜(xj))2+(κ(xj)κ˜(xj))2+(ϱ(xj)ϱ˜(xj))2}

    as expected.

    Theorem 3.2. The IFCM ρb(,˜) between IFSs and ˜ in X is comparable to

    16qj=13((q+1)3(q+1)){(δ(xj)δ˜(xj))2+(κ(xj)κ˜(xj))2+(ϱ(xj)ϱ˜(xj))2}.

    Proof. The proof is as in Theorem 3.1.

    Theorem 3.3. The new IFCM ρa(,˜) between IFSs and ˜ in X satisfies the correlation coefficient conditions.

    Proof. We shall prove the following correlation coefficient conditions:

    (ⅰ) |ρa(,˜)|1,

    (ⅱ) ρa(,˜)=1 iff =˜,

    (ⅲ) ρa(,˜)=ρa(˜,).

    Now, |ρa(,˜)|1 implies that 0ρa(,˜)1. First, since (δ(xj)δ˜(xj))20, (κ(xj)κ˜(xj))20 and (ϱ(xj)ϱ˜(xj))20, then ρa(,˜)0 follows immediately.

    Second, assume that

    6qj=1(δ(xj)δ˜(xj))2=Θ1,6qj=1(κ(xj)κ˜(xj))2=Θ2
    6qj=1(ϱ(xj)ϱ˜(xj))2=Θ3.

    Then,

    ρa(,˜)=16qj=13q(q2+1){(δ(xj)δ˜(xj))2+(κ(xj)κ˜(xj))2+(ϱ(xj)ϱ˜(xj))2}113q(q2+1){6qj=1(δ(xj)δ˜(xj))2+6qj=1(κ(xj)κ˜(xj))2+6qj=1(ϱ(xj)ϱ˜(xj))2}=1(Θ1+Θ1+Θ1)3q(q2+1).

    Thus,

    ρa(,˜)1=(Θ1+Θ1+Θ1)3q(q2+1)0,

    and so ρa(,˜)1. Because ρa(,˜)0 and ρa(,˜)1, we have |ρa(,˜)|1, which proves (ⅰ).

    Suppose that ρa(,˜)=1; then, we get

    6qj=13q(q2+1){(δ(xj)δ˜(xj))2+(κ(xj)κ˜(xj))2+(ϱ(xj)ϱ˜(xj))2}=0,

    i.e., (δ(xj)δ˜(xj))2=0, (κ(xj)κ˜(xj))2=0 and (ϱ(xj)ϱ˜(xj))2=0. Thus, δ(xj)=δ˜(xj), κ(xj)=κ˜(xj) and ϱ(xj)ϱ˜(xj). Hence, =˜.

    Conversely, if =˜, then,

    6qj=13q(q2+1){(δ(xj)δ˜(xj))2+(κ(xj)κ˜(xj))2+(ϱ(xj)ϱ˜(xj))2}=0,

    and hence, ρa(,˜)=1, which proves (ⅱ).

    Finally, we prove (ⅲ). Now, since

    ρa(,˜)=13{16qj=1(δ(xj)δ˜(xj))2q(q2+1)+16qj=1(κ(xj)κ˜(xj))2q(q2+1)+16qj=1(ϱ(xj)ϱ˜(xj))2q(q2+1)}=13{q(q2+1)6qj=1(δ(xj)δ˜(xj))2q(q2+1)+q(q2+1)6qj=1(κ(xj)κ˜(xj))2q(q2+1)+q(q2+1)6qj=1(ϱ(xj)ϱ˜(xj))2q(q2+1)}=13{q(q2+1)6qj=1(δ˜(xj)δ(xj))2q(q2+1)+q(q2+1)6qj=1(κ˜(xj)κ(xj))2q(q2+1)+q(q2+1)6qj=1(ϱ˜(xj)ϱ(xj))2q(q2+1)}=ρa(˜,),

    then, (ⅲ) is proved.

    Theorem 3.4. The function ρb(,˜) between IFSs and ˜ in X satisfies the correlation coefficient conditions.

    Proof. The proof is analogous to Theorem 3.3.

    Here, we justify the superiority of the developed IFCMs over the existing methods [28,30,31,32,33,35,36,37,38,39,40,41]. Table 1 lists the results of the numerical analysis.

    Table 1.  Results of the Numerical Analysis.
    Examples Existing IFCMs New IFCMs
    Example 2.1 ρ1(,˜)=1 ρa(,˜)=0.9584,
    ρb(,˜)=0.9861
    Example 2.2 ρ1(,˜)=1, ρ2(,˜)=1,
    ρ5(,˜)=1, ρ6(,˜)=1.1667,
    ρ7(,˜)=1.1667, ρ8(,˜)=0,
    ρ9(,˜)=1
    ρa(,˜)=0.9063,
    ρb(,˜)=0.9609
    Example 2.3 ρ1(,˜)=0, ρ2(,˜)=1,
    ρ3(,˜)=0, ρ4(,˜)=0,
    ρ5(,˜)=0, ρ6(,˜)=1,
    ρ7(,˜)=0, ρ8(,˜)=1,
    ρ9(,˜)=1, ρ10(,˜)=0
    ρa(,˜)=0.2, ρb(,˜)=0.6667
    Example 2.4 ρ6(,˜)=ρ7(,˜)=1. If =˜,
    ρ6(,˜)=ρ7(,˜)=00=
    ρa(,˜)=0.976, ρb(,˜)=0.99
    Example 2.5 ρ8(,˜)=00×0= ρa(,˜)=0.9806,
    ρb(,˜)=0.9919
    Example 2.6 ρ9(,˜)=00×0= ρa(,˜)=0.9333,
    ρb(,˜)=0.9722
    Example 2.7 ρ10(,˜)=1.0399,
    ρ11(,˜)=1.0272,
    ρ12(,˜)=1.0266
    ρa(,˜)=0.9986,
    ρb(,˜)=0.9990

     | Show Table
    DownLoad: CSV

    Next, we discuss the effectiveness of the new IFCMs as compare to the existing IFCMs using the information in Table 1 as follows:

    (ⅰ) In Example 2.1, the IFCM ρ1 [28] fails because it gives a perfect positive correlation whereas and ˜ are not identical, which violates A2 of Definition 2.5. On the other hand, the new measures indicate that a strong correlation exists between the IFSs and ˜.

    (ⅱ) In Example 2.2, the IFCMs ρ1, ρ2, ρ5, and ρ9 [28,31,33,35] indicate that a perfect positive correlation exists between and ˜, whereas and ˜ are not identical. This is a violation of A2 of Definition 2.5. In addition, the IFCMs ρ6 [36] and ρ7 [37] provide a value that is not defined within either [0,1] or [1,1], which violates A1 of Definition 2.5. Surprisingly, the IFCM ρ8 [32] shows that no correlation exists between the IFSs, which is a misleading information because there exists an imprecise correlation between the IFSs. The new measures, ρa and ρb give more precise results.

    (ⅲ) In Example 2.3, the IFCMs ρ1, ρ3, ρ4, ρ5, ρ7, and ρ10 [28,30,33,37,38,39] indicate that no correlation exists between the IFSs, which is misleading because a somewhat uncertain correlation exists. In addition, the IFCMs ρ2, ρ8, and ρ9 [31,32,35] indicate that a perfect negative correlation exists between the IFSs, which is not true because a somewhat uncertain correlation exists. Unexpectedly, the IFCM ρ6 [36] indicates that a perfect positive correlation exists between the IFSs, which is again misleading because the IFSs are not identical. On the contrary, the new measures suggest that a positive correlation exists between the IFSs.

    (ⅳ) In Example 2.4, the IFCMs ρ6 [36] and ρ7 [37] show that a perfect positive relationship exists between the IFSs although ˜. In addition, If =˜, we can see that ρ6(,˜)=ρ7(,˜)=00=. These IFCMs violate A1 and A2 of Definition 2.5. On the other hand, the new measures show that a strong positive correlation exists between the IFSs; also, and whenever =˜, they show a perfect positive correlation that is in agreement with the IFCC metric conditions.

    (ⅴ) In Example 2.5, the IFCM ρ8 [32] gives a meaningless correlation value, which is not within either [0,1] or [1,1], i.e., it violates A1 of Definition 2.5. However, the new measures show that a strong positive correlation exists between the IFSs. Similarly, for Example 2.6, the IFCM ρ9 [35] yields an inappropriate result similar to ρ8 [32]. Also, the new measures indicate that a strong positive correlation exists between the IFSs.

    (ⅵ) Finally, in Example 2.7, the IFCM ρ10, ρ11, and ρ12 [30,40,41] give correlation values that are greater than 1, which violate A1 of Definition 2.5. On the contrary, the new measures suggest that a positive correlation exists between the IFSs, which satisfies A1 of Definition 2.5.

    To recap, all of the IFCMs fail to satisfy the IFCM metric conditions, except for the new IFCMs. In addition, the new measures yield a more precise result than all of the existing techniques.

    Triage is the medical process used to determine the patients in the ED who are most in need of urgent treatment. This process is carried out by a triage nurse in the ED who assesses the patients' medical conditions and decides whether to call a consultant for the most critical case. For this reason, some patients who arrive at the ED late might receive medical attention first. Often, in a medical facility, some patients urgently require medical attention to address their debilitating medical conditions. However, the inability to control diagnostic uncertainty may result in misdiagnosis or delayed conditions and/or postponed or unnecessary tests and/or treatments. Owing to the inherent uncertainty in medical diagnoses, it is necessary to deploy an intuitionistic fuzzy approach to eliminate diagnostic imprecision and uncertainty. To achieve a reliable diagnosis, we propose employing a knowledge-based diagnostic process that captures the linguistic variables of patients' symptoms through the use of intuitionistic fuzzy numbers (IFNs), which are presented in Table 2.

    Table 2.  Linguistic variables for symptoms evaluation.
    Linguistic variables IFNs
    Extremely high (EH) (1,0)
    Very very high (VVH) (0.9,0.05)
    Very high (VH) (0.8,0.15)
    High (H) (0.7,0.2)
    Medium high (MH) (0.6,0.25)
    Medium (M) (0.5,0.4)
    Medium low (ML) (0.4,0.5)
    Low (L) (0.3,0.65)
    Very low (VL) (0.2,0.75)
    Very very low (VVL) (0.05,0.9)
    Extremely low (EL) (0,1)

     | Show Table
    DownLoad: CSV

    The symptoms for this type of ME case are represented by a set:

    ˘S={˘S1,˘S2,˘S3,˘S4,˘S5,˘S6,˘S7},

    where ˘S1 is body temperature, ˘S2 is pulse, ˘S3 is prostration, ˘S4 is dehydration, ˘S5 is blood pressure, ˘S6 is dyspnea, and ˘S7 is paleness.

    Suppose that six patients represented by a set ˘P={˘P1,˘P2,˘P3,˘P4,˘P5,˘P6}, are brought to ED for treatment. However, due to the limited number of consultants, all patients cannot receive medical attention at the same time, so, it is expedient to attend to the patient with the most serious medical case to avoid fatality. Three triage nurses attend to the patients to determine which of the patients' cases is most in need of emergency medical attention. The opinions of the triage nurses are presented in terms of linguistic variables in Tables 35, respectively.

    Table 3.  Linguistic variables for triage nurse Ⅰ.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˘P1 M H VH VL MH VH H
    ˘P2 VVL M VH MH MH M VL
    ˘P3 ML H VH VVH ML H ML
    ˘P4 VL H M ML MH VVH H
    ˘P5 L MH VH M VL H VH
    ˘P6 M L MH VH VVH H ML

     | Show Table
    DownLoad: CSV
    Table 4.  Linguistic variables for triage nurse Ⅱ.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˘P1 M H M VVH VVH VL VVL
    ˘P2 ML VH H H L MH MH
    ˘P3 L VH VVH MH ML VH H
    ˘P4 VL M L M VL ML H
    ˘P5 VVL VH H L MH M VH
    ˘P6 M M ML MH VVH MH H

     | Show Table
    DownLoad: CSV
    Table 5.  Linguistic variables for triage nurse Ⅲ.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˘P1 ML L VH VVH H VL H
    ˘P2 L MH L H VVL M VH
    ˘P3 M H VVH L M MH VVH
    ˘P4 VL VH H MH H VH M
    ˘P5 M VVH VVL H VH H VL
    ˘P6 VVL H H L M VH MH

     | Show Table
    DownLoad: CSV

    Using the information in Table 2, we obtained the results presented in Tables 68 from Tables 35, respectively.

    Table 6.  IFNs for triage nurse Ⅰ.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˘P1 (0.5,0.4) (0.7,0.2) (0.8,0.15) (0.2,0.75) (0.6,0.25) (0.8,0.15) (0.7,0.2)
    ˘P2 (0.05,0.9) (0.5,0.4) (0.8,0.15) (0.6,0.25) (0.6,0.25) (0.5,0.4) (0.2,0.75)
    ˘P3 (0.4,0.5) (0.7,0.2) (0.8,0.15) (0.9,0.05) (0.4,0.6) (0.7,0.2) (0.4,0.5)
    ˘P4 (0.2,0.75) (0.7,0.2) (0.5,0.4) (0.4,0.5) (0.6,0.25) (0.9,0.05) (0.7,0.2)
    ˘P5 (0.3,0.65) (0.6,0.25) (0.8,0.15) (0.5,0.4) (0.2,0.75) (0.7,0.2) (0.8,0.15)
    ˘P6 (0.5,0.4) (0.3,0.65) (0.6,0.25) (0.8,0.15) (0.9,0.05) (0.7,0.2) (0.4,0.5)

     | Show Table
    DownLoad: CSV
    Table 7.  IFNs for triage nurse Ⅱ.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˘P1 (0.5,0.4) (0.7,0.2) (0.5,0.4) (0.9,0.05) (0.9,0.05) (0.2,0.75) (0.05,0.9)
    ˘P2 (0.4,0.5) (0.8,0.15) (0.7,0.2) (0.7,0.2) (0.3,0.65) (0.6,0.25) (0.6,0.25)
    ˘P3 (0.3,0.65) (0.8,0.15) (0.8,0.15) (0.6,0.25) (0.4,0.5) (0.8,0.15) (0.7,0.2)
    ˘P4 (0.2,0.75) (0.5,0.4) (0.3,0.65) (0.5,0.4) (0.2,0.75) (0.4,0.5) (0.7,0.2)
    ˘P5 (0.05,0.9) (0.8,0.15) (0.7,0.2) (0.3,0.65) (0.6,0.25) (0.5,0.4) (0.8,0.15)
    ˘P6 (0.5,0.4) (0.5,0.4) (0.4,0.5) (0.6,0.25) (0.9,0.05) (0.6,0.25) (0.7,0.2)

     | Show Table
    DownLoad: CSV
    Table 8.  IFNs for triage nurse Ⅲ.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˘P1 (0.4,0.5) (0.3,0.65) (0.8,0.15) (0.9,0.05) (0.7,0.2) (0.2,0.75) (0.7,0.2)
    ˘P2 (0.3,0.65) (0.6,0.25) (0.3,0.25) (0.7,0.2) (0.05,0.9) (0.5,0.4) (0.8,0.15)
    ˘P3 (0.5,0.4) (0.7,0.2) (0.9,0.05) (0.3,0.65) (0.5,0.4) (0.6,0.25) (0.9,0.05)
    ˘P4 (0.2,0.75) (0.8,0.15) (0.7,0.2) (0.6,0.25) (0.7,0.2) (0.8,0.15) (0.5,0.4)
    ˘P5 (0.5,0.4) (0.9,0.05) (0.05,0.9) (0.7,0.2) (0.8,0.15) (0.7,0.2) (0.2,0.75)
    ˘P6 (0.05,0.9) (0.7,0.2) (0.7,0.2) (0.3,0.65) (0.5,0.4) (0.8,0.15) (0.6,0.25)

     | Show Table
    DownLoad: CSV

    By using Definition 2.4, we combined the opinions of the three triage nurses as presented in Table 9.

    Table 9.  Medical information.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˘P1 (715,1330) (1730,720) (710,730) (23,1760) (1115,16) (25,1120) (2960,1330)
    ˘P2 (14,4160) (1930,415) (35,13) (23,1360) (1960,35) (815,720) (815,2360)
    ˘P3 (25,3160) (1115,1160) (56,760) (35,1960) (1330,12) (710,15) (115,14)
    ˘P4 (15,34) (23,14) (12,512) (12,2360) (12,25) (710,730) (1930,415)
    ˘P5 (1760,3960) (2330,320) (3160,512) (12,512) (815,2360) (1930,2075) (35,2160)
    ˘P6 (720,1730) (12,512) (1730,1960) (1730,720) (2330,16) (710,15) (1730,1960)

     | Show Table
    DownLoad: CSV

    Summaries of the triage and data collection processes are as follows: (ⅰ) three triage nurses provide the linguistic variables as seen in Tables 35; (ⅱ) the linguistic variables are converted to IFNs (as shown in Tables 68) based on the information in Table 2; and (ⅲ) the IFNs from the linguistic variables are compressed into one by taking the arithmetic average of the IFNs (as shown in Table 9).

    The linguistic variables of a healthy person as determined based on expert knowledge are MH, MH, EL, EL, M, EL, and EL for body temperature, pulse, prostration, dehydration, blood pressure, dyspnea, and paleness, respectively. Assuming that a healthy person is represented by an IFS, denoted as ˘H, the medical information for ˘H is taken as follows:

    ˘H={˘S1,0.6,0.25,˘S2,0.6,0.25,˘S3,0,1,˘S4,0,1,˘S5,0.5,0.4,˘S6,0,1,˘S7,0,1}.

    An innovative method has been developed for the triage process to determine the most urgent case among the six sick patients described in Table 9.

    Target

    Choose the most critically ill patient to optimize emergency treatment.

    Algorithm for approach Ⅰ

    The triage process algorithm that chooses the most critically sick patient is as follows:

    Step 1: Compute ρ(˘Pj,˘H) for j=1,2,,7 by using the measures given by (2.1, 2.3, 2.6, 2.8, 2.10, 2.13, 2.15, 2.17, 2.20, 2.22, 2.25, 2.28, 3.1, 3.3), where ˘H is the medical information of a healthy person.

    Step 2: Find

    ρ(˘Pj,˘H)=max1j7{ρ(˘Pj,˘H)}. (4.1)

    Step 3: Compute the degree of confidence (DoC), defined by

    =7j|ρ(˘Pj,˘H)ρ(˘Pj,˘H)|, (4.2)

    where a small value of shows precision and reliability.

    Step 4: The value of min{ρ(˘Pj,˘H)} determines the most critically ill patient for emergency treatment.

    Now, we implement Step 1 to compute the correlation coefficients between each patient and the healthy person to determine which of the patients has the weakest correlation with the healthy person by using the new approaches. We obtained the following results from the computations:

    ρa(˘P1,˘H)=0.9820,ρa(˘P2,˘H)=0.9790,ρa(˘P3,˘H)=0.9736,ρa(˘P4,˘H)=0.9789,ρa(˘P5,˘H)=0.9814,ρa(˘P6,˘H)=0.9781,ρb(˘P1,˘H)=0.9875,ρb(˘P2,˘H)=0.9854,ρb(˘P3,˘H)=0.9817,ρb(˘P4,˘H)=0.9853,ρb(˘P5,˘H)=0.9871,ρb(˘P6,˘H)=0.9848.

    By applying Steps 2 and 3, the DoCs of the correlation coefficients were calculated to be 0.019 and 0.0132, respectively. The ordering of the correlation coefficients is as follows:

    ρa(˘P1,˘H)ρa(˘P5,˘H)ρa(˘P2,˘H)ρa(˘P4,˘H)ρa(˘P6,˘H)ρa(˘P3,˘H),ρb(˘P1,˘H)ρb(˘P5,˘H)ρb(˘P2,˘H)ρb(˘P4,˘H)ρb(˘P6,˘H)ρb(˘P3,˘H).

    The order shows that, ˘P3 has the weakest correlation with ˘H, which means that the patient with the most critical health challenge is ˘P3. In a situation in which there is only one medical consultant, ˘P3 should be given treatment priority.

    To demonstrate the superiority of the new IFCMs over the existing IFCMs, we present a comparative study. The results of the comparison are listed in Table 10.

    Table 10.  Results of comparative for approach Ⅰ.
    Measures (˘P1,˘H) (˘P2,˘H) (˘P3,˘H) (˘P4,˘H) (˘P5,˘H) (˘P6,˘H)
    ρ1 [28] 0.6535 0.5915 0.4926 0.5905 0.6422 0.5738
    ρ2 [31] 0.1028 0.5747 0.5650 0.4324 0.1207 0.3933
    ρ3 [39] 0.6548 0.5910 0.4943 0.5898 0.6422 0.5730
    ρ4 [38] 1.2093 1.0773 0.9489 1.0893 1.1851 1.0506
    ρ5 [33] 0.3196 0.4856 0.3649 0.4335 0.0634 0.4822
    ρ6 [36] 1.3522 1.2994 1.3572 1.3542 1.3114 1.2775
    ρ7 [37] 1.3288 1.2832 1.3056 1.3250 1.2853 1.2489
    ρ8 [32] 0.1034 0.5749 0.5655 0.4334 0.1206 0.3955
    ρ9 [35] 0.1089 0.5725 0.5614 0.4330 0.1195 0.3972
    ρ10 [30] 0.7612 0.6890 0.7437 0.7353 0.7137 0.6656
    ρ11 [40] 0.8268 0.7719 0.8096 0.8028 0.7907 0.7531
    ρ12 [41] 0.8432 0.7898 0.8271 0.8194 0.8077 0.7763
    ρa 0.9820 0.9790 0.9736 0.9789 0.9814 0.9781
    ρb 0.9875 0.9854 0.9817 0.9853 0.9871 0.9848

     | Show Table
    DownLoad: CSV

    From Table 10, we see that the IFCMs in [36,37,38] are not appropriate because their results do not fall within [0,1] or [1,1]. Notably, our IFCMs yielded the most robust results. The ordering and DoC results for the measures listed in Table 10 are presented in Table 11.

    Table 11.  Order and DoC results for the measures.
    Measures Orderings Triage DoCs
    ρ1 [28] ρ1(˘P1,˘H)ρ1(˘P5,˘H)ρ1(˘P2,˘H)ρ1(˘P4,˘H)ρ1(˘P6,˘H)ρ1(˘P3,˘H) ˘P3 0.3769
    ρ2 [31] ρ2(˘P1,˘H)ρ2(˘P5,˘H)ρ2(˘P6,˘H)ρ2(˘P4,˘H)ρ2(˘P3,˘H)ρ2(˘P2,˘H) ˘P2 2.5501
    ρ3 [39] ρ3(˘P1,˘H)ρ3(˘P5,˘H)ρ3(˘P2,˘H)ρ3(˘P4,˘H)ρ3(˘P6,˘H)ρ3(˘P3,˘H) ˘P3 0.3837
    ρ4 [38] fails A1 N/A N/A
    ρ5 [33] ρ5(˘P1,˘H)ρ5(˘P5,˘H)ρ5(˘P3,˘H)ρ5(˘P4,˘H)ρ5(˘P6,˘H)ρ5(˘P2,˘H) ˘P2 3.4276
    ρ6 [36] fails A1 N/A N/A
    ρ7 [37] fails A1 N/A N/A
    ρ8 [32] ρ8(˘P1,˘H)ρ8(˘P5,˘H)ρ8(˘P6,˘H)ρ8(˘P4,˘H)ρ8(˘P3,˘H)ρ8(˘P2,˘H) ˘P2 2.6069
    ρ9 [35] ρ9(˘P1,˘H)ρ9(˘P5,˘H)ρ9(˘P6,˘H)ρ9(˘P4,˘H)ρ9(˘P3,˘H)ρ9(˘P2,˘H) ˘P2 2.6281
    ρ10 [30] ρ10(˘P1,˘H)ρ10(˘P3,˘H)ρ10(˘P4,˘H)ρ10(˘P5,˘H)ρ10(˘P2,˘H)ρ10(˘P6,˘H) ˘P6 0.2587
    ρ11 [40] ρ11(˘P1,˘H)ρ11(˘P3,˘H)ρ11(˘P4,˘H)ρ11(˘P5,˘H)ρ11(˘P2,˘H)ρ11(˘P6,˘H) ˘P6 0.2059
    ρ12 [41] ρ12(˘P1,˘H)ρ12(˘P3,˘H)ρ12(˘P4,˘H)ρ12(˘P5,˘H)ρ12(˘P2,˘H)ρ12(˘P6,˘H) ˘P6 0.1957
    ρa ρa(˘P1,˘H)ρa(˘P5,˘H)ρa(˘P2,˘H)ρa(˘P4,˘H)ρa(˘P6,˘H)ρa(˘P3,˘H) ˘P3 0.019
    ρb ρb(˘P1,˘H)ρb(˘P5,˘H)ρb(˘P2,˘H)ρb(˘P4,˘H)ρb(˘P6,˘H)ρb(˘P3,˘H) ˘P3 0.0132

     | Show Table
    DownLoad: CSV

    From the results in Table 11, it is evident that patients ˘P3 and ˘P6 have the weakest correlation with the healthy person. Thus, patients who needed the most urgent medical attention are ˘P3 and ˘P6. Although the measures in [30,31,32,33,35,40,41] yield conflicting interpretations, their interpretations cannot be trusted because they were found to be unrealistic, as shown in Table 1. We have used the information in Table 11 to plot the DoC graph as shown in Figure 1.

    Figure 1.  DoC results.

    From Figure 1, we see that the new IFCMs have the lowest DoC. This shows the reliability of the newly developed IFCMs.

    Here, we apply the multiple criteria decision-making (MCDM) approach to the triage process because the MCDM is more reputable than the approach in Subsection 4.1.

    Algorithm for Approach Ⅱ

    Step 1: Frame the intuitionistic fuzzy decision matrix (IFDM) ˜˘Pj={˘Si(˘Pj)}(n×q), where i=1,2,,n, j=1,2,,q and ˘Pj and ˘Sj represent the patients and symptoms, respectively.

    Step 2: Determine the cost criterion (CC) (i.e., the lowest ˘Si) and the benefit criteria (BC) (i.e., the non-lowest ˘Si).

    Step 3: Normalize the IFDM to get the normalized IFDM denoted by ˜˘P=δ˜˘Pj(˘Si),κ˜˘Pj(˘Si)n×q, where δ˜˘Pj(˘Si),κ˜˘Pj(˘Si) are IFNs, and ˜˘Pj is defined as follows:

    ˜˘Pj={δ˜˘Pj(˘Si),κ˜˘Pj(˘Si)for BC of˘Pj;κ˜˘Pj(˘Si),δ˜˘Pj(˘Si)for CC of˘Pj. (4.3)

    Step 4: Compute the positive ideal solution (PIS) and negative ideal solution (NIS) as follows:

    ˜˘P+={˜˘P+1,˜˘P+2,,˜˘P+q},˜˘P={˜˘P1,˜˘P2,,˜˘Pq}, (4.4)

    where

    ˜˘P+={max{δ˜˘Pj(˘Si)},min{κ˜˘Pj(˘Si)},if˘Siis a BC;min{δ˜˘Pj(˘Si)},max{κ˜˘Pj(˘Si)},if˘Siis a CC, (4.5)
    ˜˘P={min{δ˜˘Pj(˘Si)},max{κ˜˘Pj(˘Si)},if˘Siis a BC;max{δ˜˘Pj(˘Si)},min{κ˜˘Pj(˘Si)},if˘Siis a CC. (4.6)

    Step 5: Obtain the correlation coefficients ρ(˘Pj,˜˘P) and ρ(˘Pj,˜˘P+) based on the IFCMs.

    Step 6: Determine the closeness coefficients, Δj(˘Pj) by using (4.7):

    Δj(˘Pj)=ρ(˘Pj,˜˘P+)ρ(˘Pj,˜˘P+)+ρ(˘Pj,˜˘P), (4.7)

    for j=1,,n. For the case of correlation values defined in [1,1], we first compute

    Δ+j(˘Pj)=ρ(˘Pj,˜˘P+)ρmin(˘Pj,˜˘P+)ρmax(˘Pj,˜˘P+)ρmin(˘Pj,˜˘P+), (4.8)
    Δj(˘Pj)=ρ(˘Pj,˜˘P)ρmin(˘Pj,˜˘P)ρmax(˘Pj,˜˘P)ρmin(˘Pj,˜˘P), (4.9)

    before calculating the closeness coefficients, Δj(˘Pj) as follows:

    Δj(˘Pj)=Δ+j(˘Pj)Δ+j(˘Pj)+Δj(˘Pj). (4.10)

    Step 7: Choose the largest closeness coefficient for the triage process.

    Following the algorithm (i.e., Steps 1 and 2), the IFDM is obtained as presented in Table 9, and the CC is ˘S1. By Step 3, the normalized IFDM values are obtained as presented in Table 12.

    Table 12.  Normalized IFDM.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˘P1 (1330,715) (1730,720) (710,730) (23,1760) (1115,16) (25,1120) (2960,1330)
    ˘P2 (4160,14) (1930,415) (35,13) (23,1360) (1960,35) (815,720) (815,2360)
    ˘P3 (3160,25) (1115,1160) (56,760) (35,1960) (1330,12) (710,15) (115,14)
    ˘P4 (34,15) (23,14) (12,512) (12,2360) (12,25) (710,730) (1930,415)
    ˘P5 (3960,1760) (2330,320) (3160,512) (12,512) (815,2360) (1930,2075) (35,2160)
    ˘P6 (1730,720) (12,512) (1730,1960) (1730,720) (2330,16) (710,15) (1730,1960)

     | Show Table
    DownLoad: CSV

    By following Step 4, we get Table 13.

    Table 13.  ˜˘P+ and ˜˘P results.
    Patients ˘S1 ˘S2 ˘S3 ˘S4 ˘S5 ˘S6 ˘S7
    ˜˘P+ (1330,715) (2330,320) (56,760) (23,1360) (2330,16) (710,15) (115,14)
    ˜˘P (34,15) (12,512) (12,512) (12,512) (1960,35) (25,1120) (2960,1330)

     | Show Table
    DownLoad: CSV

    Now, we use Step 5 and get the following results:

    ρa(˜˘P+,˘P1)=0.9977,ρa(˜˘P+,˘P2)=0.9960,ρa(˜˘P+,˘P3)=0.9986,ρa(˜˘P+,˘P4)=0.9969,ρa(˜˘P+,˘P5)=0.9975,ρa(˜˘P+,˘P6)=0.9982,ρa(˜˘P,˘P1)=0.9964,ρa(˜˘P,˘P2)=0.9961,ρa(˜˘P,˘P3)=0.9951,ρa(˜˘P,˘P4)=0.9944,ρa(˜˘P,˘P5)=0.9953,ρa(˜˘P,˘P6)=0.9946.
    ρb(˜˘P+,˘P1)=0.9984,ρb(˜˘P+,˘P2)=0.9973,ρb(˜˘P+,˘P3)=0.9990,ρb(˜˘P+,˘P4)=0.9978,ρb(˜˘P+,˘P5)=0.9982,ρb(˜˘P+,˘P6)=0.9987,ρb(˜˘P,˘P1)=0.9975,ρb(˜˘P,˘P2)=0.9973,ρb(˜˘P,˘P3)=0.9966,ρb(˜˘P,˘P4)=0.9961,ρb(˜˘P,˘P5)=0.9968,ρb(˜˘P,˘P6)=0.9962.

    Next, we compute Δj for ρa and ρb; the results are listed in Table 14.

    Table 14.  Closeness coefficients, Δj(˘Pj) for j=1,2,,6.
    Iterations Δj(˘Pj) for ρa Ranking for ρa Δj(˘Pj) for ρb Ranking for ρb
    1 0.50032 5 0.50022 5
    2 0.49998 6 0.49999 6
    3 0.50088 2 0.50061 2
    4 0.50062 3 0.50043 3
    5 0.50054 4 0.50037 4
    6 0.50090 1 0.50062 1

     | Show Table
    DownLoad: CSV

    From the results in Table 14, we can state that patients ˘P6 and ˘P3 should be given urgent medical attention to avoid death if there is a limited number of consultants.

    Next, we show the superiority of the new IFCMs via comparative analysis. By following Step 5 of the MCDM algorithm, we get the information in Table 15, which is illustrated in Figure 2.

    Table 15.  Results for ρ(˜˘P+,˘Pj), j=1,2,,6.
    Measures (˜˘P+,˘P1) (˜˘P+,˘P2) (˜˘P+,˘P3) (˜˘P+,˘P4) (˜˘P+,˘P5) (˜˘P+,˘P6)
    ρ1 [28] 0.9471 0.9066 0.9681 0.9277 0.9416 0.9594
    ρ2 [31] 0.5013 0.6032 0.6573 0.7250 0.7239 0.6689
    ρ3 [39] 0.9468 0.9077 0.9684 0.9279 0.9419 0.9590
    ρ4 [38] 1.7486 1.6545 1.8593 1.7137 1.7383 1.7584
    ρ5 [33] 0.2181 0.6153 0.7110 0.4789 0.5854 0.3528
    ρ6 [36] 1.5012 1.4672 1.7428 1.4008 1.4187 1.4974
    ρ7 [37] 1.5280 1.4697 1.7485 1.4146 1.4060 1.5348
    ρ8 [32] 0.5087 0.6002 0.6570 0.7262 0.7238 0.6731
    ρ9 [35] 0.5023 0.6002 0.6572 0.7215 0.7212 0.6668
    ρ10 [30] 0.9458 0.9237 1.0399 0.8982 0.9139 0.9460
    ρ11 [40] 0.9608 0.9465 1.0272 0.9272 0.9379 0.9621
    ρ12 [41] 0.9629 0.9488 1.0266 0.9446 0.9441 0.9661
    ρa 0.9977 0.9960 0.9986 0.9969 0.9975 0.9982
    ρb 0.9984 0.9973 0.9990 0.9978 0.9982 0.9987

     | Show Table
    DownLoad: CSV
    Figure 2.  Illustration of the results presented in Table 15.

    Similarly, we can obtain the results presented in Table 16, which are illustrated in Figure 3.

    Table 16.  Results for ρ(˜˘P,˘Pj), j=1,2,,6.
    Measures (˜˘P,˘P1) (˜˘P,˘P2) (˜˘P,˘P3) (˜˘P,˘P4) (˜˘P,˘P5) (˜˘P,˘P6)
    ρ1 [28] 0.9055 0.8964 0.8769 0.8518 0.8768 0.8557
    ρ2 [31] 0.2972 0.2501 0.2177 0.7211 0.6205 0.9690
    ρ3 [39] 0.9060 0.8970 0.8777 0.8536 0.8777 0.8570
    ρ4 [38] 1.6352 1.6190 1.5840 1.5406 1.5841 1.5467
    ρ5 [33] 0.1851 0.1799 0.3329 0.2028 0.5144 0.6315
    ρ6 [36] 1.5473 1.5726 1.2443 1.5423 1.5017 1.4681
    ρ7 [37] 1.5649 1.5786 1.3483 1.5521 1.5342 1.4598
    ρ8 [32] 0.2993 0.2504 0.2170 0.7265 0.6210 0.9732
    ρ9 [35] 0.2976 0.2496 0.2181 0.7202 0.6199 0.9687
    ρ10 [30] 0.9591 0.9881 0.8160 0.9652 0.9301 0.9043
    ρ11 [40] 0.9710 0.9901 0.8745 0.9752 0.9517 0.9312
    ρ12 [41] 0.9702 0.9920 0.8828 0.9775 0.9544 0.9360
    ρa 0.9964 0.9961 0.9951 0.9944 0.9953 0.9946
    ρb 0.9975 0.9973 0.9966 0.9961 0.9968 0.9962

     | Show Table
    DownLoad: CSV
    Figure 3.  Illustration of the results presented in Table 16.

    Comparison of the results in Tables 15 and 16 reveals that the new IFCMs yield the most precise results, and that ρ4, ρ6, ρ7, ρ10, ρ11, and ρ12 give results that are not defined within the scope of correlation coefficient values.

    Next, we computed the closeness coefficients for the correlation coefficients. Because ρ4 [38], ρ6 [36], ρ7 [37], ρ10 [30], ρ11 [40], and ρ12 [41] in Tables 15 and 16 yielded correlation values that were not within [0,1] and [1,1], we excluded them from the computations of the closeness coefficients.

    Using the information in Tables 15 and 16, we obtained the closeness coefficients as shown in Table 17, as well as and their ordering, as shown in Table 18.

    Table 17.  Closeness coefficients.
    Measures Δ1(˘P1) Δ2(˘P2) Δ3(˘P3) Δ4(˘P4) Δ5(˘P5) Δ6(˘P6)
    ρ1 [28] 0.51125 0.50282 0.52474 0.52133 0.51781 0.52858
    ρ2 [31] 0.0000 0.32246 0.41092 0.75189 0.68210 1.0000
    ρ3 [39] 0.51100 0.50294 0.52458 0.52085 0.51764 0.52808
    ρ5 [33] 0.0000 0.44625 0.60194 0.35789 0.74190 1.0000
    ρ8 [32] 0.0000 0.30555 0.40538 0.75400 0.67979 1.0000
    ρ9 [35] 0.0000 0.31781 0.41394 0.75125 0.68238 1.0000
    ρa 0.50032 0.49998 0.50088 0.50062 0.50054 0.50090
    ρb 0.50022 0.49999 0.50061 0.50043 0.50037 0.50062

     | Show Table
    DownLoad: CSV
    Table 18.  Closeness coefficient ordering results.
    Measures Orderings
    ρ1 [28] Δ6(˘P6)Δ3(˘P3)Δ4(˘P4)Δ5(˘P5)Δ1(˘P1)Δ2(˘P2)
    ρ2 [31] Δ6(˘P6)Δ4(˘P4)Δ5(˘P5)Δ3(˘P3)Δ2(˘P2)Δ1(˘P1)
    ρ3 [39] Δ6(˘P6)Δ3(˘P3)Δ4(˘P4)Δ5(˘P5)Δ2(˘P2)Δ1(˘P1)
    ρ5 [33] Δ6(˘P6)Δ5(˘P5)Δ3(˘P3)Δ2(˘P2)Δ4(˘P4)Δ1(˘P1)
    ρ8 [32] Δ6(˘P6)Δ4(˘P4)Δ5(˘P5)Δ3(˘P3)Δ2(˘P2)Δ1(˘P1)
    ρ9 [35] Δ6(˘P6)Δ4(˘P4)Δ5(˘P5)Δ3(˘P3)Δ2(˘P2)Δ1(˘P1)
    ρa Δ6(˘P6)Δ3(˘P3)Δ4(˘P4)Δ5(˘P5)Δ1(˘P1)Δ2(˘P2)
    ρb Δ6(˘P6)Δ3(˘P3)Δ4(˘P4)Δ5(˘P5)Δ1(˘P1)Δ2(˘P2)

     | Show Table
    DownLoad: CSV

    From Table 18, we infer that patient ˘P6 had the most critical medical case that required urgent medical attention. Because the new measures have been shown to be the most reliable IFCMs, it is necessary to state that the patients should be queued as in the following order: ˘P6, ˘P3, ˘P4, ˘P5, ˘P1, and ˘P2, respectively, for emergency treatment.

    Uncertainty in medical diagnoses is a fundamental problem that is faced by triage nurses and physicians. In this study, a novel approach was developed for the triage process, and it involves the use of new IFCMs via Spearman's correlation coefficient approach to eliminate all possible uncertainties that may prevent the user from obtaining reliable triage results. To justify the establishment of new IFCMs, various existing IFCMs were investigated and their shortcomings were identified. Furthermore, all of the extant IFCMs were established based on the classical Pearson correlation coefficient approach, and none were constructed by using the Spearman's correlation coefficient. Because of this oversight, new IFCMs were constructed based on the classical Spearman's correlation coefficient, and we have shown how the new measures overcame all of the limitations of the extant measures. To verify the validity of the new measures, some theoretical results were proved, which were found to satisfy the conditions of the correlation coefficient. Because of the ease of use of the developed IFCMs, we applied them to solve the problem of triage processes in a typical ED to eliminate medical diagnostic uncertainty. The data for the analysis were obtained via a knowledge-based system, where the symptoms of the considered ailments were apportioned linguistic variables with corresponding IFNs. To unequivocally show the merits of the new correlation coefficient models, we compared the new IFCC methods with 12 extant IFCC methods [28,30,31,32,33,35,36,37,38,39,40,41]. It was observed that the new IFCC methods are the most reliable, consistent and precise, and that sufficiently satisfy the conditions of the correlation coefficient. This new triage process based on IFCMs can conveniently manage all of the uncertainties associated with an ME. However, the developed IFCMs could only function in an environment in which the sum of the MD and NMD is at most one. The novel IFCMs are restricted, because they cannot be directly applied to other settings with higher fuzziness like the Pythagorean fuzzy setting [53], Fermatean fuzzy setting [54], q-rung orthopair fuzzy setting [55], complemental fuzzy setting [56], etc. without alterations since the new measures were not developed to consider the properties of the aforementioned settings. The new IFCMs and the novel application should be investigated in other fuzzy environments for further research.

    P. A. Ejegwa: conceptualization, methodology, software, and writing – original draft; N. Kausar: writing – review & editing, supervision, funding acquisition, and validation; J. A. Agba: data curation, visualization, and writing – review & editing; F. Ugwuh: resources, writing – review & editing, and validation; E. Özbilge: funding acquisition, supervision, and visualization; E. Ozbilge: supervision, visualization, writing – review & editing, and funding acquisition.

    The authors declare they do not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors declare that they have no competing interests.



    [1] L. Lim, Singular values and eigenvalues of tensors: a variational approach, In: Computational Advances in Multi-Sensor Adaptive Processing, 2005, 8912515. https://doi.org/10.1109/CAMAP.2005.1574201
    [2] L. Qi, Eigenvalues of a real supersymmetric tensor, J. Symb. Comput., 40 (2005), 1302–1324. https://doi.org/10.1016/j.jsc.2005.05.007 doi: 10.1016/j.jsc.2005.05.007
    [3] M. Cao, Q. Huang, Y. Yang, A self-adaptive trust region method for extreme B-eigenvalues of symmetric tensors, Numer. Algor., 81 (2019), 407–420. https://doi.org/10.1007/s11075-018-0554-7 doi: 10.1007/s11075-018-0554-7
    [4] C. Hao, C. Cui, Y. Dai, A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors, Numer. Linear Algebra Appl., 22 (2015), 283–298. https://doi.org/10.1002/nla.1949 doi: 10.1002/nla.1949
    [5] S. Aji, P. Kumam, A. Awwal, M. M. Yahaya, K. Sitthithakerngkiet, An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery, AIMS Math., 6 (2021), 8078–8106. http://dx.doi.org/10.3934/math.2021469 doi: 10.3934/math.2021469
    [6] T. Kolda, J. Mayo, Shifted power method for computing tensor eigenpairs, SIAM J. Matrix Anal. Appl., 32 (2011), 1095–1124. https://doi.org/10.1137/100801482 doi: 10.1137/100801482
    [7] T. Kolda, J. Mayo, An adaptive shifted power methods for computing generalized tensor eigenpairs, SIAM J. Matrix Anal. Appl., 35 (2014), 1563–1581. https://doi.org/10.1137/140951758 doi: 10.1137/140951758
    [8] Y. Chen, M. Cao, Y. Yang, Q. Huang, An adaptive trust-region method for generalized eigenvalues of symmetric tensors, J. Comput. Math., 39 (2021), 533–549.
    [9] G. Li, L. Qi, G. Yu, Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application, Linear Algebra Appl., 438 (2013), 813–833. https://doi.org/10.1016/j.laa.2011.10.043 doi: 10.1016/j.laa.2011.10.043
    [10] M. Cao, Y. Yang, T. Hou, C. Li, A nonmonotone accelerated Levenberg-Marquardt method for the B-eigenvalues of symmetric tensors, Inter. Trans. Oper. Res., 29 (2022), 113–129. https://doi.org/10.1111/itor.12954 doi: 10.1111/itor.12954
    [11] M. Ng, L. Qi, G. Zhou, Finding the largest eigenvalue of a nonnegative tensor, SIAM J. Matrix Anal. Appl., 31 (2009), 1090–1099. https://doi.org/10.1137/09074838X doi: 10.1137/09074838X
    [12] J. Bai, W. Hager, H. Zhang, An inexact accelerated stochastic ADMM for separable composite convex optimization, Comput. Optim. Appl., 81 (2022), 479–518. https://doi.org/10.1007/s10589-021-00338-8 doi: 10.1007/s10589-021-00338-8
    [13] J. Bai, D. Han, H. Sun, H. Zhang, Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes, CSIAM Trans. Appl. Math., 3 (2022), 448–479.
    [14] L. Qi, W. Sun, Y. Wang, Numerical multilinear algebra and its applications, Front. Math. China, 2 (2017), 501–526. https://doi.org/10.1007/s11464-007-0031-4 doi: 10.1007/s11464-007-0031-4
    [15] T. Wei, P. Goldbart, Geometric measure of entanglement and applications to bipartite and multipartite quantum states, Phys. Rev. A, 68 (2003), 042307. https://doi.org/10.1103/PhysRevA.68.042307 doi: 10.1103/PhysRevA.68.042307
    [16] L. Qi, G. Yu, E. Wu, Higher order positive semi-definite diffusion tensor imaging, SIAM J. Imaging Sci., 3 (2010), 416–433. https://doi.org/10.1137/090755138 doi: 10.1137/090755138
    [17] L. Qi, F. Wang, Y. Wang, Z-eigenvalue methods for a global polynomial optimization problem, Math. Program., 118 (2009), 301–316. https://doi.org/10.1007/s10107-007-0193-6 doi: 10.1007/s10107-007-0193-6
    [18] L. Han, An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors, Numer. Algebr. Control Optim., 3 (2013), 583–599.
    [19] C. Hao, C. Cui, Y. Dai, A feasible trust-region method for calculating extreme Z-eigenvalues of symmetric tensors, Pac. J. Optim., 11 (2015), 291–307.
    [20] J. Nocedal, S. J. Wright, Numerical optimization, New York: Springer, 1999.
    [21] Y. Yuan, W. Sun, Optimization theory and methods, Beijing: Science Press, 1997.
    [22] G. Auchmuty, Globally and rapidly convergent algorithm for symmetric eigenproblems, SIAM J. Matrix Anal. Appl., 12 (1991), 690–706. https://doi.org/10.1137/0612053 doi: 10.1137/0612053
    [23] A. Peressini, F. Sullivan, J. Uhl, The mathematics of nonlinear programmming, Berlin: Springer, 1988.
    [24] A. Neculai, A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, Appl. Math. Lett., 20 (2007), 645–650. https://doi.org/10.1016/j.aml.2006.06.015 doi: 10.1016/j.aml.2006.06.015
    [25] A. Neculai, Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, Optim. Meth. Soft., 22 (2007), 561–571. https://doi.org/10.1080/10556780600822260 doi: 10.1080/10556780600822260
    [26] G. Zoutendijk, Nonlinear programming, computational method, Integer Nonlinear Program., 1970, 37–86.
    [27] C. Cui, Y. Dai, J. Nie, All real eigenvalues of symmetric tensors, SIAM J. Matrix Anal. Appl., 4 (2014), 1582–1601. https://doi.org/10.1137/140962292 doi: 10.1137/140962292
    [28] E. Dolan, J. J. Moré, Benchmarking optimization software with performance profiles, Math. Program., 91 (2002), 201–213. https://doi.org/10.1007/s101070100263 doi: 10.1007/s101070100263
    [29] M. Zeng, Q. Ni, Quasi-Newton method for computing Z-eigenvalues of a symmetric tensor, Pac. J. Optim., 2 (2015), 279–290.
    [30] X. Dong, D. Han, Z. Dai, L. Li, J. Zhu, An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition, J. Optim. The. Appl., 179 (2018), 944–961. https://doi.org/10.1007/s10957-018-1377-3 doi: 10.1007/s10957-018-1377-3
    [31] B. Ivanov, G. Milovanovicˊ, P. Stanimirovi\acute{c}, Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring, J. Glob. Optim., 85 (2023), 377–420. https://doi.org/10.1007/s10898-022-01213-4 doi: 10.1007/s10898-022-01213-4
  • This article has been cited by:

    1. Paul Augustine Ejegwa, Manasseh Terna Anum, Nasreen Kausar, Chukwudi Obinna Nwokoro, Nezir Aydin, Hao Yu, New Fermatean Fuzzy Distance Metric and Its Utilization in the Assessment of Security Crises Using the MCDM Technique, 2024, 12, 2227-7390, 3214, 10.3390/math12203214
    2. Paul Augustine Ejegwa, Nasreen Kausar, Nezir Aydin, Yuming Feng, Oludolapo Akanni Olanrewaju, A new Fermatean fuzzy Spearman-like correlation coefficient and its application in evaluating insecurity problem via multi-criteria decision-making approach, 2024, 24058440, e40403, 10.1016/j.heliyon.2024.e40403
    3. Sijia Zhu, Zhe Liu, Sukumar Letchmunan, Gözde Ulutagay, Kifayat Ullah, Novel distance measures on complex picture fuzzy environment: applications in pattern recognition, medical diagnosis and clustering, 2024, 1598-5865, 10.1007/s12190-024-02293-z
    4. Adam Dudáš, Alžbeta Michalíková, Roman Jašek, Fuzzy Masks for Correlation Matrix Pruning, 2025, 13, 2169-3536, 35387, 10.1109/ACCESS.2025.3544027
    5. Mehboob Ali, Wajid Ali, Ishtiaq Hussain, Rasool Shah, Riccardo Ortale, A Novel Correlation Coefficient for Spherical Fuzzy Sets and Its Application in Pattern Recognition, Medical Diagnosis, and Mega Project Selection, 2025, 2025, 0884-8173, 10.1155/int/9164932
  • 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(1599) PDF downloads(76) Cited by(0)

Figures and Tables

Figures(2)  /  Tables(3)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog