Top-k correlative graph mining

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 2, Issue , 2009, Pages 1033-1044

  Ke, Yiping ^a   Cheng, James ^b   Yu, Jeffrey Xu ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATION MINING; EFFICIENT ALGORITHM; GRAPH DATA; GRAPH DATABASE; GRAPH MINING; KEY TECHNIQUES; ORDER OF MAGNITUDE; PROJECTED DATABASE; QUERY GRAPH; SEARCH SPACES; SUBGRAPHS;

ALGORITHMS; DATA MINING; DATABASE SYSTEMS; MINING;

GRAPH THEORY;

EID: 72749092433     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. National library of medicine. http: //chem.sis.nlm.nih.gov/ chemidplus.
2. The International Network for Social Network Analysis. http://www.insna.org/.
3. H. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. Bhat, H. Weissig, I. Shindyalov, and P. Bourne. The protein data bank. Nucleic Acids Research, 28:235-242, 2000.
4. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: generalizing association rules to correlations. In SIGMOD, pages 265-276, 1997.
5. B. Bringmann, A. Zimmermann, L. D. Raedt, and S. Nijssen. Don't be afraid of simpler patterns. In PKDD, pages 55-66, 2006.
6. J. Cheng, Y. Ke, and W. Ng. FG-Index: Towards verification-free query processing on graph databses. Proc. of SIGMOD, 2007.
7. S. A. Cook. The complexity of theorem-proving procedures. In Proc. of STOC '71: Proceedings of the third annual ACM symposium on Theory of computing, pages 151-158, 1971.
8. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proc. of ICDM, page 549, 2003.
9. J. Huan, W. Wang, J. Prins, and J. Yang. Spin: mining maximal frequent subgraphs from graph databases. In Proc. of KDD, pages 581-586, 2004.
10. A. Inokuchi, T. Washio, and H. Motoda. An aprioribased algorithm for mining frequent substructures from graph data. In Proc. of PKDD, pages 13-23, 2000.
11. Y. Ke, J. Cheng, and W. Ng. Correlation search in graph databases. In Proc. of KDD, pages 390-399, New York, NY, USA, 2007. ACM.
12. Y. Ke, J. Cheng, and W. Ng. Efficient correlation search from graph databases. To appear in IEEE TKDE, 2008.
13. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. of ICDM, pages 313-320, 2001.
14. S. Ma and J. L. Hellerstein. Mining mutually dependent patterns. In ICDM, pages 409-416, 2001.
15. S. Morishita and J. Sese. Traversing itemset lattice with statistical metric pruning. In Proc. of PODS, pages 226-236, 2000.
16. E. R. Omiecinski. Alternative interest measures for mining associations in databases. IEEE TKDE, 15(1):57-69, 2003.
17. R. T. Paine. Food webs: Linkage, interaction strength and community infrastructure. The Journal of Animal Ecology, 49(3):667-685, 1980.
18. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In Proc. of KDD, pages 653-658, 2004.
19. S. Papadimitriou, J. Sun, and P. S. Yu. Local correlation tracking in time series. In ICDM, pages 456-465, 2006.
20. S. Raghavan and H. Garcia-Molina. Representing Web graphs. In Proc. of ICDE, pages 405-416, 2003.
21. H. Reynolds. The analysis of cross-classifications. The Free Press, New York, 1977.
22. Y. Sakurai, S. Papadimitriou, and C. Faloutsos. Braid: Stream mining through group lag correlations. In SIGMOD Conference, pages 599-610, 2005.
23. R-N. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proc. of KDD, pages 32-41, 2002.
24. L. T. Thomas, S. R. Valluri, and K. Karlapalem. Margin: Maximal frequent subgraph mining. In ICDM, pages 1097-1101, 2006.
25. H. Xiong, M. Brodie, and S. Ma. Top-cop: Mining top-k strongly correlated pairs in large databases. In ICDM, pages 1162-1166, 2006.
26. H. Xiong, S. Shekhar, R-N. Tan, and V. Kumar. TAPER: A two-step approach for all-strong-pairs correlation query in large databases. IEEE TKDE, 18(4):493-508, 2006.
27. H. Xiong, P.-N. Tan, and V. Kumar. Hyperclique pattern discovery. DMKD, 13(2):219-242, 2006.
28. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proc. of ICDM, page 721, 2002.
29. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns. In Proc. of KDD, pages 286-295, 2003.
30. G. U. Yule. On the methods of measuring association between two attributes. Journal of the Royal Statistical Society, 75(6):579-652, 1912.