Determining the appropriate number of nodes for fast mining of frequent patterns in distributed computing environments-Reference-Cited by-同舟云学术

Determining the appropriate number of nodes for fast mining of frequent patterns in distributed computing environments

Published:2014-06-27 Issue:5 Volume:30 Page:380-392
ISSN:1744-5760
Container-title:International Journal of Parallel, Emergent and Distributed Systems
language:en
Short-container-title:International Journal of Parallel, Emergent and Distributed Systems

Author:

Lin Wei-Tee,Chu Chih-Ping

Publisher

Informa UK Limited

Subject

Computer Networks and Communications,Software

Link

http://www.tandfonline.com/doi/pdf/10.1080/17445760.2014.927470

Reference34 articles.

1. Agrawal R, Srikant R. Fast algorithms for mining association rules. Proceedings of the 20th international conference on very large data bases. Santiago de Chile (Chile): Morgan Kaufmann; 1994. p. 487–499.

2. Grid implementation of the Apriori algorithm

3. Parallel mining of association rules

4. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

5. Sharma K, Shrivastava G, Kumar V. Web mining: today and tomorrow. Proceedings of the 3rd international conference on electronics computer technology. Kanyakumari (India): IEEE; 2011. p. 399–403.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Distributed Algorithm for Fast Mining Frequent Patterns in Limited and Varying Network Bandwidth Environments;Applied Sciences;2019-05-06

2. Mining of productive periodic-frequent patterns for IoT data analytics;Future Generation Computer Systems;2018-11

3. A fast and low idle time method for mining frequent patterns in distributed and many-task computing environments;Distributed and Parallel Databases;2018-03-26