On computing condensed frequent pattern bases

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 378-385

  Pei, Jian ^a   Dong, Guozhu ^b   Zou, Wei ^c   Han, Jiawei ^d  

^a UNIVERSITY AT BUFFALO   (United States)

^b WRIGHT STATE UNIVERSITY   (United States)

^c JIANGXI NORMAL UNIVERSITY   (China)

^d UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (15)

1. R.C. Agarwal, C.C. Aggarwal, V. V. V. Prasad. Depth first generation of long patterns. In KDD'00.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94.
3. R. J. Bayardo. Efficiently mining long patterns from databases. In SIGMOD'98.
4. J.-F. Boulicaut, A. Bykowski, C. Rigotti. Approximation of frequency queris by means of free-sets. In PKDD'00.
5. D. Burdick, M. Calimlim, J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In ICDE'01.
6. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In Proc. KDD'99.
7. K. Gouda and M.J. Zaki. Efficiently mining maximal frequent itemsets. In ICDM'01.
8. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD'00.
9. L. V. S. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained frequent set queries with 2-variable constraints. In SIGMOD'99.
10. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In KDD'96.
11. R. Ng, L. V. S. Lakshmanan, J. Han, A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In SIGMOD'98.
12. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal. Discovering frequent closed itemsets for association rules. In ICDT'99.
13. J. Pei, J. Han, L. V. S. Lakshmanan. Mining frequent itemsets with convertible constraints. In ICDE'01.
14. J. Pei, J. Han, R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In DMKD'00.
15. M. Zaki. Generating non-redundant association rules. In KDD'00.