Parallel leap: Large-scale maximal pattern mining in a distributed environment

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 1, Issue , 2006, Pages 135-142

  El Hajj, Mohammad ^a   Zaïane, Osmar R ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; LARGE SCALE SYSTEMS; PARALLEL PROGRAMMING; PATTERN RECOGNITION;

DATASETS; FREQUENT PATTERNS; MAXIMAL PATTERNS; SEQUENTIAL MINING;

DATA MINING;

EID: 34047199045     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2006.77     Document Type: Conference Paper

References (18)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, pages 207-216, Washington, D.C., May 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases, pages 487-499, Santiago, Chile, September 1994.
3. R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD, 1998.
4. D. Cheung, K. Hu, and S. Xia. Asynchronous parallel algorithm for mining association rules on a shared-memory multi-processors. In Proc. 10th ACM Symp. Parallel Algorithms and Architectures, NY, pages 279-288, 1998.
5. D. W.-L. Cheung, J. Han, V. Ng, A. W.-C. Fu, and Y. Fu. A fast distributed algorithm for mining association rules. In PDIS, pages 31-42, 1996.
6. S. M. Chung and C. Luo. Parallel mining of maximal frequent itemsets from databases. In 15th IEEE International Conference on Tools with Artificial Intelligence, 2003.
7. A. Freitas. Survey of parallel data mining. In Proc. 2nd Int. Conf. on the Practical Applications of Knowledge Discovery and Data Mining, pages 287-300, January 1996.
8. E.-H. Han, G. Karypis, and V. Kumar. Scalable parallel data mining for association rules. In In ACM SIGMOD Conf. Management of Data, 1997.
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM-SIGMOD, Dallas, 2000.
10. IBM_Almaden. Quest synthetic data generation code. http://www.almaden. ibm.com/cs/quest/syndata.html.
11. S.Park, M. Chen, andP. S. Yu. Efficient parallel data mining for association rules. In In ACM Intl. Conf. Infomration and Knowledge Management, 1995.
12. S. Parthasarathy, M. Zaki, M. Ogihara, and W. Li. Parallel data mining for association rules on shared-memory systems, in knowledge and information systems. In Volume 3, Number 1, pages 1-29, 2001.
13. I. Pramudiono and M. Kitsuregawa. Tree structure based parallel frequent pattern mining on pc cluster. In DEXA, pages 537-547, 2003.
14. A. R. and S. J. Parallel mining of association rules. In IEEE Transactions in Knowledge and Data Eng., pages 962-969, 1996.
15. A. Savasere, E. Omiecinski, , and S. Navathe. An efficient algorithm for mining association rules in large databases. In In Proceedings of the 21st International Conference on Very Large Data Bases, pages 432-444, 1995.
16. B. Wilkinson and M. Allen. Parallel programming techniques and applications using networked workstations and parallel computers. In Alan Apt, New Jersy, USA, 1999.
17. O. R. Zaïane and M. El-Hajj. Pattern lattice traversal by selective jumps. In In Proc. 2005 Int'l Conf. on Data Mining and Knowledge Discovery (ACM-SIGKDD), August 2005.
18. O. R. Zaïane, M. El-Hajj, and P. Lu. Fast parallel association rule mining without candidacy generation. In Proc. of the IEEE 2001 International Conference on Data Mining, 2001.