A Storm-Based Parallel Clustering Algorithm of Streaming Data

摘要

Aiming at solving the shortcomings of traditional Single-Pass clustering algorithms, such as low accuracy and large amount of computation, a novel Storm-based parallel Single-Pass clustering algorithm is proposed to discovery of hot events in the food field. In order to solve the problem of data inconsistency in parallel computing, a method of dynamically acquiring cluster increments and random delays is adopted to improve the Single-Pass algorithm. In order to validate the performance of the proposed method, a case study of news events classification is carried out. Simulation results show that the proposed algorithm can effectively improve the cluster repetition in clustering results and greatly improve the accuracy and efficiency of clustering compared with the traditional Single-Pass algorithm.