A New Density Peak Clustering Algorithm Based on Cluster Fusion Strategy

Abstract

When the density peak clustering algorithm deals with complex datasets and the problem of multiple density peaks in the same cluster, the subjectively selected cluster centers are not accurate enough, and the allocation of non-cluster centers is prone to joint and several errors. To solve the above problems, we propose a new density peak clustering algorithm based on cluster fusion strategy. First, the algorithm screens out the candidate cluster centers by setting two new thresholds to avoid the influence of noise points and outliers. Second, the remaining data points are allocated according to the density peak clustering algorithm to obtain the initial clusters. Third, considering the structural characteristics and spatial distribution of datasets, the new definitions of boundary points, inter-cluster intersection density and intercluster boundary density are provided. To correctly classify the clustering problems with multiple density peaks in the same cluster, a new cluster fusion strategy is proposed, which not only corrects the joint and several errors in the allocation of data points, but also correctly selects the cluster centers. Finally, to test the effectiveness of the proposed clustering algorithm, which is compared with DPC-KNN, DPC, K-means and DBSCAN on nine synthetic datasets and six real datasets. The experimental results demonstrate that the clustering performance of the proposed algorithm outperforms that of other algorithms.INDEX TERMS Clustering; density peaks; candidate cluster center; cluster fusion strategy;

A Density Peaking Clustering Algorithm for Differential Privacy Preservation

“…where d ij is the distance between data points after normalization; d c is the truncation distance, which is the only input parameter, and the truncation percentage is usually set to about 2%. Definition 6 (Center Offset Distance) [15]: The center offset distance δi is the distance closest to sample point i among all the distances between sample point i and other points of higher density, and is calculated as follows.…”

“…Finally, better parameter values and clustering results were obtained. Li et al [15] proposed a density peak clustering algorithm (CFDPC) based on clustering fusion strategy, which solved the problem that data point allocation was prone to joint errors, and selected the clustering center correctly. Ding et al [16] proposed an improved density peak clustering algorithm (IDPCNNMS) based on the natural neighborhood merging strategy, which could adaptively identify the natural neighbor set of each data, obtain its local density, and effectively eliminate the influence of truncation parameters on the final result.…”

Clustering fusion algorithm for selection of historical beam steady-state transmission data in CAFe facility

“…The K-means clustering algorithm is also suitable for selecting and optimizing orbit data. In addition, the results of several independent runs of the same clustering algorithm are appropriately combined to obtain a partition of the data, which can overcome the instability of clustering methods [22]. Therefore, at this stage, we can first use the K-means algorithm to select the eligible samples based on the projections of the beam orbits in the 𝑥-directions and 𝑦-directions, and then the two sets of results can be merged.…”

A Novel Hybrid SBM Clustering Method Based on Fuzzy Time Series

“…Building clustering algorithms for fuzzy time series data considering the impact of multiple-feature factors is worth in-depth research. The density peak clustering algorithm is proposed to deal with the time series data and the experimental results demonstrate that the clustering performance of the proposed clustering algorithm [5]. Aiming at single dimension large sample data, multi-objective optimization algorithm and kernel fuzzy C-means clustering are adopted to realize data fuzzification.…”