Title: Association rules mining in parallel conditional tree based on grid computing inspired partition algorithm

Authors: Chunzhi Wang; Wenshuo Bian; Ruoxi Wang; Hongwei Chen; Zhiwei Ye; Lingyu Yan

Addresses: School of Computer Science, Hubei University of Technology, Wuhan, China ' School of Computer Science, Hubei University of Technology, Wuhan, China ' Wuhan FiberHome Technology Service Co., Ltd., Wuhan, China ' School of Computer Science, Hubei University of Technology, Wuhan, China ' School of Computer Science, Hubei University of Technology, Wuhan, China ' School of Computer Science, Hubei University of Technology, Wuhan, China

Abstract: Association rules have important applications in many fields, however, with the explosive growth of information technology in recent years, the mining efficiency of association rules has become a very serious problem. The parallel multi-swarm PSO frequent pattern (PMSPF) algorithm creatively combines the particle swarm optimisation (PSO) algorithm with the frequent pattern-growth (FP-growth) algorithm to greatly improve the mining efficiency of association rules. However, under the computing environment of the Spark cluster, the calculation load is not balanced. Therefore, large amount of data may lead to problems like memory overflow. In this paper, parallel conditional frequent pattern (PCFP) tree algorithm is proposed on the basis of PMSPF. First of all, through data grouping, the problem of too large a data volume to construct FP-tree is solved. Then, through parallel strategy of the condition tree, parallel computing is implemented. The experimental results show that although PCFP algorithm generates certain data redundancy in the process of data grouping, the efficiency of the algorithm is significantly higher than that of the PMSPF algorithm and traditional parallel frequent pattern (PFP) algorithm.

Keywords: particle swarm optimisation; PSO; parallel strategy; association rules; PCFP.

DOI: 10.1504/IJWGS.2020.109475

International Journal of Web and Grid Services, 2020 Vol.16 No.3, pp.321 - 339

Received: 22 Oct 2019
Accepted: 16 Mar 2020
Published online: 09 Sep 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article