Next Article in Journal
Preface to the Special Issue on “Computational and Mathematical Methods in Information Science and Engineering”
Previous Article in Journal
Dynamics and Embedded Solitons of Stochastic Quadratic and Cubic Nonlinear Susceptibilities with Multiplicative White Noise in the Itô Sense
Previous Article in Special Issue
The Relationship between Ordinary and Soft Algebras with an Application
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis and Applications of Artificial Intelligence in Digital Education Based on Complex Fuzzy Clustering Algorithms

1
Department of Mathematics, Faculty of Science, King Abdulaziz University, P.O. Box 80348, Jeddah 22254, Saudi Arabia
2
Department of Mathematics and Statistics, International Islamic University, Islamabad 44000, Pakistan
*
Authors to whom correspondence should be addressed.
Mathematics 2023, 11(14), 3184; https://doi.org/10.3390/math11143184
Submission received: 7 June 2023 / Revised: 12 July 2023 / Accepted: 18 July 2023 / Published: 20 July 2023
(This article belongs to the Special Issue Data Driven Decision-Making Under Uncertainty (D3U), 2nd Edition)

Abstract

:
Digital education is very important and valuable because it is a subpart of artificial intelligence, which is used in many real-life problems. Digital education is the modern utilization of digital techniques and tools during online purchasing, teaching, research, and learning and is often referred to as technology-enhanced learning or e-learning programs. Further, similarity measures (SM) and complex fuzzy (CF) logic are two different ideas that play a very valuable and dominant role in the environment of fuzzy decision theory. In this manuscript, we concentrate on utilizing different types of dice SM (D-SM) and generalized dice SM (GD-SM) in the environment of a CF set (CFS), called CF dice SM (CFD-SM), CF weighted dice SM (CFWD-SM), CF generalized dice SM (CFGD-SM), and CF weighted generalized dice SM (CFWGD-SM), and also derived associated outcomes. Furthermore, to evaluate or state the supremacy and effectiveness of the derived measures, we aim to evaluate the application of artificial intelligence in digital education under the consideration of derived measures for CF information and try to verify them with the help of several examples. Finally, with the help of examples, we illustrate the comparison between the presented and existing measures to show the supremacy and feasibility of the derived measures.

1. Introduction

In recent years, artificial intelligence has emerged as an indispensable tool utilized by a multitude of companies, such as YouTube, Amazon, and Netflix, as well as within search engines, translation companies, online marketing and advertisements, and education. Scholars and businesses are no strangers to using it. In essence, artificial intelligence acts as a substitute for the lengths with which human intelligence can reach and exists to complete the same tasks that humans can. The term “artificial intelligence” concerns technology that can imitate “human” cognitive skills, ranging from “learning” to “problem solving”. Its wide-ranging possibilities have altered the future landscape of education, learning, and teaching as techniques change to incorporate such advanced technology. Artificial intelligence can be utilized to improve aspects of education as well as aid in the future understanding of the brain and cognition.
Clustering analysis, or clustering algorithms, which allow companies to mine invaluable discrete data to pool information on customers, the population, and transactions, amongst other targets, is one of these powerful tools within artificial intelligence. Clustering analysis can also take the form of an evaluative statistical technique. Information is organized into collectives, or clusters, centered on careful associations, which would prove an extraordinarily difficult activity for scholars to arrange such masses of data based on similar attributes.
Much inspection of clustering analysis has utilized classical information, but various problems are yet to be resolved. One major issue involves the loss of masses of information in the process of forming clusters. Addressing this, Zadeh [1] established the main theory of fuzzy sets (FS) in 1965 by altering the function of the classical set and inventing a novel function termed the membership grade, where the derived values fit into the unite interval [0, 1]. Furthermore, Mahmood and Ali [2] modified the theory of FS and derive the theory of fuzzy superior mandelbrot information. Akram et al. [3] merged the theory of FS with N-soft information and originated the novel theory of fuzzy N-soft information. The theory of multi-fuzzy N-soft information emerged from work conducted by Fatimah and Alcantud [4] that combined the multi-fuzzy set theory with the N-soft set theory. Furthermore, a non-iterative reasoning technique under the consideration of fuzzy cognitive function was invented by Al Farsi et al. [5], Karimi et al. [6] examined the perceptual computer for hierarchical portfolio consideration in the presence of type-2 fuzzy information, and Tian et al. [7] evaluated the canonical triangular interval type-2 fuzzy linguistic distribution assessment.
Through the various usages of fuzzy information across multiple fields and scholars, the important question of what occurs when the range of FS is altered requires an answer. Ramot et al. [8] hence manipulated the range of FS and, in using the unit disc in lieu of the unit interval, generated the notion of complex fuzzy set (CFS). CFS possesses only one grade, but the resultant value is in the form of a complex number where real and unreal parts are contained in the unit interval [0, 1]. Further, Liu et al. [9] established methods to ascertain distances and values, which were titled cross-entropy measures based on CFS. Newly created complex fuzzy N-soft sets by Mahmood and Ali [10] fused CFS with N-soft information. Following on from this, the theory of a complex multi-fuzzy set was discovered by A-Qudah and Hassan [11], while Tamir et al. [12] created the theory of similarity measures reliant on complex fuzzy logic and CFSs. Moreover, Ghorbani et al. [13] exposed the semantic interoperability based on type-2 fuzzy sets; Jan et al. [14] evaluated the evaluation of digital systems for complex fuzzy soft information and their applications; Yahya et al. [15] derived the S-box based on image encryption for complex fuzzy frank operators; and Zeeshan et al. [16] evaluated the distance function for complex fuzzy soft information and their application in signals.
Similarity measures (SMs) play an essential role in evaluating the closeness between any two pieces of information, and based on their supremacy and advantages, certain people have utilized them in the environment of different fields. For instance, Lee-Kwang et al. [17] derived SMs for fuzzy information. In addition, Xuecheng [18] evaluated entropy, distance, and SMs for fuzzy information, while Wang [19] proffered two new SMs regarding fuzzy information. Beg and Ashraf [20] identified SMs for FSs; Chen et al. [21] contrasted a multitude of SMs for fuzzy information; Couso et al. [22] assessed the SMs and dis-SMs for fuzzy information; and Zhang and Fu [23] gleaned SMs based on three types of FSs. Moreover, Guo et al. [24] exposed the cosine SMs for CFS and their importance in robustness, whereas Hu et al. [25] conducted work on the theory of distance, similarity, and continuity with regard to complex fuzzy information and its application in digital education. In response to the aforementioned discoveries, it became evident that it was a complex challenge to develop new SMs based on CFS, and thus the core theme of the following analysis should be to discern the various forms of D-SMs [26] and GD-SMs for CFS. Before proposing the derived techniques, we have three major queries:
  • How do we invent new similarity or distance measures based on complex fuzzy logic;
  • How do we evaluate the problem of digital education based on distance or similarity measures for complex fuzzy logic;
  • How do we evaluate the best optimal form of the collection of finite values.
Evaluating or addressing the above queries is a very challenging task for young researchers because the structure of a complex fuzzy set is very complicated and ambiguous. Many scholars have derived the different types of measures based on fuzzy sets, but the dice and generalized dice similarity measures are more formal and valuable for depicting uncertain and unreliable information in genuine life problems. Therefore, the major advantages and disadvantages of the proposed work are stated in Table 1.
In the presence of the above information, it is clear that the proposed measures have many advantages. Moreover, we used the proposed measures and tried to evaluate the problem of digital education in northern areas based on their attributes. Therefore, the aim is to utilize them within the realms of digital education and artificial intelligence. Some important theories presented are listed below:
  • To expose the theories of CFD-SM and CFWD-SM and evaluate their valuable conclusions;
  • To examine the theory of CFGD-SM and CFWGD-SM and discuss the overarching themes;
  • To evaluate the problems of education with the help of artificial intelligence in digital education in the presence of the presented measures;
  • To contrast the proposed discussions with numerical evidence to conclude the superiority and effectiveness of the suggested methods.
The main structure of this analysis is of the form:
  • In Section 2, the concepts of D-SM and CFS and their operational laws will be reviewed;
  • In Section 3, the theories of CFD-SM, CFWD-SM, CFGD-SM, and CFWGD-SM will be introduced;
  • In Section 4, the discussion will tackle the problems of artificial intelligence in digital education, relying on assessed methods for complex fuzzy set theory;
  • In Section 5, the suggested measures will be evaluated using numerical evidence alongside the existing measures;
  • In Section 6, the conclusion will be featured.

2. Preliminaries

The main influence of this section is to revise the existing theory of dice similarity measures for the collection of positive integers, which is used for evaluating the interrelationship between any two positive numbers. Moreover, we stated the idea of fuzzy sets and complex fuzzy information and their operational laws. We also explained all parameters in Table 2.
Definition 1
[19]. For any two vectors  V 1 = x 1 , x 2 , , x n  and  V 2 = y 1 , y 2 , , y n , D-SM is given by
D S M V 1 , V 2 = 2 V 1 · V 2 V 1 2 2 + V 2 2 2 = 2 j = 1 n x j y j j = 1 n x j 2 + j = 1 n y j 2
where  V 1 · V 2 = j = 1 n x j y j  and  V 1 2 2 = j = 1 n x j 2 , V 2 2 2 = j = 1 n y j 2  represent the inner product and Euclidean norm under the consideration of vectors  V 1  and  V 2 . The theory of D-SM is undefined for  x j = y j = 0 .
Further, we also need to recall the basic idea of FS.
Definition 2
[1]. Under the presence of universal set  X , the FS is given by
ξ ξ f = Ξ R x : x X
where the term  Ξ R x  represent the membership function and defined it from universal set  X  to unit-interval [0, 1]. Furthermore, we are also able to write the short form and call it a fuzzy number (FN),  ξ ξ f j = x , Ξ R j , j = 1 , 2 , , n . Furthermore, we discussed some operational laws for complex fuzzy information.
Further, we also need to recall the basic idea of CFS and their valuable laws under the consideration of algebraic information, such as algebraic t-norm and t-conorm.
Definition 3
[5]. Under the presence of universal set  X , the CFS is given by
ξ ξ c f = Ξ R x + i Ξ I x : x X = Ξ R x e i 2 π Ξ I x : x X
where the terms  Ξ R x  and  Ξ I x  represent the real and imaginary part of the complex-valued membership function and the terms  Ξ R x  and  Ξ I x  represent amplitude and phase grade of the membership function, and  Ξ R x = Ξ R 2 x + Ξ I 2 x 1 2  and  Ξ I x = tan 1 Ξ I x Ξ R x . Here, we are also able to write the short form and call it C-FN,  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n . Furthermore, we discussed some operational laws for complex fuzzy information.
Definition 4
[5]. For C-FNs,  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n , we have
ξ ξ c f 1 ξ ξ c f 2 = x , max Ξ R 1 , Ξ R 2 e i 2 π max Ξ I 1 , Ξ I 2
ξ ξ c f 1 ξ ξ c f 2 = x , min Ξ R 1 , Ξ R 2 e i 2 π min Ξ I 1 , Ξ I 2
ξ ξ c f j c = x , 1 Ξ R j e i 2 π 1 Ξ I j
ξ ξ c f 1 ξ ξ c f 2 = x , Ξ R 1 + Ξ R 2 Ξ R 1 Ξ R 2 e i 2 π Ξ I 1 + Ξ I 2 Ξ I 1 Ξ I 2
ξ ξ c f 1 ξ ξ c f 2 = x , Ξ R 1 Ξ R 2 e i 2 π Ξ I 1 Ξ I 2
θ ̿ ξ ξ c f j = x , 1 1 Ξ R j θ ̿ e i 2 π 1 1 Ξ I j θ ̿
ξ ξ c f j θ ̿ = x , Ξ R j θ ̿ e i 2 π Ξ I j θ ̿
Now we aim to extend the theory of D-SM and GD-SM based on CFS and also try to describe their valuable results and properties.

3. Generalized Dice Similarity Measures for Complex Fuzzy Sets

In this section, we examined the ideas of CFD-SM, CFWD-SM, CFGD-SM, and CFWGD-SM. Moreover, some valuable results are also discussed in detail.
Definition 5.
For C-FNs  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n  and  ξ ξ c f j * = x , Ξ * R j e i 2 π Ξ * I j , j = 1,2 , , n , D-SM1 is denoted and defined as:
C F D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 n j = 1 n 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ R j 2 + Ξ I j 2 + Ξ * R j 2 + Ξ * I j 2
Further, D-SM 1 given in Equation (11) satisfies the following properties:
  • 0 C F D S M 1 ξ ξ c f j , ξ ξ c f j * 1 .
  • C F D S M 1 ξ ξ c f j , ξ ξ c f j * = C F D S M 1 ξ ξ c f j * , ξ ξ c f j .
  • C F D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * .
Example 1.
For C-FNs  ξ ξ c f = x , 0.7 e i 2 π 0.9  and  ξ ξ c f * = x , 0.3 e i 2 π 0.5 , then by using the theory in Equation (11) that is D-SM 1, we have
C F D S M 1 ξ ξ c f , ξ ξ c f = 1 1 j = 1 1 2 0.7 0.3 + 0.9 0.5 0.7 2 + 0.9 2 + 0.3 2 + 0.5 2 = 2 0.21 + 0.45 0.49 + 0.81 + 0.09 + 0.25 = 2 0.66 1.30 + 0.34 = 1.32 1.64 = 0.8048 .
Theorem 1.
C F D S M 1 ξ ξ c f j , ξ ξ c f j *  satisfies the properties of similarity measures.
Proof. 
Recall that
C F D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 n j = 1 n 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ R j 2 + Ξ I j 2 + Ξ * R j 2 + Ξ * I j 2
By definition, it is clear that C F D S M 1 ξ ξ c f j , ξ ξ c f j * 0 , and
Ξ R j 2 + Ξ I j 2 + Ξ * R j 2 + Ξ * I j 2 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j
But according to the inequality, we know that a 2 + b 2 2 a b , thus, 0 C F D S M 1 ξ ξ c f j , ξ ξ c f j * 1 .
Further, we prove that C F D S M 1 ξ ξ c f j , ξ ξ c f j * = C F D S M 1 ξ ξ c f j * , ξ ξ c f j ; for this, we use Equation (11), such as:
C F D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 n j = 1 n 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ R j 2 + Ξ I j 2 + Ξ * R j 2 + Ξ * I j 2 = 1 n j = 1 n 2 Ξ * R j Ξ R j + Ξ * I j Ξ I j Ξ * R j 2 + Ξ * I j 2 + Ξ R j 2 + Ξ I j 2 = C F D S M 1 ξ ξ c f j * , ξ ξ c f j .
Finally, we prove that C F D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * ; for this, we consider if ξ ξ c f j = ξ ξ c f j * , then we prove that C F D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 . Let ξ ξ c f j = ξ ξ c f j * , which means that Ξ R j = Ξ * R j and Ξ I j = Ξ * I j . Then, by using the information in Equation (11), we have
C F D S M 1 ξ ξ c f j , ξ ξ c f j * = 1
1 n j = 1 n 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ R j 2 + Ξ I j 2 + Ξ * R j 2 + Ξ * I j 2 = 1
1 n j = 1 n 2 Ξ R j Ξ R j + Ξ I j Ξ I j Ξ R j 2 + Ξ I j 2 + Ξ R j 2 + Ξ I j 2 = 1
1 n j = 1 n 2 Ξ R j 2 + Ξ I j 2 2 Ξ R j 2 + 2 Ξ I j 2 = 1
1 n j = 1 n 2 Ξ R j 2 + Ξ I j 2 2 Ξ R j 2 + Ξ I j 2 = 1 ξ ξ c f j = ξ ξ c f j * .
Definition 6.
For C-FNs  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n  and  ξ ξ c f j * = x , Ξ * R j e i 2 π Ξ * I j , j = 1 , 2 , , n , WD-SM 1 is denoted and defined as:
C F W D S M 1 ξ ξ c f j , ξ ξ c f j * = j = 1 n ̿ j 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ R j 2 + Ξ I j 2 + Ξ * R j 2 + Ξ * I j 2
where  ̿ j 0,1 . Further, WD-SM 1 is defined in Equation (12) satisfies the following properties:
  • 0 C F W D S M 1 ξ ξ c f j , ξ ξ c f j * 1 .
  • C F W D S M 1 ξ ξ c f j , ξ ξ c f j * = C F W D S M 1 ξ ξ c f j * , ξ ξ c f j .
  • C F W D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * .
Theorem 2.
C F W D S M 1 ξ ξ c f j , ξ ξ c f j *  satisfies the properties of similarity measures.
Proof. 
Straightforward.□
Here, it is worth noticing that the theory given in Equation (11) is a special case of the theory given in Equation (12), because if we put the value of ̿ j = 1 n , 1 n , , 1 n in Equation (12), then we can easily derive the theory in Equation (11). Moreover, from the information in Equations (11) and (12), we can easily derive the theory of distance measures such as C F D D M 1 ξ ξ c f j , ξ ξ c f j * = 1 C F D S M 1 ξ ξ c f j , ξ ξ c f j * and C F W D D M 1 ξ ξ c f j , ξ ξ c f j * = 1 C F W D S M 1 ξ ξ c f j , ξ ξ c f j * .
Definition 7.
For C-FNs  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n  and  ξ ξ c f j * = x , Ξ * R j e i 2 π Ξ * I j , j = 1,2 , , n , the notion of D-SM2 is denoted and defined as:
C F D S M 2 ξ ξ c f j , ξ ξ c f j * = 2 j = 1 n Ξ R j Ξ * R j + Ξ I j Ξ * I j j = 1 n Ξ R j 2 + Ξ I j 2 + j = 1 n Ξ * R j 2 + Ξ * I j 2
Further, D-SM 2 defined in Equation (13) satisfies the following properties:
  • 0 C F D S M 2 ξ ξ c f j , ξ ξ c f j * 1 .
  • C F D S M 2 ξ ξ c f j , ξ ξ c f j * = C F D S M 2 ξ ξ c f j * , ξ ξ c f j .
  • C F D S M 2 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * .
Theorem 3.
C F D S M 2 ξ ξ c f j , ξ ξ c f j *  satisfies the properties of similarity measures.
Proof. 
Straightforward. □
Definition 8.
For C-FNs  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1 , 2 , , n  and  ξ ξ c f j * = x , Ξ * R j e i 2 π Ξ * I j , j = 1,2 , , n , the notion of WD-SM2 is denoted and defined as:
C F W D S M 2 ξ ξ c f j , ξ ξ c f j * = 2 j = 1 n ̿ j 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j j = 1 n ̿ j 2 Ξ R j 2 + Ξ I j 2 + j = 1 n ̿ j 2 Ξ * R j 2 + Ξ * I j 2
where  ̿ j 0,1 .  Further, WD-SM2 defined in Equation (14) satisfies the following properties
  • 0 C F W D S M 2 ξ ξ c f j , ξ ξ c f j * 1 .
  • C F W D S M 2 ξ ξ c f j , ξ ξ c f j * = C F W D S M 2 ξ ξ c f j * , ξ ξ c f j .
  • C F W D S M 2 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * .
Theorem 4.
C F W D S M 2 ξ ξ c f j , ξ ξ c f j *  satisfies the properties of similarity measures.
Proof. 
Straightforward. □
Furthermore, the information in Equation (13) is the particular case of the information in Equation (14), if we use the value of ̿ j = 1 n , 1 n , , 1 n . Moreover, from the information in Equations (13) and (14), we can easily derive the theory of distance measures such as C F D D M 2 ξ ξ c f j , ξ ξ c f j * = 1 C F D S M 2 ξ ξ c f j , ξ ξ c f j * and C F W D D M 2 ξ ξ c f j , ξ ξ c f j * = 1 C F W D S M 2 ξ ξ c f j , ξ ξ c f j * .
Definition 9.
For C-FNs  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n  and  ξ ξ c f j * = x , Ξ * R j e i 2 π Ξ * I j , j = 1,2 , , n , the notion of GD-SM 1 is denoted and defined as:
C F G D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 n j = 1 n Ξ R j Ξ * R j + Ξ I j Ξ * I j Φ Ξ R j 2 + Ξ I j 2 + 1 Φ Ξ * R j 2 + Ξ * I j 2 ,   Φ 0,0.5
GD-SM 1 defined in Equation (15) satisfies the following properties:
  • 0 C F G D S M 1 ξ ξ c f j , ξ ξ c f j * 1 .
  • C F G D S M 1 ξ ξ c f j , ξ ξ c f j * = C F G D S M 1 ξ ξ c f j * , ξ ξ c f j .
  • C F G D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * .
Furthermore, we can easily derive two different types of results by using the information in Equation (15); for instance, by putting the value of Φ = 0,1 , we obtain
C F G D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 n j = 1 n Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ * R j 2 + Ξ * I j 2
C F G D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 n j = 1 n Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ R j 2 + Ξ I j 2
Which represent the asymmetric and projection similarity measures.
Theorem 5.
C F G D S M 1 ξ ξ c f j , ξ ξ c f j *  satisfies the properties of similarity measures.
Proof. 
Straightforward. □
Definition 10.
For C-FNs  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n  and  ξ ξ c f j * = x , Ξ * R j e i 2 π Ξ * I j , j = 1,2 , , n , the notion of WGD-SM 1 is denoted and defined as:
C F W G D S M 1 ξ ξ c f j , ξ ξ c f j * = j = 1 n ̿ j Ξ R j Ξ * R j + Ξ I j Ξ * I j Φ Ξ R j 2 + Ξ I j 2 + 1 Φ Ξ * R j 2 + Ξ * I j 2
where  ̿ j 0,1 . Further, the notion defined in Equation (18) satisfies the following properties:
  • 0 C F W G D S M 1 ξ ξ c f j , ξ ξ c f j * 1 .
  • C F W G D S M 1 ξ ξ c f j , ξ ξ c f j * = C F W G D S M 1 ξ ξ c f j * , ξ ξ c f j .
  • C F W G D S M 1 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * .
Furthermore, it is easy to derive two special types of results by using the information in Equation (18); for instance, by putting the value of Φ = 0,1 , we obtain
C F W G D S M 1 ξ ξ c f j , ξ ξ c f j * = j = 1 n ̿ j Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ * R j 2 + Ξ * I j 2
C F W G D S M 1 ξ ξ c f j , ξ ξ c f j * = j = 1 n ̿ j Ξ R j Ξ * R j + Ξ I j Ξ * I j Ξ R j 2 + Ξ I j 2
Which represent the asymmetric and projection similarity measures.
Theorem 6.
C F W G D S M 1 ξ ξ c f j , ξ ξ c f j *  satisfies the properties of similarity measures.
Proof. 
Straightforward. □
By putting ̿ j = 1 n , 1 n , , 1 n in Equation (18), we obtain the notion given in Equation (15). Moreover, from the information in Equations (15) and (18), we can easily derive the theory of distance measures such as C F G D D M 1 ξ ξ c f j , ξ ξ c f j * = 1 C F G D S M 1 ξ ξ c f j , ξ ξ c f j * and C F W G D D M 1 ξ ξ c f j , ξ ξ c f j * = 1 C F W G D S M 1 ξ ξ c f j , ξ ξ c f j * .
Definition 11.
For C-FNs  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n  and  ξ ξ c f j * = x , Ξ * R j e i 2 π Ξ * I j , j = 1,2 , , n , the notion of GD-SM2 is denoted and defined as:
C F G D S M 2 ξ ξ c f j , ξ ξ c f j * = j = 1 n Ξ R j Ξ * R j + Ξ I j Ξ * I j Φ j = 1 n Ξ R j 2 + Ξ I j 2 + 1 Φ j = 1 n Ξ * R j 2 + Ξ * I j 2
And it satisfies the following properties:
  • 0 C F G D S M 2 ξ ξ c f j , ξ ξ c f j * 1 ;
  • C F G D S M 2 ξ ξ c f j , ξ ξ c f j * = C F G D S M 2 ξ ξ c f j * , ξ ξ c f j ;
  • C F G D S M 2 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * .
Theorem 7.
C F G D S M 2 ξ ξ c f j , ξ ξ c f j *  satisfies the properties of similarity measures.
Proof. 
Straightforward. □
Furthermore, we can easily derive two different types of results by using the information in Equation (21); for instance, by putting the value of Φ = 0,1 , we obtain
C F G D S M 2 ξ ξ c f j , ξ ξ c f j * = j = 1 n Ξ R j Ξ * R j + Ξ I j Ξ * I j j = 1 n Ξ * R j 2 + Ξ * I j 2
C F G D S M 2 ξ ξ c f j , ξ ξ c f j * = j = 1 n Ξ R j Ξ * R j + Ξ I j Ξ * I j j = 1 n Ξ R j 2 + Ξ I j 2
Which represents asymmetric and projection similarity measures.
Definition 12.
For C-FNs  ξ ξ c f j = x , Ξ R j e i 2 π Ξ I j , j = 1,2 , , n  and  ξ ξ c f j * = x , Ξ * R j e i 2 π Ξ * I j , j = 1,2 , , n , the notion of WGD-SM2 is given by:
C F W G D S M 2 ξ ξ c f j , ξ ξ c f j * = j = 1 n ̿ j 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j Φ j = 1 n ̿ j 2 Ξ R j 2 + Ξ I j 2 + 1 Φ j = 1 n ̿ j 2 Ξ * R j 2 + Ξ * I j 2
where  ̿ j 0,1  and it satisfies the following properties.
  • 0 C F W G D S M 2 ξ ξ c f j , ξ ξ c f j * 1 ;
  • C F W G D S M 2 ξ ξ c f j , ξ ξ c f j * = C F W G D S M 2 ξ ξ c f j * , ξ ξ c f j ;
  • C F W G D S M 2 ξ ξ c f j , ξ ξ c f j * = 1 ξ ξ c f j = ξ ξ c f j * .
Theorem 8.
C F W G D S M 2 ξ ξ c f j , ξ ξ c f j *  must be justified by the property of similarity measures.
Proof. 
Straightforward. □
Furthermore, we can easily derive two different types of the result by using the information in Equation (24); for instance, by putting the value of Φ = 0,1 , we obtain
C F W G D S M 2 ξ ξ c f j , ξ ξ c f j * = j = 1 n ̿ j 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j j = 1 n ̿ j 2 Ξ * R j 2 + Ξ * I j 2
C F W G D S M 2 ξ ξ c f j , ξ ξ c f j * = j = 1 n ̿ j 2 Ξ R j Ξ * R j + Ξ I j Ξ * I j j = 1 n ̿ j 2 Ξ R j 2 + Ξ I j 2
Which represent the asymmetric and projection similarity measures.
Data in Equation (21) is the subpart of the theory in Equation (24) if we consider the value of ̿ j = 1 n , 1 n , , 1 n . Moreover, we have also the following ideas: C F G D D M 2 ξ ξ c f j , ξ ξ c f j * = 1 C F G D S M 2 ξ ξ c f j , ξ ξ c f j * and C F W G D D M 2 ξ ξ c f j , ξ ξ c f j * = 1 C F W G D S M 2 ξ ξ c f j , ξ ξ c f j * .

4. Artificial Intelligence in Digital Education

With the aid of suggested methods for CF information, the section below will detail the real-life utilization of artificial intelligence in the context of digital education. Schools, colleges, and universities experienced vast problems throughout the pandemic; to assess these problems, algorithms can be employed to evaluate the position of digital education in such problems in the context of a global pandemic.

4.1. Algorithm-1

The process of clustering analysis for assessing the problems of digital education within reality is outlined below. It aims to discern valuable evaluations from variable information about genuine problems in life. The process below attempts to manage complex and awkward data.
Step 1: Arrange information and compute a decision matrix, whose very information will be written in the shape of a complex fuzzy number.
Step 2: In the presence of CFD-SM1, we aim to find the closeness between any two possible pieces of information and write it in a matrix ξ ξ c f m = r i j m × m .
Step 3: Evaluate the composition of the matrix ξ ξ c f m such as: ξ ξ c f m 2 = ξ ξ c f m ° ξ ξ c f m , where
ξ ξ c f m ° ξ ξ c f m = r i j m × m = max k min r i k , r k j
If the ξ ξ c f m ° ξ ξ c f m ξ ξ c f m , then continues the above process and finds the value of ξ ξ c f m 4 = ξ ξ c f m 2 ° ξ ξ c f m 2 , if the ξ ξ c f m 2 ° ξ ξ c f m 2 ξ ξ c f m 2 , similarly continues this procedure even if we cannot receive the information in the form:
ξ ξ c f m 2 k ° ξ ξ c f m 2 k = ξ ξ c f m k
Step 4: After obtaining the ξ ξ c f m 2 k ° ξ ξ c f m 2 k = ξ ξ c f m k , we find the α cutting based on the information in step 3 based on the below information, such as:
ξ ξ c f m α = 0 r i k α 1 r i k > α
Therefore, we try to utilize this information in practical application to enhance the worth and stability of the derived measures.
Example 2.
Here we aim to resolve the education systems of Saudi Arabia and categorize provinces based on the parameters of evaluation. We consider a clustering approach to categorize/cluster provinces based on five education-related parameters:
  • x 1 : Gross enrollment ratio.
  • x 2 : Drop-out rate.
  • x 3 : Schools with boys’ toilets.
  • x 4 : Percentage of schools with computers.
  • x 5 : Percentage of schools with electricity.
The main theme of this demonstration is to utilize digital education in the environments of different provinces in Saudi Arabia. For this, we consider five different regions: ξ ξ c f 1 , ξ ξ c f 2 , ξ ξ c f 3 , ξ ξ c f 4 and ξ ξ c f 5 . Then, using the proposed algorithm, we evaluate the problems below.
Step 1: Arrange information and compute a decision matrix whose very information will be written in the shape of a complex fuzzy number such as:
ξ ξ c f 1 = x 1 , 0.9 e i 2 π 0.7 , x 2 , 0.7 e i 2 π 0.8 , x 3 , 0.8 e i 2 π 0.1 , x 4 , 0.5 e i 2 π 0.3 , x 5 , 0.6 e i 2 π 0.7
ξ ξ c f 2 = x 1 , 0.2 e i 2 π 0.3 , x 2 , 0.1 e i 2 π 0.3 , x 3 , 0.1 e i 2 π 0.2 , x 4 , 0.3 e i 2 π 0.3 , x 5 , 0.2 e i 2 π 0.4
ξ ξ c f 3 = x 1 , 0.1 e i 2 π 0.2 , x 2 , 0.2 e i 2 π 0.3 , x 3 , 0.3 e i 2 π 0.5 , x 4 , 0.4 e i 2 π 0.4 , x 5 , 0.5 e i 2 π 0.1
ξ ξ c f 4 = x 1 , 0.7 e i 2 π 0.3 , x 2 , 0.6 e i 2 π 0.3 , x 3 , 0.5 e i 2 π 0.4 , x 4 , 0.4 e i 2 π 0.5 , x 5 , 0.2 e i 2 π 0.6
ξ ξ c f 5 = x 1 , 0.5 e i 2 π 0.8 , x 2 , 0.6 e i 2 π 0.7 , x 3 , 0.7 e i 2 π 0.6 , x 4 , 0.8 e i 2 π 0.5 , x 5 , 0.9 e i 2 π 0.4
Step 2: Under the presence of CFD-SM1, we aim to find the closeness between any two possible pieces of information and write it in a matrix ξ ξ c f m = r i j m × m , which is listed below:
ξ ξ c f m = 1 0.604 0.6332 0.8713 0.9069     0.604 1 0.8162 0.7214 0.5935     0.6332 0.8162 1 0.7083 0.7267     0.8713 0.7214 0.7083 1 0.8212     0.9069 0.5935 0.7267 0.8212 1
Step 3: Evaluate the composition of the matrix ξ ξ c f m such as: ξ ξ c f m 2 = ξ ξ c f m ° ξ ξ c f m , where
ξ ξ c f m ° ξ ξ c f m = r i j m × m = max k min r i k , r k j
If the ξ ξ c f m ° ξ ξ c f m ξ ξ c f m , then continues the above process and finds the value of ξ ξ c f m 4 = ξ ξ c f m 2 ° ξ ξ c f m 2 , if the ξ ξ c f m 2 ° ξ ξ c f m 2 ξ ξ c f m 2 , similarly continues this procedure even if we cannot receive the information in the shape: ξ ξ c f m 2 k ° ξ ξ c f m 2 k = ξ ξ c f m k . Therefore, the procedure is continuing as:
ξ ξ c f m 2 = ξ ξ c f m ° ξ ξ c f m = 1 0.7214 0.7267 0.8713 0.9069     0.7214 1 0.8162 0.7214 0.8162     0.7267 0.8162 1 0.7267 0.7267     0.8713 0.7214 0.7267 1 0.8713     0.9069 0.8162 0.7267 0.8713 1
ξ ξ c f m 4 = ξ ξ c f m 2 ° ξ ξ c f m 2 = 1 0.8162 0.7267 0.8713 0.9069     0.8162 1 0.8162 0.8162 0.8162     0.7267 0.8162 1 0.7267 0.8162     0.8713 0.8162 0.7267 1 0.9069     0.9069 0.8162 0.8162 0.9069 1
ξ ξ c f m 8 = ξ ξ c f m 4 ° ξ ξ c f m 4 = 1 0.8162 0.8162 0.9069 0.9069     0.8162 1 0.8162 0.8162 0.8162     0.8162 0.8162 1 0.8162 0.8162     0.9069 0.8162 0.8162 1 0.9069     0.9069 0.8162 0.8162 0.9069 1
ξ ξ c f m 16 = ξ ξ c f m 8 ° ξ ξ c f m 8 = 1 0.8162 0.8162 0.9069 0.9069     0.8162 1 0.8162 0.8162 0.8162     0.8162 0.8162 1 0.8162 0.8162     0.9069 0.8162 0.8162 1 0.9069     0.9069 0.8162 0.8162 0.9069 1 = ξ ξ c f m 8
Therefore, we proceed to the next steps.
Step 4: After obtaining the ξ ξ c f m 2 k ° ξ ξ c f m 2 k = ξ ξ c f m k , we find the α cutting based on the information in step 3 based on the below information, such as:
ξ ξ c f m α = 0 r i k α 1 r i k > α
Therefore, the cutting matrix is given in the shape of Table 3.

4.2. Algorithm-2

In this subsection, we considered five unknown pieces of information on the source of digital education and one known type of digital education information and tried to evaluate them with the help of derived measures.
Example 3.
For instance, five valuable sources for digital education will be addressed  ξ ξ c f 1 : Mobile phone apps;  ξ ξ c f 2 : virtual reality glasses;  ξ ξ c f 3 : Holograms;  ξ ξ c f 4 : website and blogs; and ξ ξ c f 5 : digital books. In assessing such sources, sources will be prioritized by effectiveness according to various factors, such as  x 1 : feasibility;  x 2 : not time vesting;  x 3 : inexpensive;  x 4 : time-efficient; and x 5 : money-saving.
Under the consideration of five features of all digital education, five unknowns are listed below:
ξ ξ c f 1 = x 1 , 0.9 e i 2 π 0.7 , x 2 , 0.7 e i 2 π 0.8 , x 3 , 0.8 e i 2 π 0.1 , x 4 , 0.5 e i 2 π 0.3 , x 5 , 0.6 e i 2 π 0.7
ξ ξ c f 2 = x 1 , 0.5 e i 2 π 0.9 , x 2 , 0.6 e i 2 π 0.5 , x 3 , 0.3 e i 2 π 0.3 , x 4 , 0.7 e i 2 π 0.4 , x 5 , 0.6 e i 2 π 0.7
ξ ξ c f 3 = x 1 , 0.2 e i 2 π 0.5 , x 2 , 0.5 e i 2 π 0.4 , x 3 , 0.3 e i 2 π 0.6 , x 4 , 0.7 e i 2 π 0.7 , x 5 , 0.3 e i 2 π 0.8
ξ ξ c f 4 = x 1 , 0.4 e i 2 π 0.4 , x 2 , 0.5 e i 2 π 0.3 , x 3 , 0.6 e i 2 π 0.2 , x 4 , 0.7 e i 2 π 0.1 , x 5 , 0.8 e i 2 π 0.3
ξ ξ c f 5 = x 1 , 0.9 e i 2 π 0.1 , x 2 , 0.8 e i 2 π 0.2 , x 3 , 0.7 e i 2 π 0.7 , x 4 , 0.6 e i 2 π 0.4 , x 5 , 0.5 e i 2 π 0.5
For evaluating the above dilemma, we use one known information, which is stated below:
ξ ξ c f * = x 1 , 1 e i 2 π 1 , x 2 , 1 e i 2 π 1 , x 3 , 1 e i 2 π 1 , x 4 , 1 e i 2 π 1 , x 5 , 1 e i 2 π 1
Then, by using the derived measures based on weight vectors 0.2, 0.3, 0.1, 0.3, and 0.1 with Φ = 0.4 , the evaluated information is listed in Table 4.
Using the information in Table 4, the ranking results are given in Table 5.
From the information in Table 5, we noticed that all derived measures are given the same ranking information, such as: ξ ξ c f 1 , where ξ ξ c f 1 represented mobile phone apps, which are very beneficial and valuable for all students.

4.3. Algorithm-3

In this sub-section, we select five unknown places and one known place and try to evaluate the best place for digital education in Saudi Arabia under the consideration of derived measures.
Example 4.
Here, we considered five types of places, such as  ξ ξ c f 1 : Place-1;  ξ ξ c f 2 : Place-2;  ξ ξ c f 3 : Place-3;  ξ ξ c f 4 : Place-4; and  ξ ξ c f 5 : Place-5. For evaluating the above problem, we decided the places needed which kind of digital education was best for their people. For this, based on the following information, we will be deciding which kind of place needs digital education, such as:  x 1 : quality of internet services;  x 2 : the price of laptops;  x 3 : quantity of people;  x 4 : feasibility of employment; and  x 5 : reliability of social impact. Under the consideration of five things in all places, five unknowns are listed below:
ξ ξ c f 1 = x 1 , 0.9 e i 2 π 0.7 , x 2 , 0.7 e i 2 π 0.8 , x 3 , 0.8 e i 2 π 0.1 , x 4 , 0.5 e i 2 π 0.3 , x 5 , 0.6 e i 2 π 0.7
ξ ξ c f 2 = x 1 , 0.5 e i 2 π 0.9 , x 2 , 0.6 e i 2 π 0.5 , x 3 , 0.3 e i 2 π 0.3 , x 4 , 0.7 e i 2 π 0.4 , x 5 , 0.6 e i 2 π 0.7
ξ ξ c f 3 = x 1 , 0.2 e i 2 π 0.5 , x 2 , 0.5 e i 2 π 0.4 , x 3 , 0.3 e i 2 π 0.6 , x 4 , 0.7 e i 2 π 0.7 , x 5 , 0.3 e i 2 π 0.8
ξ ξ c f 4 = x 1 , 0.4 e i 2 π 0.4 , x 2 , 0.5 e i 2 π 0.3 , x 3 , 0.6 e i 2 π 0.2 , x 4 , 0.7 e i 2 π 0.1 , x 5 , 0.8 e i 2 π 0.3
ξ ξ c f 5 = x 1 , 0.9 e i 2 π 0.1 , x 2 , 0.8 e i 2 π 0.2 , x 3 , 0.7 e i 2 π 0.7 , x 4 , 0.6 e i 2 π 0.4 , x 5 , 0.5 e i 2 π 0.5
For evaluating the above dilemma, we use one known information which is stated below:
ξ ξ c f * = x 1 , 0.2 e i 2 π 0.3 , x 2 , 0.1 e i 2 π 0.3 , x 3 , 0.1 e i 2 π 0.2 , x 4 , 0.3 e i 2 π 0.3 , x 5 , 0.2 e i 2 π 0.4
Then by using the derived measures based on weight vectors 0.2,0.3,0.1,0.3, and 0.1 with Φ = 0.9 , the evaluated information is listed in Table 6.
Using the information in Table 6, the ranking results are given in Table 7.
From the information in Table 7, we noticed that all derived measures are given two different ranking information, such as: ξ ξ c f 2 and ξ ξ c f 3 , where ξ ξ c f 2 represented Place 2 in Saudi Arabia, and ξ ξ c f 3 represented Place-3 in Saudi Arabia, which is a very important and main feature for constructing any utilization of digital education.

5. Comparative Analysis

Comparative analysis will encompass the comparison between pervasive and recently introduced methods concerning CFS. In this context, pre-existing methods, including Lee-Kwang et al.’s [10] examination of the theory of SMs with fuzzy information, serve as the foundation for this. In addition, Xuecheng [11] established the three varying categories of methodology, such as entropy, distance, and SMs based on fuzzy information, while Beg and Ashraf [13] outlined the SMs for FSs, and Chen et al. [14] considered a multitude of SMs based on fuzzy information. Moreover, the work of Couso et al. [15] resulted in the theory of SMs and dis-SMs with their existing knowledge of fuzzy set theory, whereas Zhang and Fu [16] showcased their SMs based on FSs. Guo et al. [17], however, focused on the theory of cosine SMs based on CFS, while Hu et al. [18] evaluated the distance, similarity, and continuity information for CFS. The aforementioned comparative analysis will feature clearly in Table 8 by employing the information collated in Table 4.
Using the information in Table 8, the ranking results are given in Table 9.
It is important to bring to the reader’s attention that the ranked results in Table 9 are identical for all suggested measures as well as for the research conducted by Guo et al. [17] and Hu et al. [18]. With all measures collected from work guided by complex fuzzy information, the most appropriate conclusion is ξ ξ c f 1 . However, methods originating from the research of Lee-Kwang et al. [10], Xuecheng [11], Wang [12], Beg and Ashraf [13], Chen et al. [14], Couso et al. [15], and Zhang and Fu [16] were unsuccessful as a result of the fact they emerged from computed data based on fuzzy information as per the unique situation of the obtained measures.
Hence, such measures are considerably more generalized than the methods derived from various other scholars [10,11,12,13,14,15,16,17,18]. Thus, the measures utilized in this paper encompass many employment opportunities in artificial intelligence, machine learning, and problem solving.

6. Conclusions and Future Studies

Fuzzy set theory has a lot of applications in artificial intelligence, machine learning, and neural networks, but in many situations, the theory of fuzzy set has not worked effectively. For instance, if someone provides two-dimensional information instead of one-dimensional information, then the theory of fuzzy set has failed. For evaluating such types of problems, the theory of complex fuzzy theory is very effective and dominant in managing such types of problems. The major influence of this manuscript is stated below:
  • We derived the theory of complex fuzzy dice similarity measures and assessed the significant outcomes;
  • We derived the theory of complex fuzzy weighted dice similarity measures and assessed the significant outcomes;
  • We evaluated the idea of complex fuzzy generalized dice similarity measures;
  • We evaluated the idea of complex fuzzy weighted generalized dice similarity measures;
  • The issues within digital education were assessed using the obtained measures;
  • The contrasts between existing and suggested methods were showcased to highlight the flexibility and viability of the obtained and derived measures.
In the upcoming times, we aim to utilize the above measures in the environment of artificial intelligence, machine learning, game theory, and road signals. Further research regarding these concepts should evolve the suggested themes using the work of various disciplines, including soft expert sets [27], complex multi-fuzzy soft expert sets [28], m-polar fuzzy soft expert sets [29], Q multi-fuzzy soft expert sets [30], fuzzy soft expert sets [31], generalized fuzzy soft expert sets [32], cubic soft expert sets [33], complex fuzzy soft sets [34], data-driven fuzzy active disturbance rejection control [35], and enhanced p-type control [36]. Combined efforts can only be effective in the fields of artificial intelligence, neural networks, problem-solving, software engineering, computer science, and game theory.

Author Contributions

Conceptualization, M.A., T.M. and Z.A.; methodology, M.A., T.M. and Z.A.; software, M.A., T.M. and Z.A.; validation, M.A., T.M. and Z.A.; formal analysis, M.A., T.M. and Z.A.; investigation, M.A., T.M. and Z.A.; resources, M.A., T.M. and Z.A.; data curation, M.A., T.M. and Z.A.; writing—original draft preparation, M.A., T.M. and Z.A.; writing—review and editing, M.A., T.M. and Z.A.; visualization, M.A., T.M. and Z.A.; supervision, T.M.; project administration, M.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research work was funded by the Institutional Fund Projects under grant No. (IFPIP: 1375-130-1443). The authors gratefully acknowledge technical and financial support provided by the Ministry of Education and King Abdulaziz University DSR, Jeddah, Saudi Arabia.

Data Availability Statement

The data will be available upon reasonable request.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

SM—similarity measures; CF—complex fuzzy; D-SM—dice similarity measure; GD-SM—generalized dice similarity measure; CFS—complex fuzzy set; CFD-SM—complex fuzzy dice similarity measure; CFWD-SM—complex fuzzy weighted dice similarity measure; CFGD-SM—complex fuzzy generalized dice similarity measure; CFWGD-SM—complex fuzzy weighted generalized dice similarity measure; FS—fuzzy sets.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Mahmood, T.; Ali, Z. Fuzzy superior mandelbrot sets. Soft Comput. 2022, 26, 9011–9020. [Google Scholar] [CrossRef]
  3. Akram, M.; Adeel, A.; Alcantud, J.C.R. Fuzzy N-soft sets: A novel model with applications. J. Intell. Fuzzy Syst. 2018, 35, 4757–4771. [Google Scholar] [CrossRef]
  4. Fatimah, F.; Alcantud, J.C.R. The multi-fuzzy N-soft set and its applications to decision-making. Neural Comput. Appl. 2021, 33, 11437–11446. [Google Scholar] [CrossRef]
  5. Al Farsi, A.; Petrovic, D.; Doctor, F. A non-iterative reasoning algorithm for fuzzy cognitive maps based on type 2 fuzzy sets. Inf. Sci. 2023, 622, 319–336. [Google Scholar] [CrossRef]
  6. Karimi, M.; Tahayori, H.; Tirdad, K.; Sadeghian, A. A perceptual computer for hierarchical portfolio selection based on interval type-2 fuzzy sets. Granul. Comput. 2023, 8, 23–43. [Google Scholar] [CrossRef]
  7. Tian, Y.; Song, S.; Zhou, D.; Pang, S.; Wei, C. Canonical triangular interval type-2 fuzzy set linguistic distribution assessment TODIM approach: A case study of FMEA for electric vehicles DC charging piles. Expert Syst. Appl. 2023, 223, 119826. [Google Scholar] [CrossRef]
  8. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  9. Liu, P.; Ali, Z.; Mahmood, T. The distance measures and cross-entropy based on complex fuzzy sets and their application in decision making. J. Intell. Fuzzy Syst. 2020, 39, 3351–3374. [Google Scholar] [CrossRef]
  10. Mahmood, T.; Ali, Z. A novel complex fuzzy N-soft sets and their decision-making algorithm. Complex Intell. Syst. 2021, 7, 2255–2280. [Google Scholar] [CrossRef]
  11. Al-Qudah, Y.; Hassan, N. Complex multi-fuzzy soft set: Its entropy and similarity measure. IEEE Access 2018, 6, 65002–65017. [Google Scholar] [CrossRef]
  12. Tamir, D.E.; Rishe, N.D.; Kandel, A. Complex fuzzy sets and complex fuzzy logic an overview of theory and applications. In Fifty Years of Fuzzy Logic and Its Applications; Springer: Cham, Switzerland, 2015; pp. 661–681. [Google Scholar]
  13. Ghorbani, A.; Davoodi, F.; Zamanifar, K. Using type-2 fuzzy ontology to improve semantic interoperability for healthcare and diagnosis of depression. Artif. Intell. Med. 2023, 135, 102452. [Google Scholar] [CrossRef] [PubMed]
  14. Jan, N.; Gwak, J.; Pei, J.; Maqsood, R.; Nasir, A. Analysis of networks and digital systems by using the novel technique based on complex fuzzy soft information. IEEE Trans. Consum. Electron. 2022, 69, 183–193. [Google Scholar] [CrossRef]
  15. Yahya, M.; Abdullah, S.; Almagrabi, A.O.; Botmart, T. Analysis of S-box based on image encryption application using complex fuzzy credibility Frank aggregation operators. IEEE Access 2022, 10, 88858–88871. [Google Scholar] [CrossRef]
  16. Zeeshan, M.; Khan, M.; Iqbal, S. Distance function of complex fuzzy soft sets with application in signals. Comput. Appl. Math. 2022, 41, 96. [Google Scholar] [CrossRef]
  17. Hyung, L.-K.; Song, Y.-S.; Lee, K.-M. Similarity measure between fuzzy sets and between elements. Fuzzy Sets Syst. 1994, 62, 291–293. [Google Scholar]
  18. Liu, X. Entropy, distance measure and similarity measure of fuzzy sets and their relations. Fuzzy Sets Syst. 1992, 52, 305–318. [Google Scholar]
  19. Wang, W.J. New similarity measures on fuzzy sets and on elements. Fuzzy Sets Syst. 1997, 85, 305–309. [Google Scholar] [CrossRef]
  20. Beg, I.; Ashraf, S. Similarity measures for fuzzy sets. Appl. Comput. Math. 2009, 8, 192–202. [Google Scholar]
  21. Chen, S.M.; Yeh, M.S.; Hsiao, P.Y. A comparison of similarity measures of fuzzy values. Fuzzy Sets Syst. 1995, 72, 79–89. [Google Scholar] [CrossRef]
  22. Couso, I.; Garrido, L.; Sánchez, L. Similarity and dissimilarity measures between fuzzy sets: A formal relational study. Inf. Sci. 2013, 229, 122–141. [Google Scholar] [CrossRef]
  23. Zhang, C.; Fu, H. Similarity measures on three kinds of fuzzy sets. Pattern Recognit. Lett. 2006, 27, 1307–1317. [Google Scholar] [CrossRef]
  24. Guo, W.; Bi, L.; Hu, B.; Dai, S. Cosine similarity measure of complex fuzzy sets and robustness of complex fuzzy connectives. Math. Probl. Eng. 2020, 2020, 6716819. [Google Scholar] [CrossRef]
  25. Hu, B.; Bi, L.; Dai, S.; Li, S. Distances of complex fuzzy sets and continuity of complex fuzzy operations. J. Intell. Fuzzy Syst. 2018, 35, 2247–2255. [Google Scholar] [CrossRef]
  26. Ye, S.; Ye, J. Dice similarity measure between single valued neutrosophic multisets and its application in medical diagnosis. Neutrosophic Sets Syst. 2014, 6, 9. [Google Scholar]
  27. Alkhazaleh, S.; Salleh, A.R. Soft Expert Sets. Adv. Decis. Sci. 2011, 2011, 757868-1. [Google Scholar] [CrossRef]
  28. Al-Qudah, Y.; Hassan, M.; Hassan, N. Fuzzy parameterized complex multi-fuzzy soft expert set theory and its application in decision-making. Symmetry 2019, 11, 358. [Google Scholar] [CrossRef] [Green Version]
  29. Akram, M.; Ali, G.; Butt, M.A.; Alcantud, J.C.R. Novel MCGDM analysis under m-polar fuzzy soft expert sets. Neural Comput. Appl. 2021, 33, 12051–12071. [Google Scholar] [CrossRef]
  30. Adam, F.; Hassan, N. Multi Q-fuzzy soft expert set and its application. J. Intell. Fuzzy Syst. 2016, 30, 943–950. [Google Scholar] [CrossRef]
  31. Ihsan, M.; Rahman, A.U.; Saeed, M.; Khalifa, H.A.E.W. Convexity-cum-concavity on fuzzy soft expert set with certain properties. Int. J. Fuzzy Logic Intell. Syst. 2021, 21, 233–242. [Google Scholar] [CrossRef]
  32. Abdullah, S.; Amin, N.U. Analysis of S-box image encryption based on generalized fuzzy soft expert set. Nonlinear Dyn. 2015, 79, 1679–1692. [Google Scholar] [CrossRef]
  33. Qayyum, A.; Abdullah, S.; Aslam, M. Cubic soft expert sets and their application in decision making. J. Intell. Fuzzy Syst. 2016, 31, 1585–1596. [Google Scholar] [CrossRef]
  34. Selvachandran, G.; Hafeed, N.A.; Salleh, A.R.; Maji, P.K. Mappings on classes of expert complex fuzzy soft sets. Afr. Mat. 2019, 30, 459–467. [Google Scholar] [CrossRef]
  35. Roman, R.C.; Precup, R.E.; Petriu, E.M. Hybrid data-driven fuzzy active disturbance rejection control for tower crane systems. Eur. J. Control 2021, 58, 373–387. [Google Scholar] [CrossRef]
  36. Chi, R.; Li, H.; Shen, D.; Hou, Z.; Huang, B. Enhanced P-type control: Indirect adaptive learning from set-point updates. IEEE Trans. Autom. Control 2022, 68, 1600–1613. [Google Scholar] [CrossRef]
Table 1. Advantages and disadvantages of the proposed work.
Table 1. Advantages and disadvantages of the proposed work.
Advantages of the Proposed MeasuresDisadvantages of the Proposed Measures
  • Similar measures based on fuzzy sets are the special cases of the proposed theory.
  • Similarity measures based on complex fuzzy sets are the special cases of the proposed theory.
  • With the help of proposed measures, we can easily find the interrelationship between any two fuzzy or complex fuzzy numbers.
  • Dice similarity measures based on fuzzy sets and complex fuzzy sets are the special cases of the proposed work.
  • The presented measures can also use for evaluating two-dimension information.
  • The proposed measures have failed to depict the data which contained membership and non-membership grades.
  • The proposed measures have failed to aggregate the collection of information into a singleton set.
  • The proposed measures will be the special cases of these measures which will be proposed based on complex intuitionistic fuzzy sets and their extensions.
Table 2. Meaning of all parameters used in this manuscript.
Table 2. Meaning of all parameters used in this manuscript.
ParameterMeaningsParameterMeanings
V 1 Representation of vector ξ ξ f Fuzzy sets
x j , y j Element of vectors X Universal set
ξ ξ c f Complex fuzzy sets x Element of a universal set
Ξ R ( x ) + i Ξ I ( x ) Complex membership grade (Cartesian form) Ξ R x The real shape of membership grade
Ξ R ( x ) e i 2 π ( Ξ I ( x ) ) Complex membership grade (Polar form) Ξ I x The imaginary shape of membership grade
Ξ R ( x ) Amplitude term of membership grade Ξ I x Phase term of membership grade
θ ̿ 1 Scaler
Table 3. Classifications of different places.
Table 3. Classifications of different places.
Value   of   Parameter   α Classifications
α 0,0.7267 ξ ξ c f 1 , ξ ξ c f 2 , ξ ξ c f 3 , ξ ξ c f 4 , ξ ξ c f 5
α 0.7267,0.8162 ξ ξ c f 1 , ξ ξ c f 2 , ξ ξ c f 3 , ξ ξ c f 4 , ξ ξ c f 5
α 0.8162,0.8713 ξ ξ c f 2 , ξ ξ c f 1 , ξ ξ c f 3 , ξ ξ c f 4 , ξ ξ c f 5
α 0.8713 , 0.9069 ξ ξ c f 1 , ξ ξ c f 2 , ξ ξ c f 3 , ξ ξ c f 4 , ξ ξ c f 5
α 0.9069,1 ξ ξ c f 1 , ξ ξ c f 2 , ξ ξ c f 3 , ξ ξ c f 4 , ξ ξ c f 5
Table 4. Values of different types of measures for the data in Example 3.
Table 4. Values of different types of measures for the data in Example 3.
Methods ξ ξ c f 1 ξ ξ c f 2 ξ ξ c f 3 ξ ξ c f 4 ξ ξ c f 5
C F D S M 1 0.840690.810170.767680.697190.79775
C F W D S M 1 0.169150.166240.156450.136460.15556
C F D S M 2 0.901490.872070.850140.624940.79033
C F W D S M 2 0.916340.882660.846850.605320.74813
C F G D S M 1 0.779520.738620.692120.619630.72754
C F W G D S M 1 0.156830.151710.141420.120820.14143
C F G D S M 2 0.822850.780640.74570.572990.72327
C F W G D S M 2 0.834560.793440.750180.554460.68778
Table 5. Ranking information for the data in Table 4.
Table 5. Ranking information for the data in Table 4.
MethodsRanking Results
C F D S M 1 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 5 > ξ ξ c f 3 > ξ ξ c f 4
C F W D S M 1 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
C F D S M 2 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
C F W D S M 2 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
C F G D S M 1 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 5 > ξ ξ c f 3 > ξ ξ c f 4
C F W G D S M 1 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 5 > ξ ξ c f 3 > ξ ξ c f 4
C F G D S M 2 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
C F W G D S M 2 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
Table 6. Values of different types of measures for the data in Example 4.
Table 6. Values of different types of measures for the data in Example 4.
Methods ξ ξ c f 1 ξ ξ c f 2 ξ ξ c f 3 ξ ξ c f 4 ξ ξ c f 5
C F D S M 1 0.604040.710620.679280.655550.58463
C F W D S M 1 0.12840.138970.1290.137020.11595
C F D S M 2 0.686820.855320.959540.434270.53639
C F W D S M 2 0.714990.819630.775730.437680.49166
C F G D S M 1 0.410260.514040.461180.461570.39941
C F W G D S M 1 0.089320.100150.08740.097680.07923
C F G D S M 2 0.443640.62980.670940.278170.34476
C F W G D S M 2 0.465350.599560.513940.281680.31436
Table 7. Ranking information for the data in Table 6.
Table 7. Ranking information for the data in Table 6.
MethodsRanking Results
C F D S M 1 ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 4 > ξ ξ c f 1 > ξ ξ c f 5
C F W D S M 1 ξ ξ c f 2 > ξ ξ c f 4 > ξ ξ c f 3 > ξ ξ c f 1 > ξ ξ c f 5
C F D S M 2 ξ ξ c f 3 > ξ ξ c f 2 > ξ ξ c f 1 > ξ ξ c f 5 > ξ ξ c f 4
C F W D S M 2 ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 1 > ξ ξ c f 5 > ξ ξ c f 4
C F G D S M 1 ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 4 > ξ ξ c f 1 > ξ ξ c f 5
C F W G D S M 1 ξ ξ c f 2 > ξ ξ c f 4 > ξ ξ c f 1 > ξ ξ c f 3 > ξ ξ c f 5
C F G D S M 2 ξ ξ c f 3 > ξ ξ c f 2 > ξ ξ c f 1 > ξ ξ c f 5 > ξ ξ c f 4
C F W G D S M 2 ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 1 > ξ ξ c f 5 > ξ ξ c f 4
Table 8. Comparison: values of different types of measures for the data in Example 4.
Table 8. Comparison: values of different types of measures for the data in Example 4.
Methods ξ ξ c f 1 ξ ξ c f 2 ξ ξ c f 3 ξ ξ c f 4 ξ ξ c f 5
Lee-Kwang et al. [10] × × × × × × × × × × × × × × ×
Xuecheng [11] × × × × × × × × × × × × × × ×
Wang [12] × × × × × × × × × × × × × × ×
Beg and Ashraf [13] × × × × × × × × × × × × × × ×
Chen et al. [14] × × × × × × × × × × × × × × ×
Couso et al. [15] × × × × × × × × × × × × × × ×
Zhang and Fu [16] × × × × × × × × × × × × × × ×
Guo et al. [17]0.714320.680640.644830.403300.54611
Hu et al. [18]0.354810.350700.340400.320800.34041
C F D S M 1 0.840690.810170.767680.697190.79775
C F W D S M 1 0.169150.166240.156450.136460.15556
C F D S M 2 0.901490.872070.850140.624940.79033
C F W D S M 2 0.916340.882660.846850.605320.74813
C F G D S M 1 0.779520.738620.692120.619630.72754
C F W G D S M 1 0.156830.151710.141420.120820.14143
C F G D S M 2 0.822850.780640.74570.572990.72327
C F W G D S M 2 0.834560.793440.750180.554460.68778
Table 9. Ranking information for the data in Table 8.
Table 9. Ranking information for the data in Table 8.
MethodsRanking Results
Lee-Kwang et al. [10]Not applicable
Xuecheng [11]Not applicable
Wang [12]Not applicable
Beg and Ashraf [13]Not applicable
Chen et al. [14]Not applicable
Couso et al. [15]Not applicable
Zhang and Fu [16]Not applicable
Guo et al. [17] ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
Hu et al. [18] ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 5 > ξ ξ c f 3 > ξ ξ c f 4
C F D S M 1 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 5 > ξ ξ c f 3 > ξ ξ c f 4
C F W D S M 1 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
C F D S M 2 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
C F W D S M 2 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
C F G D S M 1 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 5 > ξ ξ c f 3 > ξ ξ c f 4
C F W G D S M 1 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 5 > ξ ξ c f 3 > ξ ξ c f 4
C F G D S M 2 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
C F W G D S M 2 ξ ξ c f 1 > ξ ξ c f 2 > ξ ξ c f 3 > ξ ξ c f 5 > ξ ξ c f 4
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Albaity, M.; Mahmood, T.; Ali, Z. Analysis and Applications of Artificial Intelligence in Digital Education Based on Complex Fuzzy Clustering Algorithms. Mathematics 2023, 11, 3184. https://doi.org/10.3390/math11143184

AMA Style

Albaity M, Mahmood T, Ali Z. Analysis and Applications of Artificial Intelligence in Digital Education Based on Complex Fuzzy Clustering Algorithms. Mathematics. 2023; 11(14):3184. https://doi.org/10.3390/math11143184

Chicago/Turabian Style

Albaity, Majed, Tahir Mahmood, and Zeeshan Ali. 2023. "Analysis and Applications of Artificial Intelligence in Digital Education Based on Complex Fuzzy Clustering Algorithms" Mathematics 11, no. 14: 3184. https://doi.org/10.3390/math11143184

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop