LCM ver.3: Collaboration of array, bitmap and prefix tree for frequent itemset mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 77-86

  Uno, Takeaki ^a   Kiyomi, Masashi ^a   Arimura, Hiroki ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FREQUENT ITEMSET; FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; ITEMSET; PREFIX TREES; TRANSACTION DATABASE;

COMPUTATION THEORY; DATA MINING; DATA STRUCTURES;

TREES (MATHEMATICS);

EID: 77953564323     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133905.1133916     Document Type: Conference Paper

References (16)

1. A. Fiat and S. Shporer, "AIM2: Improved implementation of AIM" In Proc. IEEE ICDM'04 Workshop FIMI'04, 2004.
2. B. Racz, "nonordfp: An FP-growth variation without rebuilding the FP-tree," In Proc. IEEE ICDM'04 Workshop FIMI'04, 2004.
3. R. J. Bayardo Jr., "Efficiently Mining Long Patterns from Databases", In Proc. SIGMOD'98, pp. 85-93, 1998.
4. D. Burdick, M. Calimlim, J. Gehrke, "MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases," In Proc. ICDE 2001, pp. 443-452, 2001.
5. D. Burdick, M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu, "MAFIA: A Performance Study of Mining Maximal Frequent Itemsets," In Proc. IEEE ICDM'03 Workshop FIMI'03, 2003.
6. B. Goethals, the FIMI repository, http://fimi.cs.helsinki.fi/, 2003.
7. G. Grahne and J. Zhu, "Efficiently Using Prefix-trees in Mining Frequent Itemsets," In Proc. IEEE ICDM'03 Workshop FIMI'03, 2003.
8. J. Han, J. Pei, Y. Yin, "Mining Frequent Patterns without Candidate Generation," SIGMOD Conference 2000, pp. 1-12, 2000
9. Guimei Liu, Hongjun Lu, Jeffrey Xu Yu, Wang Wei, and Xiangye Xiao, "AFOPT: An Efficient Implementation of Pattern Growth Approach," In Proc. IEEE ICDM'03 Workshop FIMI'03, 2003.
10. S. Orlando, C. Lucchese, P. Palmerini, R. Perego and F. Silvestri, "kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets," In Proc. IEEE ICDM'03 Workshop FIMI'03, 2003.
11. C. Lucchese, S. Orlando and R. Perego, "DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets," In Proc. IEEE ICDM'04 Workshop FIMI'04, 2004.
12. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Efficient Mining of Association Rules Using Closed Itemset Lattices, Inform. Syst., 24(1), 25-46, 1999.
13. A. Pietracaprina and D. Zandolin, "Mining Frequent Itemsets using Patricia Tries," In Proc. IEEE ICDM'03 Workshop FIMI'03, 2003.
14. T. Uno, T. Asai, Y. Uchida, H. Arimura, "LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets," In Proc. IEEE ICDM'03 Workshop FIMI'03, 2003.
15. T. Uno, T. Asai, Y. Uchida, H. Arimura, "An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases," Lecture Notes in Artificial Intelligence 3245, pp. 16-31, 2004.
16. T. Uno, M. Kiyomi, H. Arimura, "LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets", In Proc. IEEE ICDM'04 Workshop FIMI'04, 2004.