| Summary: | Clustering is an important technique in data mining and knowledge discovery. Affinity propagation clustering (AP) and density peaks and distance-based clustering (DDC) are two significant clustering algorithms proposed in 2007 and 2014 respectively. The two clustering algorithms have simple and clear design ideas, and are effective in finding meaningful clustering solutions. They have been widely used in various applications successfully. However, a key disadvantage of AP is its high time complexity, which has become a bottleneck when applying AP for large-scale problems. The core idea of DDC is to construct the decision graph based on the local density and the distance of each data point, and then select the cluster centers, but the selection of the cluster centers is relatively subjective, and sometimes it is difficult to determine a suitable number of cluster centers. Here, we propose a two-stage clustering algorithm, called DDAP, to overcome these shortcomings. First, we select a small number of potential exemplars based on the two quantities of each data point in DDC to greatly compress the scale of the similarity matrix. Then we implement message-passing on the incomplete similarity matrix. In experiments, two synthetic datasets, nine publicly available datasets, and a real-world electronic medical records (EMRs) dataset are used to evaluate the proposed method. The results demonstrate that DDAP can achieve comparable clustering performance with the original AP algorithm, while the computational efficiency improves observably.
|
|---|
