Processing math: 100%
Research article Special Issues

Probabilistic picture hesitant fuzzy sets and their application to multi-criteria decision-making

  • The picture hesitant fuzzy sets (PHFSs), which consider neutral membership degree as well as positive and negative membership degrees, provide decision makers (DMs) a flexible attitude to evaluate criteria values in complex multi-criteria decision-making (MCDM) situations. However, existing MCDM approaches based on PHFSs still have some drawbacks in both evaluation information expression and criteria values fusion. In this paper, our aim is to overcome these shortcomings by proposing new decision-making methods. To achieve this purpose, a new fuzzy information representation tool, called probabilistic picture hesitant fuzzy sets (P-PHFSs), is first introduced by capturing the probability of each element in PHFSs. The characteristic of P-PHFSs is that they provide more freedom to DMs so that criterion values of each alternative can be adequately described. To facilitate the use of P-PHFSs, we define the basic operational rules and comparison method of P-PHFSs. Then we also propose some aggregation operators for P-PHFSs and provide information fusion process. Furthermore, some desirable properties of these operators is discussed, and the relationship between the developed operators and the existing ones is investigated. Based on the proposed operators, two MCDM methods are developed under probabilistic picture hesitant fuzzy environment. Finally, two numerical examples are given to show the application of the developed methods, and a comparison analysis is conducted to demonstrate the effectiveness of the proposed approaches.

    Citation: Min Woo Jang, Jin Han Park, Mi Jung Son. Probabilistic picture hesitant fuzzy sets and their application to multi-criteria decision-making[J]. AIMS Mathematics, 2023, 8(4): 8522-8559. doi: 10.3934/math.2023429

    Related Papers:

    [1] Lihong Hu, Junjian Yang . Inequalities on 2×2 block accretive partial transpose matrices. AIMS Mathematics, 2024, 9(4): 8805-8813. doi: 10.3934/math.2024428
    [2] Ahmad Y. Al-Dweik, Ryad Ghanam, Gerard Thompson, M. T. Mustafa . Algorithms for simultaneous block triangularization and block diagonalization of sets of matrices. AIMS Mathematics, 2023, 8(8): 19757-19772. doi: 10.3934/math.20231007
    [3] Sourav Shil, Hemant Kumar Nashine . Positive definite solution of non-linear matrix equations through fixed point technique. AIMS Mathematics, 2022, 7(4): 6259-6281. doi: 10.3934/math.2022348
    [4] Kanjanaporn Tansri, Sarawanee Choomklang, Pattrawut Chansangiam . Conjugate gradient algorithm for consistent generalized Sylvester-transpose matrix equations. AIMS Mathematics, 2022, 7(4): 5386-5407. doi: 10.3934/math.2022299
    [5] Xiaoyan Xiao, Feng Zhang, Yuxin Cao, Chunwen Zhang . Some matrix inequalities related to norm and singular values. AIMS Mathematics, 2024, 9(2): 4205-4210. doi: 10.3934/math.2024207
    [6] Nunthakarn Boonruangkan, Pattrawut Chansangiam . Convergence analysis of a gradient iterative algorithm with optimal convergence factor for a generalized Sylvester-transpose matrix equation. AIMS Mathematics, 2021, 6(8): 8477-8496. doi: 10.3934/math.2021492
    [7] Junyuan Huang, Xueqing Chen, Zhiqi Chen, Ming Ding . On a conjecture on transposed Poisson n-Lie algebras. AIMS Mathematics, 2024, 9(3): 6709-6733. doi: 10.3934/math.2024327
    [8] Mohammad Al-Khlyleh, Mohammad Abdel Aal, Mohammad F. M. Naser . Interpolation unitarily invariant norms inequalities for matrices with applications. AIMS Mathematics, 2024, 9(7): 19812-19821. doi: 10.3934/math.2024967
    [9] Arnon Ploymukda, Pattrawut Chansangiam . Metric geometric means with arbitrary weights of positive definite matrices involving semi-tensor products. AIMS Mathematics, 2023, 8(11): 26153-26167. doi: 10.3934/math.20231333
    [10] Shakir Ali, Amal S. Alali, Atif Ahmad Khan, Indah Emilia Wijayanti, Kok Bin Wong . XOR count and block circulant MDS matrices over finite commutative rings. AIMS Mathematics, 2024, 9(11): 30529-30547. doi: 10.3934/math.20241474
  • The picture hesitant fuzzy sets (PHFSs), which consider neutral membership degree as well as positive and negative membership degrees, provide decision makers (DMs) a flexible attitude to evaluate criteria values in complex multi-criteria decision-making (MCDM) situations. However, existing MCDM approaches based on PHFSs still have some drawbacks in both evaluation information expression and criteria values fusion. In this paper, our aim is to overcome these shortcomings by proposing new decision-making methods. To achieve this purpose, a new fuzzy information representation tool, called probabilistic picture hesitant fuzzy sets (P-PHFSs), is first introduced by capturing the probability of each element in PHFSs. The characteristic of P-PHFSs is that they provide more freedom to DMs so that criterion values of each alternative can be adequately described. To facilitate the use of P-PHFSs, we define the basic operational rules and comparison method of P-PHFSs. Then we also propose some aggregation operators for P-PHFSs and provide information fusion process. Furthermore, some desirable properties of these operators is discussed, and the relationship between the developed operators and the existing ones is investigated. Based on the proposed operators, two MCDM methods are developed under probabilistic picture hesitant fuzzy environment. Finally, two numerical examples are given to show the application of the developed methods, and a comparison analysis is conducted to demonstrate the effectiveness of the proposed approaches.



    Noncontact gesture recognition has made a significant contribution to human-computer interaction (HCI) applications with the enormous growth of artificial intelligence (AI) and computer technology [1]. Hand gesture detection systems, with their natural human-computer interaction features, enable effective and intuitive communication through a computer interface. Furthermore, gesture detection depends on vision and can be broadly implemented in AI, natural language communication, virtual reality, and multimedia [2]. Daily, the demand for and the level of services essential to people is increasing. Hand gestures are a main component of face-to-face communication [3]. Hence, human body language serves a significant part in face-to-face transmission and making hand gestures. In interaction, many things are expressed with hand gestures, and this study presents few visions into transmission itself [4]. Yet, recent automation in this region does not concentrate on using hand gestures in everyday actions. The emerging technology eases the difficulty of processes of different user interfaces and computer programs presented to the user. To make this mechanism less complex and easy to understand, nowadays image processing is utilized [5].

    When transmission has to be recognized between a deaf and a normal person, there is a robust necessity for hand gestures. To make the system smarter, there comes a necessity to enter hand gesture imageries into the mechanism and carry out an examination further to determine their meaning [6]. Still, conventional hand gesture detection related to image processing methods was not broadly implemented in HCI due to its complex algorithm, poor real-time capability, and low recognition accuracy [7]. Currently, gesture detection related to machine learning (ML) has advanced quickly in HCI owing to the presentation of AI and image processing graphics processor unit (GPU) [8]. The ML methods like neural networks, local orientation histograms, elastic graph matching, and support vector machines (SVM) were broadly utilized. Due to its learning capability, the NN does not require manual feature setting through simulating human learning processes and can execute training gesture instances to form a network classification detection map [9]. Currently, DL is a frequently utilized approach for HGR. Recurrent neural networks (RNN), CNNs, and stacked denoising auto encoders (SDAE), and are usually utilized in HGR applications [10].

    This study leverages the Lion Swarm optimizer with deep convolutional neural network (LSO-DCNN) for gesture recognition and classification. The aim of the LSO-DCNN technique lies in the proper identification and categorization of various categories of gestures that exist in the input images. Primarily, the 1D-convolutional neural network (1D-CNN) method derives a collection of feature vectors. In the second step, the LSO algorithm optimally chooses the hyperparameter values of the 1D-CNN model. At the final step, the extreme gradient boosting (XGBoost) classifier allocates proper classes, i.e., recognizes the gestures efficaciously. To portray the enhanced gesture classification results of the LSO-DCNN algorithm, a wide range of experimental results are investigated. A brief comparative study reports the improvements in the LSO-DCNN technique in the gesture recognition process.

    Sun et al. [11] suggested a model dependent upon multi-level feature fusion of a two-stream convolutional neural network (MFF-TSCNN) which comprises three major phases. Initially, the Kinect sensor acquires red, green, blue, and depth (RGB-D) imageries for establishing a gesture dataset. Simultaneously, data augmentation is accomplished on the datasets of testing and training. Later, a MFF-TSCNN model is built and trained. Barioul and Kanoun [12] proposed a new classifying model established on an extreme learning machine (ELM) reinforced by an enhanced grasshopper optimization algorithm (GOA) as a fundamental for a weight-pruning procedure. Myographic models like force myography (FMG) present stimulating signals that can construct the foundation for recognizing hand signs. FMG was examined for limiting the sensor numbers to appropriate locations and giving necessary signal processing techniques for observable employment in wearable embedded schemes. Gadekallu et al. [13] presented a crow search-based CNN (CS-CNN) method for recognizing gestures relating to the HCI field. The hand gesture database utilized in the research is an open database that is obtained from Kaggle. Also, a one-hot encoding method was employed for converting the definite values of the data to its binary system. After this, a crow search algorithm (CSA) for choosing optimum tuning for data training by utilizing the CNNs was employed.

    Yu et al. [14] employed a particle swarm optimization (PSO) technique for the width and center value optimization of the radial basis function neural network (RBFNN). Also, the authors utilized a Electromyography (EMG) signal acquisition device and the electrode sleeve for gathering the four-channel continuous EMG signals produced by 8 serial gestures. In [15], the authors presented an ensemble of CNN-based techniques. First, the gesture segment is identified by employing the background separation model established on the binary threshold. Then, the contour section can be abstracted and the segmentation of the hand area takes place. Later, the imageries are re-sized and given to three distinct CNN methods for similar training.

    Gao et al. [16] developed an effective hand gesture detection model established on deep learning. First, an RGB-D early-fusion technique established on the HSV space was suggested, efficiently mitigating background intrusion and improving hand gesture data. Second, a hand gesture classification network (HandClasNet) was suggested for comprehending hand gesture localization and recognition by identifying the center and corner hand points, and a HandClasNet was suggested for comprehending gesture detection by employing a similar EfficientNet system. In [17], the authors utilized the CNN approach for the recognition and identification of human hand gestures. This procedure workflow comprises hand region of interest segmenting by employing finger segmentation, mask image, segmented finger image normalization, and detection by utilizing the CNN classifier. The segmentation is performed on the hand area of an image from the whole image by implementing mask images.

    Figure 1.  Overall process of the LSO-DCNN approach.

    This study has developed a new LSO-DCNN method for automated gesture recognition and classification. The major intention of the LSO-DCNN method lies in the proper identification and categorization of various categories of gestures that exist in the input images. The presented LSO-DCNN model follows a three-step procedure:

    Step 1: The 1D-CNN method derives a collection of feature vectors.

    Step 2: The LSO method optimally chooses the hyperparameter values of the 1D-CNN model.

    Step 3: The XGBoost classifier assigns appropriate classes, i.e., effectively recognizes the gestures.

    First, the 1D-CNN model derives a collection of feature vectors. The CNN can be referred to as a neural network that exploits convolutional operations in at least one layer of the network instead of normal matrix multiplication operations [18]. Convolution is a special linear operation; all the layers of the convolutional network generally consist of three layers: pooling, convolutional, and activation layers. In the image detection domain, the 2DCNN can be commonly utilized for extracting features from images. The classical CNN models are AlexNet, LeNet, ResNet, VGG, GoogleNet, and so on. The 1D-CNN is used for extracting appropriate features of the data. The input of the 1D-CNN is 1D data, hence its convolutional kernel adopts a 1D architecture. The output of every convolutional, activation, and pooling layer corresponds to a 1D feature vector. In this section, the fundamental structure of the 1DCNN will be introduced.

    The convolution layer implements the convolution function on the 1D input signals and the 1D convolution filter, and later extracts local features using the activation layer. The data is inputted to the convolution layer of the 1D-CNN to implement the convolutional function.

    xlk=ni=1conv(wl1ik,sl1i)+bik (1)

    Here, xlk,blk correspondingly characterize the output and offset of the kthneurons in layer l;sl1i characterizes the output of ith neurons in layer l1; wl1ik characterizes the convolutional kernels of ith neurons in thel1 layer, and the kth neurons in layer l,i=1,2,, n,n denotes the amount of neurons.

    The activation layer implements a non-linear conversion on the input signal through a non-linear function to improve the CNN's expressive power. Currently, the typical activation function is ReLU, Sigmoid, and Tanh. Since the ReLU function may overcome gradient dispersion and converge quickly, it is extensively applied. Thus, the ReLU function was applied as the activation function, and its equation can be represented as

    ylk=f(xlk)={0,xlk} (2)

    where ylk denotes the activation value of layer l.

    The pooling layer can generally be employed after the convolution layer. Downsampling avoids over-fitting, decreases the spatial size of parameters and network features, and decreases the calculation count. The typical pooling operations are maximum and average pooling.

    zl(j)k={yl(t)k} (3)

    Where zl(j)k signifies the jth value in the kth neuron of layer l; yl(t)k characterizes the tth activation value in thekth neuron of layer l;r denotes the pooling area's width.

    In this work, the LSO approach optimally chooses hyperparameter values of the 1D-CNN model. This approach is selected for its capacity for effectively navigating the parameter space, adapting the nature of the model to local characteristics, and converging toward optimum settings, making the model more appropriate to fine-tune intricate methods. In the LSO algorithm, based on the historical optimum solution, the lion king conducts a range search to find the best solutions [19]. The equation for updating the location is given below:

    xk+1i=gk(1+γpkigk) (4)

    A lioness arbitrarily chooses an additional lioness to cooperate with, and the equation for location updating can be represented as

    xk+1i=pki+pkc2(1+αfγ) (5)

    Follow the lioness, leave the group, or follow the lion king to find an updated position are the three updating approaches for young lions:

    xk+1i={gk+pki2(1+αcγ),0q13pkmpki2(1+αcγ),13<q23g_k+pki2(1+αcγ),23<q1 (6)

    In Eq (6), xki denotes the ith individuals at the kth generation population; pki represents the prior optimum location of the ith individuals from the 1st to kth generation; γ shows the uniform distribution random number N(0,1)pkc is randomly chosen from the kth generation lioness group; gk shows the optimum location of the kth generation population; q denotes the uniform distribution random number U[0,1]g_=low_+up_gk,pkm is arbitrarily chosen from the kth generation lion group; αf and αc denotes the disturbance factor, low_ and up_ indicates the minimal and maximal values of all the dimensions within the range of lion activity space

    αf=0.1(up_low_)×exp(30tT)10 (7)
    αc=0.1(up_low_)×(TtT) (8)

    whereT shows the maximal amount of iterations andt denotes the existing amount of iterations.

    The fitness selection becomes a vital component in the LSO method. Solution encoding can be used to evaluate the candidate solution's aptitude. Here, to design a fitness function, the accuracy value is the main condition used.

    Fitness=max(P) (9)
    P=TPTP+FP (10)

    From the expression, FP means the false positive value and TP denotes the true positive.

    Finally, the XGBoost classifier allocates proper classes, i.e., recognizes the gestures efficaciously. XGBoost is an ensemble ML technique, a gradient boost method utilized for improving the efficiency of a predictive model, which integrates a series of weak methods as a strong learning approach [20]. The ensemble methods offer optimum outcomes related to a single model. Figure 2 defines the architecture of XGBoost. The steps involved are given as follows.

    Figure 2.  Structure of XGBoost.

    Step 1: Initialize

    To solve a binary classifier problem, where yj is the actual label denoted as 1 or 0. Consequently, the commonly exploited log loss function is assumed during this case and is demonstrated as

    l(yiˆyti)=(yilog(Pi)+(1yi)log(1Pi) (11)

    where

    pi=11+eˆyti. (12)

    Based on the Pi,yi, and p values, the gi and hj values are evaluated.

    gi=Piyi,hi=p(1pi). (13)

    From the (t1)th tree of instance xi, the evaluated forecasted value is projected as ˆy(t1)i, in which the actual value of xi is yi. But, the predictive value is 0 for the 0th tree, which implies ˆy(0)i=0.

    Step 2: The Gain value of features required for traverse and is computed for determining the splitting mode for the present root node. The Gain value is support to evaluate the feature node with maximal Gain score.

    Step 3: During this step, the establishment of the Current Binary Leaf Node setup is performed. Based on the feature with maximal Gain, the sample set can be categorized as 2 parts for obtaining 2 leaf nodes. Moreover, the second step can repeat to 2 leaf nodes assuming a negative gain score and end criteria, correspondingly. This step establishes the entire tree.

    Step 4: Whole Leaf Node forecast values are computed in this step. Leaf node ωj forecast values are computed as

    ωj=GjHj+λ (14)

    and the second tree forecast outcomes are expressed as

    y(2)i=y(1)i+f2(xi) (15)

    Afterward, this will result in establishing the second tree.

    Step 5: The next step is to repeat steps 1 and 2 to set up further trees until a sufficient count of trees can be introduced. The predictive values of model y(t)i are expressed as ˆy(t)i=ˆy(t1)i+f2(xi), whereas y(t)i refers to the predictive value of t trees on instance xi. This procedure creates the tth tree.

    pi=11+eˆy (16)

    Step 6: This equation that is utilized for determining the classifier outcome of an instance is to attain the probability by changing the last forecast value ˆy of the instance. If pi0.5, the probability of the instance is 1; else, it is 0.

    In this section, the results of the LSO-DCNN technique are validated using two benchmark datasets: the sign language digital (SLD) dataset and the sign language gesture image (SLGI) dataset.

    In Table 1 and Figure 3, the overall comparative recognition results of the LSO-DCNN technique are examined on the SLD dataset [21]. Based on accuy, the LSO-DCNN technique reaches an increased accuy of 91.32%, while the RF, LR, KNN, XGBoost, and MobileNet-RF models obtain decreased accuy of 90.19%, 89.29%, 85.79%, 90.18%, and 90.55%, respectively. Next, based on precn, the LSO-DCNN approach reaches an increased precn of 91.18%, while the RF, LR, KNN, XGBoost, and MobileNet-RF techniques obtain decreased precn of 45.77%, 50.59%, 35.53%, 49.26%, and 80.97%, correspondingly. At the same time, based on recal, the LSO-DCNN algorithm attained an increased recal of 91.31%, while the RF, LR, KNN, XGBoost, and MobileNet-RF approaches obtained decreased recal of 48.67%, 44.55%, 35.83%, 50.12%, and 81.13%, respectively. Finally, based on F1score, the LSO-DCNN method reaches an increased F1score of 91.78%, while the RF, LR, KNN, XGBoost, and MobileNet-RF models obtain decreased F1score of 46.75%, 44.56%, 34.07%, 49.31%, and 80.10%, correspondingly.

    Table 1.  Comparative analysis of the LSO-DCNN approach with other systems on the SLD dataset.
    Sign Language Digital Dataset
    Methods Accuracy Precision Recall F1 score
    Random Forest 90.19 45.77 48.67 46.75
    Logistic Regression 89.29 50.59 44.55 44.56
    K-Nearest Neighbor 85.79 35.53 35.83 34.07
    XGBoost 90.18 49.26 50.12 49.31
    MobileNet-RF 90.55 80.97 81.13 80.10
    LSO-DCNN 91.32 91.18 91.31 91.78

     | Show Table
    DownLoad: CSV
    Figure 3.  Comparative outcome of LSO-DCNN approach on the SLD dataset.

    Figure 4 inspects the accuracy of the LSO-DCNN method in the training and validation of the SLD dataset. The figure notifies that the LSO-DCNN method has greater accuracy values over higher epochs. Furthermore, the higher validation accuracy over training accuracy portrays that the LSO-DCNN approach learns productively on the SLD dataset.

    Figure 4.  Accuracy curve of LSO-DCNN approach on the SLD dataset.

    The loss analysis of the LSO-DCNN technique in the training and validation is given on the SLD dataset in Figure 5. The results indicate that the LSO-DCNN approach attained adjacent values of training and validation loss. The LSO-DCNN approach learns productively on the SLD database.

    Figure 5.  Loss curve of LSO-DCNN approach on the SLD dataset.

    In Table 2 and Figure 6, the overall comparative recognition outcomes of the LSO-DCNN technique are examined on the SLGI dataset. Based on accuy, the LSO-DCNN technique reaches an increased accuy of 99.09%, while the RF, LR, KNN, XGBoost, and MobileNet-RF approaches gain decreased accuy of 97.93%, 97.93%, 93.40%, 98.25%, and 98.31%, correspondingly. Next, based on precn, the LSO-DCNN methodology reaches an increased precn of 98.86%, while the RF, LR, KNN, XGBoost, and MobileNet-RF approaches obtain decreased precn of 29.08%, 20.49%, 27.34%, 31.15%, and 98.12%, correspondingly. Simultaneously, based on recal, the LSO-DCNN method reaches an increased recal of 99.15%, while the RF, LR, KNN, XGBoost, and MobileNet-RF models obtain decreased recal of 30.33%, 23.37%, 27.98%, 31.78%, and 98.11%, correspondingly. Eventually, based on F1score, the LSO-DCNN technique reaches an increased F1score of 99.03%, while the RF, LR, KNN, XGBoost, and MobileNet-RF approaches obtain decreased F1score of 29.10%, 19.77%, 27.30%, 30.03%, and 97.89%, correspondingly.

    Table 2.  Comparative analysis of the LSO-DCNN approach with other methods on the SLGI dataset.
    Sign Language Gestures Image Dataset
    Methods Accuracy Precision Recall F1 score
    Random Forest 97.93 29.08 30.33 29.10
    Logistic Regression 97.93 20.49 23.37 19.77
    K-Nearest Neighbor 93.40 27.34 27.98 27.30
    XGBoost 98.25 31.15 31.78 30.03
    MobileNet-RF 98.31 98.12 98.11 97.89
    LSO-DCNN 99.09 98.86 99.15 99.03

     | Show Table
    DownLoad: CSV
    Figure 6.  Comparative outcome of LSO-DCNN approach on the SLGI dataset.

    Figure 7 portrays the accuracy of the LSO-DCNN method in the training and validation of the SLGI database. The result shows that the LSO-DCNN technique has higher accuracy values over greater epochs. Moreover, the higher validation accuracy over training accuracy shows that the LSO-DCNN technique learns productively on the SLGI database.

    Figure 7.  Accuracy curve of LSO-DCNN approach on the SLGI dataset.

    The loss analysis of the LSO-DCNN approach in the training and validation is shown on the SLGI dataset in Figure 8. The results indicate that the LSO-DCNN method reaches adjacent values of training and validation loss. The LSO-DCNN method learns productively on the SLGI database.

    Figure 8.  Loss curve of LSO-DCNN approach on the SLGI dataset.

    This study developed a new LSO-DCNN technique for automated gesture recognition and classification. The major intention of the LSO-DCNN approach lies in the proper identification and categorization of various categories of gestures that exist in the input images. The presented LSO-DCNN model follows a three-step procedure, namely 1D-CNN based feature extraction, LSO-based hyperparameter tuning, and XGBoost classification. In this work, the LSO method optimally chooses the hyperparameter values of the 1D-CNN model and it helps to recognize the gestures efficaciously. To prove the enhanced gesture classification results of the LSO-DCNN approach, a wide range of experimental results are investigated. The brief comparative study reported the improvements in the LSO-DCNN technique in the gesture recognition process. In the future, multimodality concepts can enhance the performance of the LSO-DCNN technique.

    The authors extend their appreciation to the King Salman center For Disability Research for funding this work through Research Group no KSRG-2023-175.



    [1] P. Mandal, S. Samanta, M. Pal, A. S. Ranadive, Pythagorean linguistic preference relations and their applications to group decision making using group recommendations based on consistency matrices and feedback mechanism, Int. J. Intell. Syst., 35 (2020), 826–849. https://doi.org/10.1002/int.22226 doi: 10.1002/int.22226
    [2] L. Li, R. T. Zhang, J. Wang, X. P. Shang, K. Y. Bai, A novel approach to multi-attribute group decision-making with q-rung picture linguistic information, Symmetry, 10 (2018), 172. https://doi.org/10.3390/sym10050172 doi: 10.3390/sym10050172
    [3] L. A. Zadeh, Fuzzy sets, Inf. Control, 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X doi: 10.1016/S0019-9958(65)90241-X
    [4] L. A. Zadeh, The concept of a linguistic variable and its application to approximate reasoning-I, Inf. Sci., 8 (1975), 199–249. https://doi.org/10.1016/0020-0255(75)90036-5 doi: 10.1016/0020-0255(75)90036-5
    [5] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets Syst., 20 (1986), 87–96. https://doi.org/10.1016/S0165-0114(86)80034-3 doi: 10.1016/S0165-0114(86)80034-3
    [6] K. Atanassov, G. Gargov, Interval-valued intuitionistic fuzzy sets, Fuzzy Sets Syst., 31 (1989), 343–349. https://doi.org/10.1016/0165-0114(89)90205-4 doi: 10.1016/0165-0114(89)90205-4
    [7] D. Dubois, H. Prade, Fuzzy Sets and systems: Theory and applications, Cambridge: Academic Press, 1980.
    [8] B. C. Cuong, Picture fuzzy sets, JCC, 30 (2015), 409–420. https://doi.org/10.15625/1813-9663/30/4/5032 doi: 10.15625/1813-9663/30/4/5032
    [9] V. Torra, Hesitant fuzzy sets, Int. J. Intell. Syst., 25 (2010), 529–539. https://doi.org/10.1002/int.20418 doi: 10.1002/int.20418
    [10] V. Torra, Y. Narukawa, On hesitant fuzzy sets and decision, Proceedings of the 18th IEEE international conference on fuzzy systems, 2009, 1378–1382.
    [11] M. M. Xia, Z. S. Xu, Hesitant fuzzy information aggregation in decision making, Int. J. Approx. Reason., 52 (2011), 395–407. https://doi.org/10.1016/j.ijar.2010.09.002 doi: 10.1016/j.ijar.2010.09.002
    [12] M. M. Xia, Z. S. Xu, N. Chen, Some hesitant fuzzy aggregation operators with their application in group decision making, Group Dec. Negot., 22 (2013), 259–279. https://DOI10.1007/s10726-011-9261-7 doi: 10.1007/s10726-011-9261-7
    [13] B. Zhu, Z. S. Xu, M. M. Xia, Hesitant fuzzy geometric Bonferroni means, Inform. Sci., 205 (2012), 72–85. https://doi.org/10.1016/j.ins.2012.01.048 doi: 10.1016/j.ins.2012.01.048
    [14] G. W. Wei, Hesitant fuzzy prioritized operators and their application to multiple attribute decision making, Knowl.-Based Syst., 31 (2012), 176–182. https://doi.org/10.1016/j.knosys.2012.03.011 doi: 10.1016/j.knosys.2012.03.011
    [15] Z. M. Zhang, Hesitant fuzzy power aggregation operators and their application to multiple attribute group decision making, Inform. Sci., 234 (2013), 150–181. https://doi.org/10.1016/j.ins.2013.01.002 doi: 10.1016/j.ins.2013.01.002
    [16] Z. S. Xu, M. M. Xia, Distance and similarity measures for hesitant fuzzy sets, Inform. Sci., 181 (2011), 2128–2138. https://doi.org/10.1016/j.ins.2011.01.028 doi: 10.1016/j.ins.2011.01.028
    [17] N. Chen, Z. S. Xu, M. M. Xia, Correlation coefficients of hesitant fuzzy sets and their applications to clustering analysis, Applied Math. Modelling, 37 (2013), 2197–2211. https://doi.org/10.1016/j.apm.2012.04.031 doi: 10.1016/j.apm.2012.04.031
    [18] Z. S. Xu, M. M. Xia, Hesitant fuzzy entropy and cross-entropy and their use in multiattribute decision-making, Int. J. Intell. Syst., 27 (2012), 799–822. https://doi.org/10.1002/int.21548 doi: 10.1002/int.21548
    [19] B. Farhadinia, Information measures for hesitant fuzzy sets and interval-valued hesitant fuzzy sets, Inform. Sci., 240 (2013), 129–144. https://doi.org/10.1016/j.ins.2013.03.034 doi: 10.1016/j.ins.2013.03.034
    [20] G. W. Wei, N. Zhang, A multiple criteria hesitant fuzzy decision making with Shapley value-based VIKOR method, J. Intell. Fuzzy Syst., 26 (2014), 1065–1075. https://doi.org/10.3233/ifs-130798 doi: 10.3233/ifs-130798
    [21] Z. S. Xu, M. M. Xia, On distance and correlation measures of hesitant fuzzy information, Int. J. Intell. Syst., 26 (2011), 410–425. https://doi.org/10.1002/int.20474 doi: 10.1002/int.20474
    [22] B. Zhu, Z. S. Xu, M. M. Xia, Dual hesitant fuzzy sets, J. Appl. Math., 2012 (2012), 879629. https://doi.org/10.1155/2012/879629 doi: 10.1155/2012/879629
    [23] B. Zhu, Z. S. Xu, Some results for dual hesitant fuzzy sets, J. Intell. Fuzzy Syst., 26 (2014), 1657–1668. https://doi.org/10.3233/ifs-130845 doi: 10.3233/ifs-130845
    [24] W. Y. Zeng, Y. Xi, Q. Yin, P. Guo, Weighted dual hesitant fuzzy sets and its application in group decision making, Neurocomputing, 458 (2021), 714–726. https://doi.org/10.1016/j.neucom.2020.07.134 doi: 10.1016/j.neucom.2020.07.134
    [25] Z. S. Xu, W. Zhou, Consensus building with a group of decision makers under the hesitant probabilistic fuzzy environment, Fuzzy Optim. Decis. Making, 16 (2017), 481–503. https://doi.org/10.1007/s10700-016-9257-5 doi: 10.1007/s10700-016-9257-5
    [26] Z. N. Hao, Z. S. Xu, H. Zhao, Z. Su, Probabilistic dual hesitant fuzzy set and its application in risk evaluation, Knowl-Based Syst., 127 (2017), 16–28. https://doi.org/10.1016/j.knosys.2017.02.033 doi: 10.1016/j.knosys.2017.02.033
    [27] R. Wang, Y. L. Li, Picture hesitant fuzzy set and its application to multiple criteria decision-making, Symmetry, 10 (2018), 295. https://doi.org/10.3390/sym10070295 doi: 10.3390/sym10070295
    [28] S. Zhang, Z. S. Xu, Y. He, Operations and integrations of probabilistic hesitant fuzzy information in decision making, Inf. Fusion, 38 (2017), 1–11. https://doi.org/10.1016/j.inffus.2017.02.001 doi: 10.1016/j.inffus.2017.02.001
    [29] C. Y. Song, Z. S. Xu, H. Zhao, A novel comparison of probabilistic hesitant fuzzy elements in multi-criteria decision making, Symmetry, 10 (2018), 177. https://doi.org/10.3390/sym10050177 doi: 10.3390/sym10050177
    [30] Z. X. Wang, J. Li, Correlation coefficients of probabilistic hesitant fuzzy elements and their applications to evaluation of the alternatives, Symmetry, 9 (2017), 259. https://doi.org/10.3390/sym9110259 doi: 10.3390/sym9110259
    [31] C. Y. Song, X. S. Xu, H. Zhao, New correlation coefficients between probabilistic hesitant fuzzy sets and their applications in cluster analysis, Int. J. Fuzzy Syst., 21 (2019), 355–368. https://doi.org/10.1007/s40815-018-0578-0 doi: 10.1007/s40815-018-0578-0
    [32] Z. Su, Z. S. Xu, H. N. Zhao, Z. Hao, B. Chen, Entropy measures for probabilistic hesitant fuzzy information, IEEE Access, 7 (2019), 65714–65727. https://doi.org/10.1109/ACCESS.2019.2916564 doi: 10.1109/ACCESS.2019.2916564
    [33] Y. M. Liu, F. Zhu, L. L. Jin, Multi-attribute decision-making method based on probabilistic hesitant fuzzy entropy, Control Decis., 34 (2019), 861–870.
    [34] B. Farhadinia, U. Aickelin, H. A. Khorshidi, Uncertainty measures for probabilistic hesitant fuzzy sets in multiple criteria decision making, Int. J. Intell. Syst., 35 (2020), 1646–1679. https://doi.org/10.1002/int.22266 doi: 10.1002/int.22266
    [35] B. Zhu, Z. S. Xu, Probability-hesitant fuzzy sets and the representation of preference relations, Technol. Econ. Dev. Econ., 24 (2018), 1029–1040. https://doi.org/10.3846/20294913.2016.1266529 doi: 10.3846/20294913.2016.1266529
    [36] J. Li, Z. X. Wang, Consensus building for probabilistic hesitant fuzzy preference relations with expected additive consistency, Int. J. Fuzzy Syst., 20 (2018), 1495–1510. https://doi.org/10.1007/s40815-018-0451-1 doi: 10.1007/s40815-018-0451-1
    [37] W. Zhou, Z. S. Xu, Group consistency and group decision making under uncertain probabilistic hesitant fuzzy preference environment, Inform. Sci., 414 (2017), 276–288. https://doi.org/10.1016/j.ins.2017.06.004 doi: 10.1016/j.ins.2017.06.004
    [38] J. Li, J. Q. Wang, An extended QUALIFLEX method under probabilistic hesitant fuzzy environment for slecting green suppliers, Int. J. Fuzzy Syst., 19 (2017), 1866–1879. https://doi.org/10.1007/s40815-017-0310-5 doi: 10.1007/s40815-017-0310-5
    [39] W. K. Zhang, J. Du, X. L. Tian, Finding a promising venture capital project with TODIM under probabilistic hesitant fuzzy circumstance, Technol. Econ. Dev. Econ., 24 (2018), 2026–2044. https://doi.org/10.3846/tede.2018.5494 doi: 10.3846/tede.2018.5494
    [40] X. L. Tian, M. L. Niu, J. S. Ma, Z. S. Xu, A novel TODIM with probabilistic hesitant fuzzy information and its application in green supplier selection, Complexity, 2020 (2020), 2540798. https://doi.org/10.1155/2020/2540798 doi: 10.1155/2020/2540798
    [41] H. F. Song, Z. C. Chen, Multi-attribute decision-making method based distance and COPRAS method with probabilistic hesitant fuzzy environment, Int. J. Comp. Int. Syst., 14 (2021), 1229–1241. https://doi.org/10.2991/ijcis.d.210318.001 doi: 10.2991/ijcis.d.210318.001
    [42] Z. Ren, Z. S. Xu, H. M. Wang, An extended TODIM method under probabilistic dual hesitant fuzzy information and its application on enterprise strategic assessment, Proceeding of the 2017 IEEE international conference on industrial engineering and engineering management, 2017, 1464–1468.
    [43] Z. L. Ren, Z. S. Xu, H. Wang, The strategy selection problem on artificial intelligence with an integrated VIKOR and AHP method under probabilistic dual hesitant fuzzy information, IEEE Access, 7 (2019), 103979–103999. https://doi.org/10.1109/ACCESS.2019.2931405 doi: 10.1109/ACCESS.2019.2931405
    [44] H. Garg, G. Kaur, Algorithm for probabilistic dual hesitant fuzzy multi-criteria decision-making based on aggregation operators with new distance measures, Mathematics, 6 (2018), 280. https://doi.org/10.3390/math6120280 doi: 10.3390/math6120280
    [45] H. Garg, G. Kaur, A robust correlation coefficient for probabilistic dual hesitant fuzzy sets and its applications, Neural Comput. Applic., 32 (2020), 8847–8866. https://doi.org/10.1007/s00521-019-04362-y doi: 10.1007/s00521-019-04362-y
    [46] Q. Zhao, Y. B. Ju, W. Pedrycz, A method based on bivariate almost stochastic dominance for multiple criteria group decision making with probabilistic dual hesitant fuzzy information, IEEE Access, 8 (2020), 203769–203786. https://doi.org/10.1109/ACCESS.2020.3035906 doi: 10.1109/ACCESS.2020.3035906
    [47] J. Song, Z. W. Ni, F. F. Jin, P. Li, W. Y. Wu, A new group decision making approach based on incomplete probabilistic dual hesitant fuzzy preference relations, Complex Intell. Syst., 7 (2021), 3033–3049. https://doi.org/10.1007/s40747-021-00497-5 doi: 10.1007/s40747-021-00497-5
    [48] J. Song, Z. W. Ni, F. F. Jin, W. Y. Wu, P. Li, Consensus-based group decision-making methods with probabilistic dual hesitant fuzzy preference relations and their applications, J. Intell. Fuzzy Syst., 41 (2021), 2111–2128. https://doi.org/10.3233/JIFS-210796 doi: 10.3233/JIFS-210796
    [49] S. T. Shao, X. H. Zhang, Multiobjective programming approaches to obtain the priority vectors under uncertain probabilistic dual hesitant fuzzy preference environment, Int. J. Comput. Intell. Syst., 14 (2021), 1189–1207. https://doi.org/10.2991/ijcis.d.210304.001 doi: 10.2991/ijcis.d.210304.001
    [50] K. Ullah, Z. Ali, N. Jan, T. Mahmood, S. Maqsood, Multi-attribute decision making based on averaging aggregation operators for picture hesitant fuzzy sets, Tech. J., 23 (2018), 84–95.
    [51] Y. Yang, J. H. Hu, Y. M. Liu, X. H. Chen, Alternative selection of end-of-life vehicle management in China: A group decision-making approach based on picture hesitant fuzzy measurements, J. Clean. Prod., 206 (2019), 631–645. https://doi.org/10.1016/j.jclepro.2018.09.188 doi: 10.1016/j.jclepro.2018.09.188
    [52] N. Jan, Z. Ali, K. Ullah, T. Mahmood, Some generalized distance and similarity measures for picture hesitant sets and their applications in building material recognition and multi-attribute decision making, Punjab Univ. J. Math., 51 (2019), 51–70.
    [53] Z. Ali, T. Mahmood, Picture hesitant fuzzy generalized dice similarity measures and their application in pattern recognitions, Tech. J., 25 (2020), 73–94.
    [54] T. Mahmood, Z. Ali, The fuzzy cross-entropy for picture hesitant fuzzy sets and their application in multi criteria decision making, Punjab Univ. J. Math., 52 (2020), 55–82.
    [55] T. Mahmood, M. Ahsen, Z. Ali, Multi-attribute group decision-making based on Bonferroni mean operators for picture hesitant fuzzy numbers, Soft Comput., 25 (2021), 1331513351. https://doi.org/10.1007/s00500-021-06172-8 doi: 10.1007/s00500-021-06172-8
    [56] Z. Ali, T. Mahmood, H. AlSalman, B. F. Alkhamees, M. Rahman, Analysis of medical diagnosis based on variation co-efficient similarity measures under picture hesitant fuzzy sets and their application, Math. Biosci. Eng., 19 (2022), 855–872. https://doi.org/10.3934/mbe.2022039 doi: 10.3934/mbe.2022039
    [57] T. Mahmood, Z. Ahmad, Z. Ali, K. Ullah, TOPSIS method and similarity measures based on cosine function using picture hesitant fuzzy sets and its applications to strategic decision making, Fuzzy Inform. Eng., 12 (2020), 277–299. https://doi.org/10.1080/16168658.2020.1866853 doi: 10.1080/16168658.2020.1866853
    [58] R. Ambrin, M. Ibrar, M. Sen, T. Rabbi, A. Khan, Extended TOPSIS method for supplier selection under picture hesitant fuzzy environment using linguistic variables, J. Math., 2021 (2021), 6652586. https://doi.org/10.1155/2021/6652586 doi: 10.1155/2021/6652586
    [59] R. Yager, Prioritized aggregation operators, Int. J. Approx. Reason., 48 (2008), 263–274. https://doi.org/10.1016/j.ijar.2007.08.009 doi: 10.1016/j.ijar.2007.08.009
    [60] Z. S. Xu, On consistency of the weighted geometric mean complex judgement matrix in AHP, Eur. J. Oper. Res., 126 (2000), 683–687. https://doi.org/10.1016/S0377-2217(99)00082-X doi: 10.1016/S0377-2217(99)00082-X
    [61] V. Torra, Y. Narukawa, Modeling decisions: Information fusion and aggregation operators, Berlin: Springer, 2007.
    [62] G. W. Wei, Picture fuzzy aggregation operators and their application to multiple attribute decision making, J. Intell. Fuzzy Syst., 33 (2017), 713–724. https://doi.org/10.3233/JIFS-161798 doi: 10.3233/JIFS-161798
    [63] G. W. Wei, Picture fuzzy cross-entropy for multiple attribute decision making problems, J. Bus. Econ. Manag., 17 (2016), 491–502. https://doi.org/10.3846/16111699.2016.1197147 doi: 10.3846/16111699.2016.1197147
    [64] G. W. Wei, Picture fuzzy Hamacher aggregation operators anf their application to multiple attribute decision making, Fund. Inform., 157 (2018), 271–320. https://doi.org/10.3233/FI-2018-1628 doi: 10.3233/FI-2018-1628
    [65] H. R. Zhang, R. T. Zhang, H. Q. Huang, J. Wang, Some picture fuzzy Dombi Heronian mean operators with their application to multi-attribute decision-making, Symmetry, 10 (2018), 593. https://doi.org/10.3390/sym10110593 doi: 10.3390/sym10110593
    [66] Z. Zhang, Z. L. Li, Y. Gao, Consensus reaching for group decision making with multi-granular unbalanced linguistic information: A bounded confidence and minimum adjustment-based approach, Inf. Fusion, 74 (2021), 96–110. https://doi.org/10.1016/j.inffus.2021.04.006 doi: 10.1016/j.inffus.2021.04.006
    [67] Z. Zhang, Z. L. Li, Consensus-based TOPSIS-Sort-B for multi-criteria sorting in the context of group decision-making, Ann. Oper. Res., 2022. https://doi.org/10.1007/s10479-022-04985-w doi: 10.1007/s10479-022-04985-w
    [68] T. T. Gai, M. S. Cao, F. Chiclana, Z. Zhang, Y. C. Dong, E. Herrera-Viedma, et al., Consensus-trust driven bidirectional feedback mechanism for improving consensus in social network large-group decision making, Group Decis. Negot., 2022. https://doi.org/10.1007/s10726-022-09798-7 doi: 10.1007/s10726-022-09798-7
  • This article has been cited by:

    1. S Padmakala, Saif O. Husain, Ediga Poornima, Papiya Dutta, Mukesh Soni, 2024, Hyperparameter Tuning of Deep Convolutional Neural Network for Hand Gesture Recognition, 979-8-3503-7289-2, 1, 10.1109/NMITCON62075.2024.10698984
    2. REEMA G. AL-ANAZI, ABDULLAH SAAD AL-DOBAIAN, ASMA ABBAS HASSAN, MANAR ALMANEA, AYMAN AHMAD ALGHAMDI, SOMIA A. ASKLANY, HANAN AL SULTAN, JIHEN MAJDOUBI, INTELLIGENT SPEECH RECOGNITION USING FRACTAL AMENDED GRASSHOPPER OPTIMIZATION ALGORITHM WITH DEEP LEARNING APPROACH, 2024, 32, 0218-348X, 10.1142/S0218348X25400298
  • 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(2177) PDF downloads(100) Cited by(6)

Figures and Tables

Tables(9)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog