Fast parallel association rule mining without candidacy generation

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 665-668

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

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (13)

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 J. C. Shafer. Parallel mining of association rules: Design, implementation, and experience. IEEE Trans. Knowledge and Data Engineering, 8:962-969, 1996.
3. 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.
4. I. Almaden. Quest synthetic data generation code. http://www.almaden.ibm. com/cs/quest/syndata.html.
5. S. Brin, R. Motwani, J. D. Ullman, and S.Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. 1997 ACM-SIGMOD Int. Conf. Management of Data, pages 255-264, Tucson, Arizona, May 1997.
6. D. Cheung, J. Han, V. Ng, A. Fu, and Y. Fu. A fast distributed algorithm for mining association rules. In Proc. 1996 Int. Conf. Parallel and Distributed Information Systems, pages 31-44, Miami Beach, Florida, Dec. 1996.
7. J. Han and M. Kamber. Data Mining, Concepts and Techniques. Morgan Kaufmann, 2001.
8. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM-SIGMOD, Dallas, 2000.
9. J. Park, M. Chen, and P. Yu. An effective hash-based algorithm for mining association rules. In Proc. 1995 ACM-SIGMOD Int. Conf. Management of Data, pages 175-186, San Jose, CA, May 1995.
10. S. Parthasarathy, M. J. Zaki, and M. Ogihara. Parallel data mining for association rules on shared-memory systems. Knowledge and Information Systems: An International Journal, 3(1):1-29, February 2001.
11. O. R. Zaïane, M. El-Hajj, and P. Lu. Fast parallel association rule mining without candidacy generation. Technical Report TR01-12, Department of Computing Science, University of Alberta, Canada, August 2001. ftp://ftp.cs.ualberta.ca/pub/TechReports/2001/TR01-12/TR01-12.pdf
12. O. R. Zaïane, J. Han, and H. Zhu. Mining recurrent items in multimedia with progressive resolution refinement. In Int. Conf. on Data Engineering (ICDE'2000), pages 461-470, San Diego, CA, February 2000.
13. M. J. Zaki. Parallel and distributed association mining: A survey. IEEE Concurrency, Special Issue on Parallel Mechanisms for Data Mining, 7(4):14-25, December 1999.