Determining the similarity between datasets by distance/similarity measures is important in most clustering algorithms. Therefore, this paper characterizes two clustering algorithms with improved distance measures. In the similarity matrix clustering algorithm, the mixed correlation coefficient and two probability parameters are suggested into the weighted probabilistic Euclidean distance (WPED) measure, which expresses the randomness and fuzziness of intuitionistic fuzzy sets. Second, based on the characteristics of dynamic time warping (DTW), a DTW-based probabilistic Euclidean distance (PED-DTW) method is introduced. The attribute ordering rule is developed with the help of entropy, which is beneficial for PED-DTW in achieving optimal path matching. Furthermore, a DTW-based intuitionistic fuzzy C-means algorithm is constructed. Finally, we performed experiments using car datasets and 7 UCI datasets. Compared with the existing method, the similarity matrix clustering algorithm is feasible. The DTW-based intuitionistic fuzzy C-means algorithms is compared with six clustering methods on four performance metrics, and the performance of our algorithm is analyzed. Our algorithm performs well on four performance metrics. Experimental results indicate that the clustering algorithms proposed in this paper are practical and outperform their existing counterparts. Also, the proposed algorithm gives good results in image segmentation.
Read full abstract