Research on parallel association rule mining of big data based on an improved K-means clustering algorithm

In order to overcome the problems of time-consuming, low-precision and redundant rules in association rule mining of big data, a parallel association rule mining method based on an improved K-means clustering algorithm is proposed. Establish a data object criterion function and optimise k-means clustering algorithm. The improved K-means clustering algorithm is used to cluster big data and improve the efficiency of mining association rules. This paper introduces the matter-element theory of extension, combines matter-element theory and database, and constructs the matter-element relation database model of extension to realise the mining of parallel association rules in big data on the basis of extension. Redundant algorithms and equivalent transformations are used to eliminate redundant association rules. The experimental results show that the proposed method has high mining efficiency, high mining accuracy, and high rule association, which proves that the proposed method has better application performance.