On a parallel spark workflow for frequent itemset mining based on array prefix‐tree-Reference-Cited by-同舟云学术

On a parallel spark workflow for frequent itemset mining based on array prefix‐tree

Published:2021-04-25 Issue: Volume: Page:
ISSN:1532-0626
Container-title:Concurrency and Computation: Practice and Experience
language:en
Short-container-title:Concurrency Computat Pract Exper

Author:

Niu Xinzheng¹,Wu Peng¹^ORCID,Wu Chase Q.²,Hou Aiqin³,Qian Mideng¹

Affiliation:

1. School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu Sichuan China

2. Department of Computer Science New Jersey Institute of Technology Newark New Jersey USA

3. School of Information Science and Technology Northwest University Xi'an Shaanxi China

Publisher

Wiley

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/cpe.6313

Reference36 articles.

1. AgrawalR SrikantR. Fast algorithms for mining association rules in large databases. Paper presented at: Proceedings of the International Conference on Very Large Data Bases;Santiago de Chile Chile; 1994:487‐499.

2. WuH LuZ PanL XuR JiangW. An improved apriori‐based algorithm for association rules mining. Paper presented at: Proceedings of the 2009 6th International Conference on Fuzzy Systems and Knowledge Discovery; Tianjin China; vol. 2;2009:51‐55;IEEE.

3. Improving efficiency of apriori algorithm using transaction reduction;Singh J;Int J Sci Res Public,2013

4. Implementing improved algorithm over APRIORI data mining association rule algorithm 1;Rao S;IJCST,2012

5. Research of an Improved Apriori Algorithm in Data Mining Association Rules