Optimization of frequent itemset mining on multiple-core processor

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 1275-1285

  Liu, Li ^a,b   Li, Eric ^a   Zhang, Yimin ^a   Tang, Zhizhong ^b  

^a INTEL CHINA RESEARCH CENTER   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; LOCKS (FASTENERS); OPTIMIZATION;

DATA MINING TASKS; DIFFERENT DOMAINS; FREQUENT ITEMSET MINING; FREQUENT PATTERN MINING; HARDWARE AND SOFTWARE; MULTI-CORE MACHINES; MULTI-CORE PROCESSOR; MULTI-CORE SYSTEMS;

TREES (MATHEMATICS);

EID: 85011032633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large database. In Proceedings of the International Conference on Management of Data, 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the International Conference on Very Large Data Bases, 1994.
3. R. Agrawal and R. Srikant. Mining sequential patterns. In Proceedings of the International Conference on Data Engineering, 1995.
4. S. Brin, R. Motwani, and C. Silverstein. Beyond market basket: Generalizing association rules to correlations. In Proceedings of the International Conference on Management of Data, 1997.
5. D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: a maximal frequent itemset mining algorithm for transactional databases. In Proceedings of the International Conference on Data Engineering, 2001.
6. D. Callahan, K. Kennedy, A. Porterfield. Software prefetching. In Proceedings of international conference on Architectural Support for Programming Languages and Operating Systems, 1991.
7. D.H. Chen, C.R. Lai, W Hu, W.G. Chen, Y.M. Zhang, W.M. Zheng. Tree partition based parallel frequent pattern mining on shared memory systems. In Proceedings of IPDPS Workshop on Parallel and Distributed Scientific and Engineering, 2006.
8. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, 1999.
9. A. Fiat, S. Shporer. AIM2: Improved implementation of AIM. In Proceedings of ICDM Workshop on Frequent Itemset Mining Implementations, 2004.
10. John W. C. Fu, Janak H. Patel, Bob L. Janssens. Stride directed prefetching in scalar processors. In Proceedings of international symposium on Microarchitecture, 1992.
11. A. Ghoting, G. Buehrer, S. Parthasarathy, D. Kim, A. Nguyen, Y. Chen, and P. Dubey. Cache-conscious Frequent Pattern Mining on a Modern Processor. In Proceedings of the International Conference on Very Large Data Bases, 2005.
12. K. Gouda and M. Zaki. Efficiently mining maximal frequent itemsets. In Proceedings of the International Conference on Data Mining, 2001.
13. G. Grahne, J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. In Proceedings of ICDM Workshop on Frequent Itemset Mining Implementations, 2003.
14. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series dataset. In Proceedings of the International Conference on Data Engineering, 1999.
15. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generations. In Proceedings of the International Conference on Management of Data, 2000.
16. R. Jin, G. Yang, and G. Agrawal. Shared memory paralleli-zation of data mining algorithms: Techniques, programming interface, and performance. IEEE Trans. Knowl. Data Eng, 17, 1 (JAN. 2005), 71-89.
17. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1, 3 (SEP. 1997), 259-289.
18. S. Orlando, P. Palmerini, R. Perego, and F. Silvestri. An efficient parallel and distributed algorithm for counting frequent sets. In VECPAR, 2002.
19. S. Orlando, C. Lucchese, P. Palmerini, R. Perego, F. Silvestri. kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets. In Proceedings of ICDM Workshop on Frequent Itemset Mining Implementations, 2003.
20. I. Pramudiono and M. Kitsuregawa. Tree structure based parallel frequent pattern mining on PC cluster. In Proceedings of the International Conference on Database and Expert System Applications, 2003.
21. J. Park, M. Chen, and P. Yu. An effective hash-based algorithm for mining association rules. In Proceedings of the International Conference on Management of Data, 1995.
22. B. Racz. nonordfp: An FP-growth variation without rebuilding the FP-tree. In Proceedings of ICDM Workshop on Frequent Itemset Mining Implementations, 2004.
23. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large database. In Proceedings of the International Conference on Very Large Data Bases, 1995.
24. C. Silverstein, S. Brin, R. Motwani, and J. Ullman. Scalable techniques for mining causal structures. In Proceedings of the International Conference on Very Large Data Bases, 1998.
25. T. Uno, M. Kiyomi, H. Arimura. LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets. In Proceedings of ICDM Workshop on Frequent Itemset Mining Implementations, 2004
26. O. R. Zaïane, M. El-Hajj, and P. Lu. Fast parallel association rule mining without candidacy generation. In Proceedings of the International Conference on Data Mining, 2001.
27. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, 1997.
28. J. Zhou, J. Cieslewicz, K. Ross, M. Shah. Improving dataset performance on simultaneous multithreading processors. In Proceedings of the International Conference on Very Large Data Bases, 2005