First IEEE International Conference on Data Mining (ICDM'01) Fast Parallel Association Rule Mining without Candidacy Generation San Jose, California November 29-December 02 ISBN: 0-7695-1119-8
In this paper we introduce a new parallel algorithm MLFPT (Multiple Local Frequent Pattern Tree) [11] for parallel mining of frequent patterns, based on FP-growth mining, that uses only two full I/O scans of the database, eliminating the need for generating the candidate items and distributing the work fairly among processors. We have devised partitioning strategies at different stages of the mining process to achieve near optimal balancing between processors. We have successfully tested our algorithm on datasets larger than 50 million transactions.
Citation:
Osmar R. ZaÏane, Mohammad El-Hajj, Paul Lu, "Fast Parallel Association Rule Mining without Candidacy Generation," icdm, pp.665, First IEEE International Conference on Data Mining (ICDM'01), 2001 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||