Efficiently mining maximal frequent itemsets

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 163-170

  Gouda, Karam ^a   Zaki, Mohammed J ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (11)

1. R. Agrawal, C. Aggarwal, and V. Prasad. Depth First Generation of Long Patterns. In ACM SIGKDD Conf., Aug. 2000.
2. R. Agrawal, et al. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, AAAI Press, 1996.
3. R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD Conf., June 1998.
4. D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: a maximal frequent itemset algorithm for transactional databases. In Intl. Conf. on Data Engineering, Apr. 2001.
5. D. Gunopulos, H. Mannila, and S. Saluja. Discovering all the most specific sentences by randomized algorithms. In Intl. Conf. on Database Theory, Jan. 1997.
6. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM SIGMOD Conf., May 2000.
7. D.-I. Lin and Z. M. Kedem. Pincer-search: A new algorithm for discovering the maximum frequent set. In Intl. Conf. Extending Database Technology, Mar. 1998.
8. D. Yellin. An algorithm for dynamic subset and intersection testing. Theoretical Computer Science, 129:397-406, 1994.
9. M. J. Zaki. Generating non-redundant association rules. In ACM SIGKDD Conf., Aug. 2000.
10. M. J. Zaki and K. Gouda. Fast vertical mining using Diffsets. TR 01-1,CS Dept., RPI, Mar. 2001.
11. M. J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed association rule mining. TR 99-10, CS Dept., RPI, Oct. 1999.