DKCDC: A clustering algorithm focusing on genuine boundary search for regional division

Abstract

The majority of existing clustering algorithms, including those algorithms that focus on boundary detection, seldom account for the reasonableness and genuineness of boundaries, consequently, it is difficult to obtain well-defined boundary in clustering-based regional division. A novel boundary search Clustering algorithm integrating Direction Centrality with the Distance of K-nearest-neighbor (DKCDC) is proposed, which is capable of achieving well-defined regional boundaries, to resolve the challenges mentioned above. Firstly, the preliminary boundary of clusters are established on the basis of boundary points and initial cluster labels obtained by the Clustering algorithm using the local Direction Centrality (CDC). Secondly, all the boundary points are further processed and discriminated, to detect noise points concealed within the boundaries, which provides the essential basis for achieving more genuine and reliable cluster boundaries and regional identification. In this process, a fusion strategy is adopted, to subdivide the boundary points into true boundaries and false boundaries by combining voting method and distance metric. Thirdly, a regional division result with well-defined boundary is obtained by DKCDC. In the end, by distinguishing genuine from false boundaries using fusion strategy, DKCDC enhances regional boundary demarcation. Experiments on synthetic and UCI datasets show DKCDC improves silhouette coefficient by at least s4.88% over CDC, K-Means, DBSCAN, OPTICS and HDBSCAN, indicating its broad potential for applications in clustering-based regional division.