Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 2, Issue , 2009, Pages 1081-1092

  Arimura, Hiroki ^a   Uno, Takeaki ^b  

^a HOKKAIDO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED PATTERN; CLOSED SEQUENCES; CLOSED SET; CONVEX HULL; DEPTH-FIRST SEARCH ALGORITHM; INPUT SIZE; MODELING SEMI-STRUCTURED DATA; PATTERN CLASS; SET SYSTEM; SPACE ALGORITHMS; TIME AND SPACE; TREE-LIKE STRUCTURES;

GRAPH THEORY; LEARNING ALGORITHMS; MINING; POLYNOMIALS; SET THEORY;

COMPUTATIONAL EFFICIENCY;

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

References (32)

1. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, S. Arikawa, Efficient substructure discovery from large semi-structured data, Proc. SDM'02, 2002.
2. T. Asai, H. Arimura, T. Uno, S. Nakano, Discovering frequent substructures in large unordered trees Proc. DS'03, LNCS 2843, 47-61, 2003.
3. H. Arimura, Efficient algorithms for mining frequent and closed patterns from semi-structured data (invited talk), Proc. PAKDD'08, LNAI 5012, 2-13, 2008.
4. H. Arimura, T. Uno and S. Shimozono, Time and space efficient discovery of maximal geometric graphs, Proc. DS'07, LNAI 4755, 42-55, 2007.
5. H. Arimura and T. Uno, Mining maximal flexible patterns in a sequence, Proc. LLLL'07, LNAI, 2008.
6. H. Arimura and T. Uno, A Polynomial Space and Polynomial Delay Algorithm for Enumerating Maximal Two-Dimensional Patterns with Wildcards, Technical Report TCS-TR-A-06-19, DCS, Hokkaido U., 2006.
7. H. Arimura and T. Uno, An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence, J. Comb. Optim., 13, 243-262, 2006.
8. D. Avis, K. Fukuda, Reverse search for enumeration, Discrete Applied Mathematics, 65(1-3), 21-46, 1996.
9. M. Boley, T. Horváth, A. Poigné, and S. Wrobel, Efficient closed pattern mining in strongly accessible set systems (Extended Abstract), Proc. PKDD 2007, LNCS 4702, 382-389, 2007.
10. M. Boley, T. Horváth, A. Poigné, and S. Wrobel, Efficient closed pattern mining in strongly accessible set systems, Proc. MLG 2007, 2007.
11. M. de Brecht, M. Kobayashi, H. Tokunaga, A. Yamamoto, Inferability of Closed Set Systems from Positive Data, JSAI 2006, LNCS 4384, 265-275, 2007.
12. G. C. Garriga, R. Khardon, L. De Raedt, On Mining Closed Sets in Multi-Relational Data, Proc. IJCAI 2007, 804-809, 2007.
13. A. Inokuchi, T. Washio, H. Motoda, Complete mining of frequent patterns from graphs: mining graph data, Machine Learning, 50(3), 321-354, 2003.
14. E. Boros, V. Gurvich, L. Khachiyan, K. Makino, On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets, Proc. STACS'02, LNCS 2285, 133-141, 2002.
15. Tamas Horváth, Private communication, Oct. 2008.
16. S. Nijssen, J. N. Kok, Effcient discovery of frequent unordered trees, Proc. MGTS'03, 2003.
17. L. Parida, I. Rigoutsos, A. Floratos, D. Platt, and Y. Gao, Proc. SODA'00, 297-308, SIAM, 2000.
18. N. Pisanti, et al., A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum, Proc. MFCS'03, LNCS 2747, 622-631, 2003.
19. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, 1985.
20. J. Ramon, S. Nijssen, General Graph Refinement with Polynomial Delay, Proc. MLG'07, 2007
21. R. Srikant, R. Agrawal, Mining Sequential Patterns: Generalizations and Performance Improvements, Proc. EDBT'96, LNCS 1057, 3-17, 1996.
22. A. Termier, M.-C. Rousset, M. Sebag, K. Ohara, T. Washio, H. Motoda, DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm, IEEE Trans. Knowl. Data Eng., 20(3), 300-320, 2008.
23. S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all the maximum independent sets. SIAMJ. Comp., 6, 505-517, 1977.
24. J. D. Ullman, A. V. Aho and J. E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
25. T. Uno, T. Asai, Y. Uchida, H. Arimura, An efficient algorithm for enumerating closed patterns in transaction databases, Proc. DS'04, LNAI 3245, 16-30, 2004.
26. T. Uno, M. Kiyomi, H. Arimura, LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets, Proc. the ICDM Workshop FIMI'04, 2004.
27. J. Wang and J. Han, BIDE: efficient mining of frequent closed sequences, Proc. ICDE'04, 2004.
28. X. Yan and J. Han, R. Afshar, CloSpan: mining closed sequential patterns in large databases, Proc. SDM 2003, SIAM, 2003.
29. X. Yan, X. J. Zhou, J. Han, Mining closed relational graphs with connectivity constraints, Proc. KDD'05, 324-333, 2005.
30. G. Yang, The complexity of mining maximal frequent itemsets and maximal frequent patterns, Proc. KDD'04, 344-353, 2004.
31. M. J. Zaki, C.-J. Hsiao, Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure, IEEE Trans. Knowl. Data Eng., 17(4), 462-478, 2005.
32. M. J. Zaki. Efficiently mining frequent trees in a forest, Proc. SIGKDD'02, ACM, 2002.