DWDP-Stream: A Dynamic Weight and Density Peaks Clustering Algorithm for Data Stream

Abstract

Abstract Identifying clusters of arbitrary shapes and constantly processing the newly arrived data points are two critical challenges in the study of clustering. This paper proposes a dynamic weight and density peaks clustering algorithm to simultaneously solve these two key issues. An online–offline framework is used, creating and maintaining micro-clusters in the online phase, and treating the micro-clusters as pseudo-points to form the final cluster in the offline phase. In the online phase, when a new data point is merged into the corresponding micro-cluster, a dynamic weight method is proposed to update the weight of the micro-cluster according to the distance between the point and the center of the micro-cluster, so as to more accurately describe the information of the micro-cluster. In the offline phase, the density peak clustering algorithm is improved, natural neighbors are introduced to adaptively obtain the local density of the data point, and the allocation process is improved to reduce the probability of allocation errors. The algorithm is evaluated on different synthetic and real-world datasets using different quality metrics. The experimental results show that the proposed algorithm improves the clustering quality in both static and streaming environments.

Keywords

• Data stream clustering
• Dynamic weight
• Density-peak clustering
• Natural neighbors