.png){kind=icon}
.png){kind=icon}
Return
Hierarchical clustering algorithm based on Crystallized neighborhood graph for identifying complex structured datasets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2024.125714.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In data mining, the neighborhood graph is an important method for describing the distribution of datasets. However, existing neighborhood graph methods are often sensitive to parameters settings and the presence of outliers. These traditional neighborhood graphs typically necessitate one or more input parameters, and they may not function optimally when applied to complex datasets that include a substantial number of noise points. To overcome these drawbacks, we have received inspiration from crude salt purification, and propose anon- parameter neighborhood graph method named the Crystallized neighborhood graph (CNG). This method can adaptively capture the distribution structure of complex structured datasets. Based on the CNG, we propose a Hierarchical clustering algorithm based on the Crystallized neighborhood graph for identifying complex structured datasets (HCCNG). It redefines the similarity between sub-graphs using the bridges between sub- graphs and the shortest distance between them. Then, sub-graphs are repeatedly merged according to their similarity until the ideal clustering result is achieved. The experimental results show that the HCCNG algorithm can identify not only popular clusters, but also variable-density spherical clusters. Moreover, it performs well on complex structured datasets with a significant amount of noise.
Keywords:
Clustering
Data mining
Crystallized neighborhood graph
Weight shared natural neighborhood graph
Merging strategy of sub-graphs
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W