A pattern decomposition (PD) algorithm for finding all frequent patterns in large datasets

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 673-674

  Zou, Qinghua ^a   Chu, Wesley ^a   Johnson, David ^a   Chiu, Henry ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (8)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94, pp. 487-499.
2. R. J. Bayardo. Efficiently mining long patterns from databases. In SIGMOD'98, pp. 85-93.
3. Zaki, M. J.; Parthasarathy, S.; Ogihara, M.; and Li, W. 1997. New Algorithms for Fast Discovery of Association Rules. In Proc. of the Third Int'l Conf. on Knowledge Discovery in Databases and Data Mining, pp. 283-286.
4. Lin, D.-I and Kedem, Z. M. 1998. Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. In Proc. of the Sixth European Conf. on Extending Database Technology.
5. Park, J. S.; Chen, M.-S.; and Yu, P. S. 1996. An Effective Hash Based Algorithm for Mining Association Rules. In Proc. of the 1995 ACM-SIGMOD Conf. on Management of Data, pp. 175-186.
6. Brin, S.; Motwani, R.; Ullman, J.; and Tsur, S. 1997. Dynamic Itemset Counting and Implication Rules for Market Basket Data. In Proc. of the 1997 ACM-SIGMOD Conf. On Management of Data, 255-264.
7. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data, Dallas, TX, May 2000.
8. Q. Zou, H. Chiu, W. W. Chu, D. Johnson. Pattern Decomposition Algorithm for Data Mining Frequent Patterns. Journal of Knowledge and Information Systems, 2002 (to appear).