New distances for dual hesitant fuzzy sets and their application in clustering algorithm

Compared to hesitant fuzzy sets and intuitionistic fuzzy sets, dual hesitant fuzzy sets can model problems in the real world more comprehensively. Dual hesitant fuzzy sets explicitly show a set of membership degrees and a set of non-membership degrees, which also imply a set of important data: hesitant degrees. The traditional definition of distance between dual hesitant fuzzy sets only considers membership degree and non-membership degree, but hesitant degree should also be taken into account. To this end, using these three important data sets (membership degree, non-membership degree and hesitant degree), we first propose a variety of new distance measurements (the generalized normalized distance, generalized normalized Hausdorff distance and generalized normalized hybrid distance) for dual hesitant fuzzy sets in this paper, based on which the corresponding similarity measurements can be obtained. In these distance definitions, membership degree, non-membership-degree and hesitant degree are of equal importance. Second, we propose a clustering algorithm by using these distances in dual hesitant fuzzy information system. Finally, a numerical example is used to illustrate the performance and effectiveness of the clustering algorithm. Accordingly, the results of clustering in dual hesitant fuzzy information system are compared using the distance measurements mentioned in the paper, which verifies the utility and advantage of our proposed distances. Our work provides a new way to improve the performance of clustering algorithms in dual hesitant fuzzy information systems.

Automated summary

Compared to hesitant fuzzy sets and intuitionistic fuzzy sets, dual hesitant fuzzy sets can model problems more comprehensively. This paper proposes a variety of new distance measurements and applies them to a clustering algorithm, which demonstrates the effectiveness of the method.