Top-K correlation sub-graph search in graph databases

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

Volumn 5463 LNCS, Issue , 2009, Pages 168-185

  Zou, Lei ^a   Chen, Lei ^b   Lu, Yansheng ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; GRAPH DATABASES;

CORRELATION THRESHOLD; DATABASE AND DATA MINING; INDEXING METHODS; MINING TASKS; PATTERN GROWTH; SEARCH ALGORITHMS; SPEED UP; SUBGRAPHS;

GRAPH ALGORITHMS;

EID: 67650128366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_14     Document Type: Conference Paper

References (20)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB (1994)
2. Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlations. In: SIGMOD (1997)
3. Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community mining from multi-relational networks. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS, vol. 3721, pp. 445-452. Springer, Heidelberg (2005)
4. Fortin, S.: The graph isomorphism problem. Department of Computing Science, University of Alberta (1996)
5. He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE (2006)
6. Ilyas, I.F., Markl, V., Haas, P.J., Brown, P., Aboulnaga, A.: Cords: Automatic discovery of correlations and soft functional dependencies. In: SIGMOD (2004)
7. Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., ?Zytkow, J.M. (eds.) PKDD 2000. LNCS, vol. 1910, pp. 13-23. Springer, Heidelberg (2000)
8. Ke, Y., Cheng, J., Ng, W.: Correlation search in graph databases. In: SIGKDD (2007)
9. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM (2001)
10. Omiecinski, E.: Alternative interest measures for mining associations in databases. IEEE TKDE 15(1) (2003)
11. Pan, J.-Y., Yang, H.-J., Faloutsos, C., Duygulu, P.: Automatic multimedia cross-modal correlation discovery. In: KDD (2004)
12. Petrakis, E.G.M., Faloutsos, C.: Similarity searching in medical image databases. IEEE Transactions on Knowledge and Data Enginnering 9(3) (1997)
13. Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)
14. Willett, P.: Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38(6) (1998)
15. Xiong, H., Brodie, M., Ma, S.: Top-cop: Mining top-k strongly correlated pairs in large databases. In: Perner, P. (ed.) ICDM 2006. LNCS, vol. 4065. Springer, Heidelberg (2006)
16. Xiong, H., Shekhar, S., Tan, P.-N., Kumar, V.: Exploiting a support-based upper bound of pearson's correlation coefficient for efficiently identifying strongly correlated pairs. In: KDD (2004)
17. Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM (2002)
18. Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD (2004)
19. Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases, pp. 766- 777 (2005)
20. Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT (2008)