A New Density Clustering Method Using Mutual Nearest Neighbor

Density-based clustering algorithms have become a popular research topic in recent years. However, most these algorithms have difficulties identifying all clusters with greatly varying densities and arbitrary shapes or have considerable time complexity. To tackle this issue, we propose a novel density assessment method by using mutual nearest neighbor, and then propose a relative density clustering algorithm (RDC). RDC can get the right number of clusters for the datasets, which include varying densities and arbitrary shapes; in addition, the time complexity of it is O(nlog n).