.png){kind=icon}
Return
A Clustering Method Based on Hesitant Difference Granularity
.png){kind=icon}
PRE
AI
DOI：10.1007/978-981-96-8889-0_20.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Real-world datasets are not idealized, which may exhibit irregular and nonlinear patterns in their spatial distribution, and the boundaries between different categories of data points may overlap or even be ambiguous. However, most clustering algorithms are based on Euclidean distance. For nonlinear distributed data, such as interleaved data and high-dimensional data in Euclidean space, similarity cannot be calculated efficiently. In view of KNN's good processing ability for local information and the advantage of granular computing to deal with uncertain information, a hierarchical clustering algorithm based on KNN and granular computing is proposed in this paper. In this method, the neighbor information of the data points is judged by constructing the similarity matrix of hesitant difference granularity, and the similarity between data is redefined by sharing the neighbor. Finally, through comparative analysis, it is proved that the method can identify the interleaved datasets in Euclidean space more accurately and has better robustness.
Keywords:
Clustering
KNN
Hesitant Fuzzy Set
Journal
A
IF:
0
Papers:
41
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
ShareSave
View more