Mining tree queries in a graph

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

Volumn , Issue , 2005, Pages 61-69

  Goethals, Bart ^a   Hoekx, Eveline ^b   Van Bussche, Jan Den ^b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b HASSELT UNIVERSITY   (Belgium)

Author keywords

Canonical form; Conjunctive query; Equivalence checking; Graph; Levelwise; Redundancy checking; SQL; Tree query

Indexed keywords

CANONICAL FORM; CONJUNCTIVE QUERY; EQUIVALENCE CHECKING; REDUNDANCY CHECKING;

ALGORITHMS; DATABASE SYSTEMS; GRAPHIC METHODS; PROTEINS; QUERY LANGUAGES; TREES (MATHEMATICS);

DATA MINING;

EID: 32344438749     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081881     Document Type: Conference Paper

References (29)

1. L. Dehaspe and H. Toivonen. Discovery of frequent Datalog patterns. Data Mining and Knowledge Discovery, 3(1):7-36, 1999.
2. A. Inokuchi, T. Washio, and H. Motoda. An Apriori-based algorithm for mining frequent substructures from graph data. In D.A. Zighed, H.J. Komorowski, and J.M. Zytkow, editors, PKDD, volume 1910 of Lecture Notes in Computer Science, pages 13-23. Springer, 2000.
3. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Cercone et al. [29], pages 313-320.
4. M.J. Zaki, Efficiently mining frequent trees in a forest. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 71-80. ACM Press, 2002.
5. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002) [28], pages 721-724.
6. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), pages 549-552. IEEE Computer Society Press, 2003.
7. D.J. Cook and L.B. Holder. Substructure discovery using minimum description length and background knowledge, Journal of Artificial Intelligence Research, 1:231-255, 1994.
8. N. Vanetik, E. Gudes, and S.E. Shimony. Computing frequent graph patterns from semistructured data. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002) [28], pages 458-465.
9. S. Ghazizadeh and S. Chawathe. SEuS: Structure extraction using summaries. In S. Lange, K. Satoh, and C.H. Smith, editors, Discovery Science, volume 2534 of Lecture Notes in Computer Science, pages 71-85. Springer, 2002.
10. M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. In M.W. Berry, U.Dayal, C.Kamath, and D.B. Skillicorn, editors, Proceedings of the Fourth SIAM International Conference on Data Mining. SIAM, 2004.
11. G. Jeh and J. Widom. Mining the space of graph properties. In W. Kim, R. Kohavi, J. Gehrke, and W. DuMouchel, editors, Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 187-196. ACM Press, 2004.
12. A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proceedings 9th ACM Symposium on the Theory of Computing, pages 77-90. ACM Press, 1977.
13. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
14. Y. Chi, Y. Yang, and R.R. Muntz. Canonical forms for labelled trees and their applications in frequent subtree mining. Knowledge and Information Systems, 2004. Published online, 31 August.
15. H.I. Scions. Placing trees in lexicographic order. In D. Michie, editor, Machine Intelligence 3, pages 43-62. Edinburgh University Press, 1968.
16. G. Li and F. Ruskey. The advantages of forward thinking in generating rooted and free trees. In Proceedings 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 939-940, 1999.
17. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
18. S. Tsur, J.D. Ullman, et al. Query flocks: A generalization of association-rule mining. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, volume 27:2 of SIGMOD Record, pages 1-12. ACM Press, 1998.
19. S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with relational database systems: Alternatives and implications. Data Mining and Knowledge Discovery, 4(2-3):89-125, 2000.
20. S. Chakravarthy, R. Beera, and R. Balachandran. DB-Subdue: Database approach to graph mining. In H. Dai, R. Srikant, and C. Zhang, editors, Advances in Knowledge Discovery and Data Mining, Proceedings 8th PAKDD Conference, volume 3056 of Lecture Notes in Computer Science, pages 341-350. Springer. 2004.
21. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules. In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307-328. MIT Press, 1996.
22. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
23. J. Memmott, N.D. Martinez, and J.E. Cohen. Predators, parasites and pathogens: species richness, trophic generality, and body sizes in a natural food web. Journal of Animal Ecology, 69:1-15, 2000.
24. H. Jeong, S.P. Mason, et al. Lethality and centrality in protein networks. Nature, 411(3 May 2001).
25. M. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
26. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Random graph models for the web graph. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pages 57-65. IEEE Computer Society, 2000.
27. K. Bharat, B.-W. Chang, M. Henzinger, and M. Ruhl. Who links to whom: Mining linkage between Web sites. In Cercone et al. [29], pages 51-58.
28. Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan. IEEE Computer Society Press, 2002.
29. N. Cercone, T.Y. Lin, and X. Wu, editors. Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November - 2 December 2001, San Jose, California, USA. IEEE Computer Society Press, 2001.