An Improved Integrated Clustering Learning Strategy Based on Three‐Stage Affinity Propagation Algorithm with Density Peak Optimization Theory

Abstract

To better reflect the precise clustering results of the data samples with different shapes and densities for affinity propagation clustering algorithm (AP), an improved integrated clustering learning strategy based on three-stage affinity propagation algorithm with density peak optimization theory (DPKT-AP) was proposed in this paper. DPKT-AP combined the ideology of integrated clustering with the AP algorithm, by introducing the density peak theory and k-means algorithm to carry on the three-stage clustering process. In the first stage, the clustering center point was selected by density peak clustering. Because the clustering center was surrounded by the nearest neighbor point with lower local density and had a relatively large distance from other points with higher density, it could help the k-means algorithm in the second stage avoiding the local optimal situation. In the second stage, the k-means algorithm was used to cluster the data samples to form several relatively small spherical subgroups, and each of subgroups had a local density maximum point, which is called the center point of the subgroup. In the third stage, DPKT-AP used the AP algorithm to merge and cluster the spherical subgroups. Experiments on UCI data sets and synthetic data sets showed that DPKT-AP improved the clustering performance and accuracy for the algorithm.

Improvement of K-Means Algorithm and Its Application in Air Passenger Grouping

“…For a dataset to be clustered, in many cases, users do not care whether it contains outliers, because the outliers themselves are difficult to define, but they definitely want to assign them cluster labels. Wang et al [ 34 ] proposed an improved integrated clustering learning strategy based on three-stage affinity propagation algorithm with density peak optimization theory (DPKT-AP). In the first stage, the clustering center point was selected by density peak clustering.…”

Hierarchical Unsupervised Partitioning of Large Size Data and Its Application to Hyperspectral Images

“…Furthermore, the damping factor and the preference parameter are fixed by the user. Finally, in [61,62], the AP algorithm was combined with other methods to improve the learning task. For these last two methods, prior knowledge is required for the learning task, the preference parameter is also not adaptive, and the damping factor must also be chosen by the user.…”

K-affinity propagation clustering algorithm for the classification of part-time workers using the internet

“…The number of identified exemplars (clusters) is influenced by the input preferences values, although it also emerges from the message-passing procedure. The sum of r(i, k) and a(i, k) is used to determine whether or not the corresponding data point is a candidate exemplar k [22], [23]. After a data point has been selected, those placed closer to competing candidate exemplar 𝑘 ′ are assigned to this cluster.…”