TMsDP: two-stage density peak clustering based on multi-strategy optimization

Abstract

PurposeThe density peak clustering algorithm (DP) is proposed to identify cluster centers by two parameters, i.e. ρ value (local density) and δ value (the distance between a point and another point with a higher ρ value). According to the center-identifying principle of the DP, the potential cluster centers should have a higher ρ value and a higher δ value than other points. However, this principle may limit the DP from identifying some categories with multi-centers or the centers in lower-density regions. In addition, the improper assignment strategy of the DP could cause a wrong assignment result for the non-center points. This paper aims to address the aforementioned issues and improve the clustering performance of the DP.Design/methodology/approachFirst, to identify as many potential cluster centers as possible, the authors construct a point-domain by introducing the pinhole imaging strategy to extend the searching range of the potential cluster centers. Second, they design different novel calculation methods for calculating the domain distance, point-domain density and domain similarity. Third, they adopt domain similarity to achieve the domain merging process and optimize the final clustering results.FindingsThe experimental results on analyzing 12 synthetic data sets and 12 real-world data sets show that two-stage density peak clustering based on multi-strategy optimization (TMsDP) outperforms the DP and other state-of-the-art algorithms.Originality/valueThe authors propose a novel DP-based clustering method, i.e. TMsDP, and transform the relationship between points into that between domains to ultimately further optimize the clustering performance of the DP.

Promoting the Integration of Elderly Healthcare and Elderly Nursing: Evidence from the Chinese Government

“…Therefore, we designed the LASS to construct subgroups and proposed the concept of collaboration coverage. Notably, the LASS adopts a clustering idea [ 29 , 30 ] to transform the relationship between the nodes into that between the subgroups [ 29 ], where each node could be selected as a center of a subgroup and each subgroup can be formed by other non-central nodes which all have connections with the selected center node.…”