Toward terabyte pattern mining: An architecture-conscious solution

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2007, Pages 2-12

  Buehrer, Gregory ^a   Parthasarathy, Srinivasan ^a   Tatikonda, Shirish ^a   Kurc, Tahsin ^a   Saltz, Joel ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Data mining; Itemset mining; Out of core; Parallel

Indexed keywords

CACHE MEMORY; CLUSTER ANALYSIS; DATA STRUCTURES; HIERARCHICAL SYSTEMS; INTERCONNECTION NETWORKS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PATTERN MATCHING;

CLUSTER SYSTEMS; ITEMSET MINING; PATTERN MINING;

DATA MINING;

EID: 34748916970     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1229428.1229432     Document Type: Conference Paper

References (29)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the International Conference on Management of Data (SIGMOD), 1993.
2. R. Agrawal and J. Shafer. Parallel mining of association rules. IEEE Transactions on Knowledge and Data Engineering, 1996.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 1994.
4. R. Agrawal and R. Srikant. Mining sequential patterns. In Proceedings of the International Conference on Data Engineering (ICDE), 1995.
5. 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 (SIGMOD), 1997.
6. G. Buehrer, S. Parthasarathy, and A. Ghoting. Out-of-core frequent pattern mining on a commodity pc. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 86-95, New York, NY, USA, 2006. ACM Press.
7. D. Cheung, J. Han, V. Ng, A. Fu, and Y. Fu. A fast distributed algorithm for mining association rules. In Proceedings of the International Conference on Parallel and Distributed Information Systems (PDIS), pages 31-42, 1996.
8. D. Cheung, K. Hu, and S. Xia. Asynchronous parallel algorithm for mining association rules on shared-memory multiprocessors. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 279-288, 1998.
9. S. Cong, J. Han, J. Hoeflinger, and D. Padua. A samplingbased framework for parallel data mining. In PPoPP '05: Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 255-265, New York, NY, USA, 2005. ACM Press.
10. 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 (SIGKDD), 1999.
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 (VLDB), pages 577-588, 2005.
12. B. Goethals and M. Zaki. Advances in frequent itemset mining implementations. In Proceedings of the ICDM workshop on frequent itemset mining implementations, 2003.
13. E.-H. Han, G. Karypis, and V. Kumar. Scalable parallel data mining for association rules. In SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pages 277-288, New York, NY, USA, 1997. ACM Press.
14. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
15. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the International Conference on Management of Data (SIGMOD), 2000.
16. A. Javed and A. Khokhar. Frequent pattern mining on message passing multiprocessor systems. Distributed and Parallel Databases, 16:1-14, 2004.
17. H. Mannila, H. Toivonen, and A. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1997.
18. M. Otey, C. Wang, S. Parthasarathy, A. Veloso, and W. Meira. Mining frequent itemsets in distributed and dynamic databases. In Proceedings of the International Conference on Data Mining (ICDM), 2003.
19. S. Parthasarathy and S. Dwarkadas. Shared state for distributed interactive data mining applications. Journal of Parallel and Distributed Databases, 2002.
20. S. Parthasarathy, M. Zaki, M. Ogihara, and W. Li. Parallel data mining for association rules on shared-memory systems. Knowledge and Information Systems Journal, 2001.
21. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 1995.
22. A. Schuster and R. Wolff. Communication-efficient distributed mining of association rules. In SIGMOD '01: Proceedings of the 2001 ACM SIGMOD international conference on Management of data, pages 473-484, New York, NY, USA, 2001. ACM Press.
23. A. Schuster, R. Wolff, and D. Trock. A high-performance distributed algorithm for mining association rules. In Proceedings of the International Conference on Data Mining (ICDM), 2003.
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 (VLDB), 1998.
25. H. Toivonen. Sampling large databases for association rules. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 1996.
26. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery discovery of association rules. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD), 1995.
27. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New parallel algorithms for fast discovery of association rules. Data Mining and Knowledge Discovery: An International Journal, 1997.
28. M. J. Zaki. Parallel and distributed association mining: A survey. IEEE Concurrency, 7(4): 14-25, 1999.
29. O. R. Zaane, M. El-Hajj, and P. Lu. Fast parallel association rule mining without candidacy generation.