An efficient algorithm for enumerating closed patterns in transaction databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3245, Issue , 2004, Pages 16-31

  Uno, Takeaki ^a   Asai, Tatsuya ^b,c   Uchida, Yuzo ^b   Arimura, Hiroki ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c FUJITSU LABORATORIES LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CLOSED PATTERN; CONDENSED REPRESENTATIONS; DEPTH FIRST; LINEAR TIME; PERFORMANCE COMPARISON; STORAGE SPACES; TRANSACTION DATABASE;

ALGORITHMS;

EID: 35048829395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30214-8_2     Document Type: Article

References (21)

1. R. Agrawal,H. Mannila,R. Srikant,H. Toivonen,A. I. Verkamo, Fast Discovery of Association Rules, In Advances in Knowledge Discovery and Data Mining, MIT Press, 307-328, 1996.
2. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, S. Arikawa, Efficient Substructure Discovery from Large Semi-structured Data, In Proc. SDM'02, SIAM, 2002.
3. T. Asai, H. Arimura, K. Abe, S. Kawasoe, S. Arikawa, Online Algorithms for Mining Semi-structured Data Stream, In Proc. IEEE ICDM'02, 27-34, 2002.
4. T. Asai, H. Arimura, T. Uno, S. Nakano, Discovering Frequent Substructures in Large Unordered Trees, In Proc. DS'03, 47-61, LNAI 2843, 2003.
5. R. J. Bayardo Jr., Efficiently Mining Long Patterns from Databases, In Proc. SIGMOD'98, 85-93, 1998.
6. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, L. Lakhal, Mining Frequent Patterns with Counting Inference, SIGKDD Explr., 2(2), 66-75, Dec. 2000.
7. B. Goethals, the FIMI'03 Homepage, http: //fimi.cs.helsinki.fi/,2003.
8. E. Boros, V. Gurvich, L. Khachiyan, K. Makino, On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets, In Proc. STACS 2002, 133-141, 2002.
9. D. Burdick, M. Calimlim, J. Gehrke, MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases, In Proc. ICDE 2001, 443-452, 2001.
10. J. Han, J. Pei, Y. Yin, Mining Frequent Patterns without Candidate Generation, In Proc. SIGMOD'00, 1-12, 2000
11. R. Kohavi, C. E. Brodley, B. Frasca, L. Mason, Z. Zheng, KDD-Cup 2000 Organizers' Report: Peeling the Onion, SIGKDD Explr., 2(2), 86-98, 2000.
12. H. Mannila, H. Toivonen, Multiple Uses of Frequent Sets and Condensed Representations, In Proc. KDD'96, 189-194, 1996.
13. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Efficient Mining of Association Rules Using Closed Itemset Lattices, Inform. Syst., 24(1), 25-46, 1999.
14. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, In Proc. ICDT'99, 398-416, 1999.
15. J. Pei, J. Han, R. Mao, CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets, In Proc. DMKD'00, 21-30, 2000.
16. R. Rymon, Search Through Systematic Set Enumeration, In Proc. KR-92, 268-275, 1992.
17. P. Tzvetkov, X. Yan, and J. Han, TSP: Mining Top-K Closed Sequential Patterns, In Proc. ICDM'03, 2003.
18. 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. (Available as CEUR Workshop Proc. series, Vol. 90, http://ceur-ws.org/vol- 90)
19. X. Yan and J. Han, CloseGraph: Mining Closed Frequent Graph Patterns, In Proc. KDD'03, ACM, 2003.
20. M. J. Zaki, Scalable Algorithms for Association Mining, Knowledge and Data Engineering, 12(2), 372-390, 2000.
21. M. J. Zaki, C. Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining, In Proc. SDM'02, SIAM, 457-473, 2002.