
Clustering is an important part of data mining. The existing clustering algorithm failed in the data set with uneven density distribution. In this paper, we propose a novel clustering algorithm relative density-based clustering algorithm for identifying diverse density clusters effectively called IDDC. It can effectively identify clusters in data sets with different densities and can also handle outliers. We first compute relative density for each data point. Then, the density peak points are screened and the initial clusters are obtained according to these peak points. The strategy for assigning the remaining points is to find unallocated points from the perspective of the cluster, which can effectively identify different density. In experiments, we compare the proposed algorithm IDDC with some existing algorithms on synthetic and real-world data sets. The results show that IDDC performs better than those existing algorithms, especially clustering on data set with uneven density distribution.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 17 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
