Fast random walk graph kernel

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 828-838

  Kang, U ^a   Tong, Hanghang ^b   Sun, Jimeng ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES;

COMPUTATIONAL COSTS; DATA MINING TASKS; FAST ALGORITHMS; GRAPH KERNELS; RANDOM WALK; RANK STRUCTURE; SIMILARITY COMPUTATION;

DATA MINING;

EID: 84880238353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.71     Document Type: Conference Paper

References (44)

1. D. Achlioptas and F. McSherry. Fast computation of low-rank matrix approximations. J. ACM, 54(2), 2007.
2. A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
3. K. M. Borgwardt and H.-P. Kriegel. Shortest-path kernels on graphs. In ICDM, pages 74-81, 2005.
4. K. M. Borgwardt, H.-P. Kriegel, S. V. N. Vishwanathan, and N. Schraudolph. Graph kernels for disease outcome prediction from protein-protein interaction networks. In Pacific Symposium on Biocomputing, 2007.
5. K. M. Borgwardt, S. V. N. Vishwanathan, and H.- P. Kriegel. Class prediction from time series gene expression pro-les using dynamical systems kernels. In Pacific Symposium on Biocomputing, pages 547-558, 2006.
6. P. Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition. SIAM Journal of Computing, 2005.
7. P. Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix. SIAM J. Comput., 36(1):158-183, 2006.
8. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD, pages 118-127, 2004.
9. T. Gärtner, P. A. Flach, and S. Wrobel. On graph kernels: Hardness results and eficient alternatives. In COLT, pages 129-143, 2003.
10. T. Gärtner, J. W. Lloyd, and P. A. Flach. Kernels and distances for structured data. Machine Learning, 57(3):205-232, 2004.
11. F. Geerts, H. Mannila, and E. Terzi. Relational linkbased ranking. In VLDB, pages 552-563, 2004.
12. G. H. Golub and C. F. Van-Loan. Matrix Computa- Tions. The Johns Hopkins University Press, Baltimore, 2nd edition, 1996.
13. M. Grötschel, C. L. Monma, and M. Stoer. Design of survivable networks. In Handbooks in Operations Research and Management Science 7: Network Models. North Holland, 1993.
14. D. Haussler. Convlution kernels on discrete structures. Technical Report, 1999.
15. S. Hido and H. Kashima. A linear-time graph kernel. In ICDM, pages 179-188, 2009.
16. T. Horváth, T. Gärtner, and S. Wrobel. Cyclic pattern kernels for predictive graph mining. In KDD, pages 158-167, 2004.
17. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In FOCS, pages 189-197, 2000.
18. G. Jeh and J. Widom. Simrank: A measure of structural-context similarity. In KDD, pages 538-543, 2002.
19. K. V. R. Kanth, D. Agrawal, and A. K. Singh. Dimensionality reduction for similarity searching in dynamic databases. In SIGMOD Conference, pages 166-176, 1998.
20. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In ICML, pages 321- 328, 2003.
21. R. I. Kondor, N. Shervashidze, and K. M. Borgwardt. The graphlet spectrum. In ICML, page 67, 2009.
22. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In KDD, pages 245-255, 2006.
23. A. J. Laub. Matrix analysis for scientists and engineers. SIAM, 2004.
24. C. Li, J. Han, G. He, X. Jin, Y. Sun, Y. Yu, and T.Wu. Fast computation of simrank for static and dynamic information networks. In EDBT, pages 465-476, 2010.
25. P. Mahé, N. Ueda, T. Akutsu, J.-L. Perret, and J.-P. Vert. Graph kernels for molecular structureactivity relationship analysis with support vector machines. Journal of Chemical Information and Modeling, 45(4):939-951, 2005.
26. H. Ning, W. Xu, Y. Chi, Y. Gong, and T. S. Huang. Incremental spectral clustering with application to monitoring of evolving blog communities. In SDM, 2007.
27. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004.
28. P. Papadimitriou, A. Dasdan, and H. Garcia-Molina. Web graph similarity for anomaly detection. Journal of Internet Services and Applications, Volume 1(1):19-30, May 2010.
29. W. Piegorsch and G. E. Casella. Inverting a sum of matrices. SIAM Review, 1990.
30. D. Pighin and A. Moschitti. Reverse engineering of tree kernel feature spaces. In EMNLP, pages 111-120, 2009.
31. D. Pighin and A. Moschitti. On reverse feature engineering of syntactic tree kernels. In Proceedings of the Fourteenth Conference on Computational Natural Language Learning, pages 223-233, 2010.
32. L. Ralaivola, S. J. Swamidass, H. Saigo, and P. Baldi. Graph kernels for chemical informatics. Neural Net- works, 18(8):1093-1110, 2005.
33. K. Rieck, T. Krueger, U. Brefeld, and K.-R. Müller. Approximate tree kernels. Journal of Machine Learn- ing Research, 11:555-580, 2010.
34. H. Saigo, M. Hattori, H. Kashima, and K. Tsuda. Reaction graph kernels predict ec numbers of unknown enzymatic reactions in plant secondary metabolism. BMC Bioinformatics, 11(S-1):31, 2010.
35. N. Shervashidze and K. M. Borgwardt. Fast subtree kernels on graphs. Advances in Neural Information Processing Systems, 2009.
36. N. Shervashidze, S. V. N. Vishwanathan, T. Petri, K. Mehlhorn, and K. M. Borgwardt. Eficient graphlet kernels for large graph comparison. Journal of Ma- chine Learning Research-Proceedings Track, 5:488-495, 2009.
37. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: dynamic tensor analysis. In KDD, pages 374-383, 2006.
38. H. Tong, C. Faloutsos, and Y. Koren. Fast directionaware proximity for graph mining. In KDD, pages 747-756, 2007.
39. H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: Fast solutions and applications. Knowledge and Information Systems: An International Journal (KAIS), 2008.
40. H. Tong, S. Papadimitriou, J. Sun, P. S. Yu, and C. Faloutsos. Colibri: fast mining of large static and dynamic graphs. In KDD, pages 686-694, 2008.
41. L. N. Trefethen and D. B. III. Numerical linear algebra. SIAM, 1997.
42. S. V. N. Vishwanathan, K. M. Borgwardt, and N. N. Schraudolph. Fast computation of graph kernels. In NIPS, pages 1449-1456, 2006.
43. S. V. N. Vishwanathan, N. N. Schraudolph, R. I. Kondor, and K. M. Borgwardt. Graph kernels. Journal of Machine Learning Research, 11:1201-1242, 2010.
44. D. Wang, T. Li, and C. H. Q. Ding. Weighted feature subset non-negative matrix factorization and its applications to document understanding. In ICDM, pages 541-550, 2010.