%A ZHANG Yu, LU Yi-hong, HUANG De-cai %T Weighted Hesitant Fuzzy Clustering Based on Density Peaks %0 Journal Article %D 2021 %J Computer Science %R 10.11896/jsjkx.200400043 %P 145-151 %V 48 %N 1 %U {https://www.jsjkx.com/CN/abstract/article_19681.shtml} %8 2021-01-15 %X Due to cognitive limitations and the information uncertainty,traditional fuzzy clustering cannot effectively solve the decision-making problems in a real-life scenario when cluster analysis is carried out on the decision problem.Therefore,hesitant fuzzy sets(HFSs) clustering algorithms were proposed.The conception of hesitant fuzzy sets is evolved from fuzzy sets which are applied to fuzzy linguistic approach.The distance function of the hierarchical hesitant fuzzy K-means clustering algorithm has the same weight since the datasets information is seldom considered,and the computational complexity for computing the cluster center is exponential which is unavailable in the big data environment.In order to solve the above problems,this paper presents a novel clustering algorithm for hesitant fuzzy sets based on density peaks,called WHFDP.Firstly,a new method for extending the short hesitant fuzzy elements set to calculate the distance between two HFSs is proposed and a new formula for calculating the weight of distance function combined with the coefficient of variation is given.In addition,the computational complexity for computing the cluster center is reduced by using density peaks clustering method to select cluster center.Meanwhile,the adaptability to data sets with different sizes and arbitrary shapes is also improved.The time complexity and space complexity of the algorithm are reduced to polynomial level.Finally,typical data sets are used for simulation experiments,which prove the effectiveness of the new algorithm.