The Community for Technology Leaders
Parallel and Distributed Systems, International Conference on (2006)
Minneapolis, Minnesota
July 12, 2006 to July 15, 2006
ISSN: 1521-9097
ISBN: 0-7695-2612-8
pp: 135-142
Osmar R. Zaiane , University of Alberta Edmonton, Canada
Mohammad El-Hajj , University of Alberta Edmonton, Canada
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets due to their sheer size; not only the extent of the existing patterns, but mainly the magnitude of the search space. Many approaches have been suggested such as sequential mining for maximal patterns or searching for all frequent patterns in parallel. So far, those approaches are still not genuinely effective to mine extremely large datasets. <p>In this work we propose a method that combines both strategies efficiently, i.e. mining in parallel for the set of maximal patterns which, to the best of our knowledge, has never been proposed efficiently before. Using this approach we could mine significantly large datasets; with sizes never reported in the literature before. We are able to effectively discover frequent patterns in a database made of billion transactions using a 32 processors cluster in less than 2 hours.</p>
Osmar R. Zaiane, Mohammad El-Hajj, "Parallel Leap: Large-Scale Maximal Pattern Mining in a Distributed Environment", Parallel and Distributed Systems, International Conference on, vol. 01, no. , pp. 135-142, 2006, doi:10.1109/ICPADS.2006.77
91 ms
(Ver 3.1 (10032016))