McDPC: multi-center density peak clustering

Adaptive Density Spatial Clustering Method Fusing Chameleon Swarm Algorithm

The density-based spatial clustering of application with noise (DBSCAN) algorithm is able to cluster arbitrarily structured datasets. However, the clustering result of this algorithm is exceptionally sensitive to the neighborhood radius (Eps) and noise points, and it is hard to obtain the best result quickly and accurately with it. To solve the above problems, we propose an adaptive DBSCAN method based on the chameleon swarm algorithm (CSA-DBSCAN). First, we take the clustering evaluation index of the DBSCNA algorithm as the objective function and use the chameleon swarm algorithm (CSA) to iteratively optimize the evaluation index value of the DBSCAN algorithm to obtain the best Eps value and clustering result. Then, we introduce the theory of deviation in the data point spatial distance of the nearest neighbor search mechanism to assign the identified noise points, which solves the problem of over-identification of the algorithm noise points. Finally, we construct color image superpixel information to improve the CSA-DBSCAN algorithm's performance regarding image segmentation. The simulation results of synthetic datasets, real-world datasets, and color images show that the CSA-DBSCAN algorithm can quickly find accurate clustering results and segment color images effectively. The CSA-DBSCAN algorithm has certain clustering effectiveness and practicality.

SMMP: A Stable-Membership-Based Auto-Tuning Multi-Peak Clustering Algorithm

Since most existing single-prototype clustering algorithms are unsuitable for complex-shaped clusters, many multi-prototype clustering algorithms have been proposed. Nevertheless, the automatic estimation of the number of clusters and the detection of complex shapes are still challenging, and to solve such problems usually relies on user-specified parameters and may be prohibitively time-consuming. Herein, a stable-membership-based auto-tuning multi-peak clustering algorithm (SMMP) is proposed, which can achieve fast, automatic, and effective multi-prototype clustering without iteration. A dynamic association-transfer method is designed to learn the representativeness of points to sub-cluster centers during the generation of sub-clusters by applying the density peak clustering technique. According to the learned representativeness, a border-link-based connectivity measure is used to achieve high-fidelity similarity evaluation of sub-clusters. Meanwhile, based on the assumption that a reasonable clustering should have a relatively stable membership state upon the change of clustering thresholds, SMMP can automatically identify the number of sub-clusters and clusters, respectively. Also, SMMP is designed for large datasets. Experimental results on both synthetic and real datasets demonstrated the effectiveness of SMMP.

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

The increase of the aging population in China and the rise of the concept of healthy aging have accelerated the transformation and upgrading of the traditional elderly nursing pattern. Nevertheless, there is a critical limitation existing in the current situation of China's elderly care, i.e., the medical institutions do not support elderly nursing and the elderly nursing institutions do not facilitate access to medical care. To eliminate the adverse impact of this issue, twelve ministries and commissions of the Chinese government have jointly issued a document, i.e., the Several Opinions on Further Promoting the Development of Combining the Healthcare with the Elderly care (SOFPDCHE), to provide guidance from the government level for further promoting the integration of elderly healthcare and elderly nursing. Under this background, this paper constructs a healthcare-nursing information collaboration network (HnICN) based on the SOFPDCHE, proposing three novel strategies to explore the different roles and collaboration relationships of relevant government departments and public organizations in this integration process, i.e., the node identification strategy (NIS), the local adjacency subgroup strategy (LASS), and the information collaboration effect measurement strategy (ICEMS). Furthermore, this paper retrieves 484 valid policy documents related to "the integration of elderly healthcare and elderly nursing" as data samples on the official websites of 12 sponsored ministries and commissions, and finally confirms 22 government departments and public organizations as the network nodes based on these obtained documents, such as the National Health Commission of the People's Republic of China (NHC), the Ministry of Industry and Information Technology of the People's Republic of China (MIIT), and the National Working Commission on Aging (NWCA). In terms of the collaboration effect, the results of all node-pairs in the HnICN are significantly different, where the collaboration effect between the NHC and MIIT is best and that between the NATCM and MIIT is second best, which are 84.572% and 20.275%, respectively. This study provides the quantifiable results of the information collaboration degree between different government agencies and forms the optimization scheme for the current collaboration status based on these results, which play a positive role in integrating elderly healthcare and elderly nursing and eventually achieving healthy aging.

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

Purpose

The 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/approach

First, 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.

Findings

The 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/value

The 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.

A novel density deviation multi-peaks automatic clustering algorithm

The density peaks clustering (DPC) algorithm is a classical and widely used clustering method. However, the DPC algorithm requires manual selection of cluster centers, a single way of density calculation, and cannot effectively handle low-density points. To address the above issues, we propose a novel density deviation multi-peaks automatic clustering method (AmDPC) in this paper. Firstly, we propose a new local-density and use the deviation to measure the relationship between data points and the cut-off distance ($$d_c$$ d c ). Secondly, we divide the density deviation into multiple density levels equally and extract the points with higher distances in each density level. Finally, for the multi-peak points with higher distances at low-density levels, we merge them according to the size difference of the density deviation. We finally achieve the overall automatic clustering by processing the low-density points. To verify the performance of the method, we test the synthetic dataset, the real-world dataset, and the Olivetti Face dataset, respectively. The simulation experimental results indicate that the AmDPC method can handle low-density points more effectively and has certain effectiveness and robustness.

Improving Density Peak Clustering by Automatic Peak Selection and Single Linkage Clustering

Density peak clustering (DPC) is a density-based clustering method that has attracted much attention in the academic community. DPC works by first searching density peaks in the dataset, and then assigning each data point to the same cluster as its nearest higher-density point. One problem with DPC is the determination of the density peaks, where poor selection of the density peaks could yield poor clustering results. Another problem with DPC is its cluster assignment strategy, which often makes incorrect cluster assignments for data points that are far from their nearest higher-density points. This study modifies DPC and proposes a new clustering algorithm to resolve the above problems. The proposed algorithm uses the radius of the neighborhood to automatically select a set of the likely density peaks, which are far from their nearest higher-density points. Using the potential density peaks as the density peaks, it then applies DPC to yield the preliminary clustering results. Finally, it uses single-linkage clustering on the preliminary clustering results to reduce the number of clusters, if necessary. The proposed algorithm avoids the cluster assignment problem in DPC because the cluster assignments for the potential density peaks are based on single-linkage clustering, not based on DPC. Our performance study shows that the proposed algorithm outperforms DPC for datasets with irregularly shaped clusters.