Efficient algorithms for mining frequent and closed patterns from semi-structured data

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

Volumn 5012 LNAI, Issue , 2008, Pages 2-13

  Arimura, Hiroki ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PATTERN RECOGNITION; POLYNOMIALS; TREES (MATHEMATICS);

PATTERN MINING; PPC-EXTENSION; SEMI-STRUCTURED DATA;

DATA MINING;

EID: 44649137965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68125-0_2     Document Type: Conference Paper

References (34)

1. Abe, K., Kawasoe, S., Asai, T., Arimura, H., Arikawa, S.: Optimized substructure discovery for semi-structured data. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 1-14. Springer, Heidelberg (2002)
2. Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web. Morgan Kaufmann, San Francisco (2000)
3. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, ch. 12, AAAI Press / The MIT Press (1996)
4. Arimura, H., Uno, T.: An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. Special issue on bioinromatics, Journal of Combinatorial Optimization 13, 243-262 (2006)
5. Arimura, H., Uno, T.: An output-polynomial time algorithm for mining frequent closed attribute trees. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 1-19. Springer, Heidelberg (2005)
6. Arimura, H., Uno, T.: A Polynomial Space and Polynomial Delay Algorithm for Enumerating Maximal Two-Dimensional Patterns with Wildcards. Technical Report TCS-TR-A-06-19, Division of Computer Science, Hokkaido Univeristy, July 18 (2006)
7. Arimura, H., Uno, T., Shimozono, S.: Time and Space Efficient Discovery of Maximal Geometric Graphs. In: Comible, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol. 4755, Springer, Heidelberg (2007)
8. Arimura, H., Uno, T.: Mining Maximal Flexible Patterns in a Sequence. In: Proc. 5th Workshop on Learning with Logics and Logics for Learning (LLLL 2007), 25th JSAI 2007. LNCS (LNAI), vol. 4914, Springer, Heidelberg (2008)
9. Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient Substructure Discovery from Large Semi-structured Data. In: Proc. the 2nd SIAM Int'l Conf. on Data Mining (SDM 2002), pp. 158-174 (2002)
10. Asai, T., Arimura, H., Abe, K., Kawasoe, S., Arikawa, S.: Online algorithms for mining semi-structured data stream. In: Proc. ICDM 2002, pp. 27-34 (2002)
11. Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering frequent substructures in large unordered trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, Springer, Heidelberg (2003)
12. Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: Cmtreeminer: Mining both closed and maximal frequent subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, Springer, Heidelberg (2004)
13. Cong, G., Yi, L., Liu, B., Wang, K.: Discovering Frequent Substructures from Hierarchical Semi-structured Data. In: Proc. SIAM SDM (2002)
14. Freund, Y., Schapire, R.E.: A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. J. Comput. Syst. Sci. 55(1), 119-139 (1997)
15. Dehaspe, L., De Raedt, L.: Mining association rules with multiple relations. In: Džeroski, S., Lavrač, N. (eds.) ILP 1997. LNCS, vol. 1297, pp. 125-132. Springer, Heidelberg (1997)
16. Avis, D., Fukuda, K.: Reverse Search for Enumeration. Discrete Applied Mathematics 65(1-3), 21-46 (1996)
17. Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: mining graph data. Machine Learning 50(3), 321-354 (2003)
18. Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: Proc. ICDM 2001 (2001)
19. Kudo, T., Matsumoto, Y.: A Boosting Algorithm for Classification of Semi-Structured Text. In: Proc. of EMNLP, pp. 301-308 (2004)
20. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering Frequent Episode in Sequences. In: Proc. KDD 1995, pp. 210-215 (1995)
21. Miyahara, T., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, pp. 47-52. Springer, Heidelberg (2001)
22. Morinaga, S., Arimura, H., Ikeda, T., Sakao, Y., Akamine, S.: Key Semantics Extraction by Dependency Tree. In: Proc. KDD 2005, pp. 666-671. ACM, New York (2005)
23. Nakano, S.: Efficient generation of plane trees. Information Processing Letters 84, 167-172 (2002)
24. Nakano, S., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 33-45. Springer, Heidelberg (2004)
25. Nestrov, S., Abiteboul, S., Motwani, R.: Extracting Schema from Semistructured Data. In: Proc. SIGKDD 1998, pp. 295-306 (1998)
26. Nijssen, S., Kok, J.N.: Effcient Discovery of Frequent Unordered Trees. In: Proc. the 1st Int'l Workshop on Mining Graphs, Trees and Sequences (MGTS 2003) (September 2003)
27. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Item-sets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398-416. Springer, Heidelberg (1998)
28. Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 622-631. Springer, Heidelberg (2003)
29. Termier, A., Rousset, M.-C., Sebag, M.: TreeFinder: a First Step towards XML Data Mining. In: Proc. IEEE ICDM 2002, pp. 450-457 (2002)
30. Tsuda, K., Kudo, T.: Clustering graphs by weighted substructure mining. In: ICML 2006, pp. 953-960 (2006)
31. Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 16-30. Springer, Heidelberg (2004)
32. Yan, X., Han, J., Afshar, R.: CloSpan: mining closed sequential patterns in large databases. In: Proc. SDM 2003, SIAM, Philadelphia (2003)
33. Wang, J., Han, J.: BIDE: efficient mining of frequent closed sequences. In: Proc. ICDE 2004 (2004)
34. Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proc. SIGKDD 2002, ACM Press, New York (2002)