PARMA: A parallel randomized algorithm for approximate association rules mining in MapReduce

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 85-94

  Riondato, Matteo ^a   DeBrabant, Justin A ^a   Fonseca, Rodrigo ^a   Upfal, Eli ^a  

^a Brown Univerity   (United States)

Author keywords

association rules; frequent itemsets; MapReduce; sampling

Indexed keywords

ASSOCIATION RULES MINING; CLOSE APPROXIMATION; COMMUNICATION COST; CONFIDENCE LEVELS; DATA REPLICATION; DATA SET SIZE; DATA SETS; ERROR PROBABILITIES; ITEM SETS; MAP-REDUCE; NUMBER OF SAMPLES; PARALLEL COMPUTATIONAL MODELS; RANDOM SAMPLE; RANDOM SAMPLING; RANDOMIZED ALGORITHMS;

ALGORITHMS; ASSOCIATION RULES; COSTS; KNOWLEDGE MANAGEMENT; SAMPLING;

QUALITY CONTROL;

EID: 84871059721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2396776     Document Type: Conference Paper

References (36)

1. R. Agrawal, T. Imieliński, and A. Swami. Mining association rules between sets of items in large databases. SIGMOD '93.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. VLDB '94.
3. Apache Mahout. http://mahout.apache.org/.
4. G. Buehrer, S. Parthasarathy, S. Tatikonda, T. Kurc, and J. Saltz. Toward terabyte pattern mining: an architecture-conscious solution. PPoPP '07.
5. F. Chierichetti, R. Kumar, and A. Tomkins. Max-cover in Map-Reduce. WWW '10.
6. C.-T. Chu, S. K. Kim, Y.-A. Lin, Y. Yu, G. R. Bradski, A. Y. Ng, and K. Olukotun. Map-Reduce for machine learning on multicore. NIPS '06.
7. F. Coenen. http://www.cxc.liv.ac.uk/~frans/KDD/Software/FPgrowth/ fpGrowth.html
8. S. Cong, J. Han, J. Hoeflinger, D. Padua. A sampling-based framework for parallel data mining. PPoPP '05.
9. L. Cristofor. ARTool. http://www.cs.umb.edu/~laur/ARtool/, 2006.
10. J.-D. Cryans, S. Ratté, and R. Champagne. Adaptation of APriori to MapReduce to build a warehouse of relations between named entities across the web. DBKDA '10.
11. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. CACM, 51(1):107-113, 2008.
12. M. El-Hajj and O. Zaiane. Parallel leap: large-scale maximal pattern mining in a distributed environment. ICPADS '06.
13. W. Fang, K. K. Lau, M. Lu, X. Xiao, C. K. Lam, Y. Yang, B. He, Q. Luo, P. V. Sander, and K. Yang. Parallel data mining on graphics processors. Technical Report 07, The Hong Kong University of Science & Technology, 2008.
14. A. Ghoting, P. Kambadur, E. Pednault, and R. Kannan. NIMBLE: a toolkit for the implementation of parallel data mining and machine learning algorithms on MapReduce. KDD '11.
15. M. T. Goodrich, N. Sitchinava, and Q. Zhang. Sorting, searching, and simulation in the MapReduce framework. CoRR, abs/1101.1902, 2011.
16. S. Hammoud. MapReduce Network Enabled Algorithms for Classification Based on Association Rules. PhD thesis, Brunel University, 2011.
17. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. SIGMOD Rec., 29:1-12, May 2000.
18. H. Li, Y. Wang, D. Zhang, M. Zhang, and E. Y. Chang. PFP: Parallel FP-Growth for query recommendation. RecSys '08.
19. L. Li and M. Zhang. The strategy of mining association rule based on cloud computing. BCGIN '11.
20. Y. Li and R. Gopalan. Effective sampling for mining association rules. AI '04.
21. J. Lin and M. Schatz. Design patterns for efficient graph algorithms in MapReduce. MLG '10.
22. L. Liu, E. Li, Y. Zhang, Z. Tang. Optimization of frequent itemset mining on multiple-core processor. VLDB '07.
23. H. Mannila, H. Toivonen, and I. Verkamo. Efficient algorithms for discovering association rules. KDD '94.
24. M. Mitzenmacher and E. Upfal. Probability and computing. Cambridge University Press, 2005.
25. E. Ozkural, B. Ucar, and C. Aykanat. Parallel frequent item set mining with selective item replication. IEEE Trans. on Paral. and Distrib. Sys., 22(10):1632-1640, 2011.
26. S. Parthasarathy. Efficient progressive sampling for association rules. ICDM '02.
27. A. Pietracaprina, G. Pucci, M. Riondato, F. Silvestri, and E. Upfal. Space-round tradeoffs for MapReduce computations. ICS' 12.
28. A. Pietracaprina, M. Riondato, E. Upfal, and F. Vandin. Mining top-K frequent itemsets through progressive sampling. Data Min. and Knowl. Disc, 21:310-326, 2010.
29. M. Riondato and E. Upfal. Efficient discovery of association rules and frequent itemsets through sampling with tight performance guarantees. CoRR, abs/1111.6937v3, 2012.
30. J. Ruoming, Y. Ge, and G. Agrawal. Shared memory parallelization of data mining algorithms: techniques, programming interface, and performance. IEEE Trans. on Knowl. and Data Engin., 17(1):71-89, 2005.
31. N. V. Sahinidis and M. Tawarmalani. BARON 9.0.4: Global Optimization of Mixed-Integer Nonlinear Programs, User's Manual, 2010.
32. H. Toivonen. Sampling large databases for association rules. VLDB '96.
33. X. Y. Yang, Z. Liu, and Y. Fu. MapReduce as a programming model for association rules algorithm on Hadoop. ICIS '10.
34. M. Zaki. Parallel and distributed association mining: a survey. IEEE Concurrency, 7(4):14 -25, 1999.
35. M. Zaki, S. Parthasarathy, W. Li, and M. Ogihara. Evaluation of sampling for data mining of association rules. RIDE '97.
36. L. Zhou, Z. Zhong, J. Chang, J. Li, J. Huang, and S. Feng. Balanced parallel FP-Growth with MapReduce. YC-ICT '10.