Time and space efficient discovery of maximal geometric graphs

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

Volumn 4755 LNAI, Issue , 2007, Pages 42-55

  Arimura, Hiroki ^a   Uno, Takeaki ^b   Shimozono, Shinichi ^c  

^a HOKKAIDO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^c KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Closed graph mining; Depth first search; Geometric graphs; Polynomial delay polynomial space enumeration algorithms; Rightmost expansion

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; DATA MINING; DECISION TREES; POLYNOMIALS; TABU SEARCH;

CLOSED GRAPH MINING; DEPTH-FIRST SEARCH; GEOMETRIC GRAPHS; POLYNOMIAL DELAY POLYNOMIAL SPACE ENUMERATION ALGORITHMS; RIGHTMOST EXPANSION;

GRAPH THEORY;

EID: 38149038757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75488-6_6     Document Type: Conference Paper

References (28)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms (1983)
2. Akutsu, T., Tamaki, H., Tokuyama, T.: Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. Discr. & Comp. Geom. 20(3), 307-331 (1998)
3. 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)
4. Arimura, H., Uno, T.: A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, Springer, Heidelberg (2005)
5. Arimura, H., Uno, T.: Effcient algorithms for mining maximal flexible patterns in texts and sequences, TCS-TR-A-06-20, DCS, Hokkaido Univeristy 2006 (submitting)
6. Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proc. SDM'02 (2002)
7. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete App. Math. 65, 21-46 (1996)
8. Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining - An overview. Fundam. Inform. 66(1-2), 161-198 (2005)
9. 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)
10. Garriga, G.C., Khardon, R., De Raedt, L.: On mining closed sets in multi-relational data. In: Proc. IJCAI 2007, pp. 804-809 (2007)
11. Guerra, C.: Vision and image processing algorithms. In: Algorithms and Theory of Computation Handbook, ch. 22, vol. f 22-1-22-23, CRC Press (1999)
12. Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, A.D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 13-23. Springer, Heidelberg (2000)
13. Jain, A.: Fundamentals of Digital Image Processing. Prentice-Hall, Englewood Cliffs (1986)
14. Khardon, R.: Learning function-free horn expressions. Machine Learning 37(3), 241-275 (1999)
15. Kuramochi, M., Karypis, G.: Discovering frequent geometric subgraphs. In: Proc. IEEE ICDM'02, pp. 258-265 (2002)
16. Nakano, S.: Efficient generation of plane trees. Information Processing Letters 84, 167-172 (2002)
17. Nijssen, S., Kok, J.N.: Effcient discovery of frequent unordered trees. In: Proc. MGTS'03 (2003)
18. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398-416. Springer, Heidelberg (1999)
19. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)
20. Termier, A., Rousset, M.-C., Sebag, M.: DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: Proc. ICMD'04 (2004)
21. Tsuda, K., Kudo, T.: Clustering graphs by weighted substructure mining. In: Proc. ICML 2006, pp. 953-960 (2006)
22. 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)
23. Wang, J., Han, J.: BIDE: Efficient Mining of Frequent Closed Sequences. In: Proc. IEEE ICDE'04, pp. 79-90 (2004)
24. Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Explor. 5(1), 59-68 (2003)
25. Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Proc. KDD'03 (2003)
26. Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proc. KDD'04, pp. 344-353 (2004)
27. Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proc. KDD'02, pp. 71-80 (2002)
28. Zaki, M.J., Aggarwal, C.C.: XRules: an effective structural classifier for XML data. In: Proc. KDD'03, pp. 316-325 (2003)