Fast frequent free tree mining in graph databases

World Wide Web

Volumn 11, Issue 1, 2008, Pages 71-92

  Zhao, Peixiang ^a   Yu, Jeffrey Xu ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Free tree; Graph database; Structural pattern mining

Indexed keywords

FALSE POSITIVES; FREE TREE; GRAPH DATABASES; STRUCTURAL PATTERN MINING; SUBGRAPH ISOMORPHISM PROBLEM;

COMPUTER NETWORKS; DATABASE SYSTEMS; PATTERN RECOGNITION; XML;

GRAPH THEORY;

EID: 38349170441     PISSN: 1386145X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11280-007-0031-z     Document Type: Article

References (27)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of 20th International Conference on Very Large Data Bases (VLDB94), pp. 487-499 (1994)
2. Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston, MA (1974)
3. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the Seventh International Conference on World Wide Web (WWW98), pp. 107-117 (1998)
4. Chakrabarti, S., Dom, B.E., Kumar, S.R., Raghavan, P., Rajagopalan, S., Tomkins, A., Gibson, D., Kleinberg, J.: Mining the web's link structure. Computer 32(8), 60-67 (1999)
5. Chen, Z., Lin, F., Liu, H., Liu, Y., Ma, W.-Y., Wenyin, L.: User intention modeling in web applications using data mining. World Wide Web 5(3), 181-191 (2002)
6. Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM03), Washington, DC, p. 509. IEEE Computer Society, Los Alamitos, CA (2003)
7. Chi, Y., Yang, Y., Muntz, R.R.: Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl. Inf. Syst. 8(2), 203-234 (2005)
8. Cooley, R., Mobasher, B., Srivastava, J.: Web mining: information and pattern discovery on the world wide web. In: Proceedings of the 9th International Conference on Tools with Artificial Intelligence (ICTAI97), Washington, DC, p. 558. IEEE Computer Society, Los Alamitos, CA (1997)
9. Cui, J.-H., Kim, J., Maggiorini, D., Boussetta, K., Gerla, M.: Aggregated multicasta comparative study. Cluster Comput. 8(1), 15-26 (2005)
10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)
11. Han, J., Yan, X., Yu, P.S.: Mining and searching graphs and structures. In: Proceeding of the 22th International Conference on Data Engineering (ICDE06), Philadelphia, PA. IEEE Computer Society Press, Los Alamitos, CA (2006)
12. Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71(1-3), 153-169 (1996)
13. Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM03), Washington, DC, p. 549. IEEE Computer Society, Los Alamitos, CA (2003)
14. Inokuchi, A., Washio, T., Motoda, H.: An a priori-based algorithm for mining frequent substructures from graph data. In: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD00), pp. 13-23. Springer, Berlin Heidelberg New York (2000)
15. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM01), pp. 313-320. IEEE Computer Society, Los Alamitos, CA (2001)
16. Liu, T.-L., Geiger, D.: Approximate tree matching and shape similarity. In: International Conference of Computer Vision (ICCV99), pp. 456-462 (1999)
17. Mckay, B.D.: Nauty user's guide. In: Technical Report TR-CS-90-02, the Department of Computer Science. Australia National University (1990)
18. Rückert, U., Kramer, S.: Frequent free tree discovery in graph data. In: Proceedings of the 2004 ACM symposium on Applied computing (SAC04), pp. 564-570. ACM, New York (2004)
19. Shamir, R., Tsur, D.: Faster subtree isomorphism. In: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS97), Washington, DC, p. 126. IEEE Computer Society, Los Alamitos, CA (1997)
20. Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceedings of the Twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS02), pp. 39-52. ACM, New York (2002)
21. Termier, A., Rousset, M.-C., Sebag, M.: Treefinder: a first step towards XML data mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM02), Washington, DC, p. 450. IEEE Computer Society, Los Alamitos, CA (2002)
22. Ullmann, J.R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 23(1), 31-42 (1976)
23. Valiente, G.: Algorithms on Trees and Graphs. Springer, Berlin Heidleberg New York (2002)
24. Yan, X., Han, J.: gspan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM02), Washington, DC, p. 721. IEEE Computer Society, DC, Los Alamitos, CA (2002)
25. Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD03), pp. 286-295. ACM, New York (2003)
26. Zaki, M.-M.J.: Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans. Knowl. Data Eng. 17(8), 1021-1035 (2005)
27. Zhao, Q., Bhowmick, S.S., Mohania, M., Kambayashi, Y.: Discovering frequently changing structures from historical structural deltas of unordered XML. In: Proceedings of the Thirteenth ACM International Conference on Information and Knowledge Management (CIKM04), pp. 188-197 (2004)