Kernel Methods for Graphs

Mining Graph Data

Volumn , Issue , 2006, Pages 253-282

  Gärtner, Thomas ^a   Horváth, Tamás ^a   Le, Quoc V ^b   Smola, Alex J ^b   Wrobel, Stefan ^a,c  

^a FRAUNHOFER IAIS   (Germany)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

Kernel methods for graphs; Supervised learning problem; Vertex classification

Indexed keywords

EID: 77954874229     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470073049.ch11     Document Type: Chapter

References (41)

1. C. Barrett, R. Jacob, and M. Marathe. Formal-language-constrained path problems. SIAM Journal on Computing, 30(3):809-837, 2000.
2. K. Bennett. Combining support vector and mathematical programming methods for classification. In Advances in Kernel Methods-Support Vector Learning, pp. 307-326, MIT Press, Cambridge, 1998.
3. H. L. Bodlaender. A tourist guide through treewidth. Acta Cybern., 11(1-2):1-22, 1993.
4. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209(1-2):1-45, 1998.
5. C. Borgelt and M. R. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In Proceedings of the 2002 IEEE International Conference on Data Mining. IEEE Computer Society, 2002.
6. B. E. Boser, I. M. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In D. Haussler, ed. Proceedings of the Annual Conference on Computational Learning Theory, pp. 144-152, ACM Press, New York, 1992.
7. M. Deshpande, M. Kuramochi, and G. Karypis. Automated approaches for classifying structures. In Proceedings of the 2nd ACM SIGKDD Workshop on Data Mining and Bioinformatics, 2002.
8. M. Deshpande, M. Kuramochi, and G. Karypis. Frequent sub-structure based approaches for classifying chemical compounds. In Proceedings of the 3rd IEEE International Conference on Data Mining, pp. 35-42. IEEE Computer Society, 2003.
9. R. Fletcher. Practical Methods of Optimization. Wiley, New York, 1989.
10. J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM Journal on Computing, 33(4):892-922, 2004.
11. T. Gärtner. A survey of kernels for structured data. SIGKDD Explorations, 5(1):49-58, July 2003.
12. T. Gärtner. Predictive graph mining with kernel methods. In Advanced Methods for Knowledge Discovery from Complex Data. Springer, Berlin, 2005.
13. T. Gärtner, P. A. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In Proceedings of the 16th Annual Conference on Computational Learning Theory and the 7th Kernel Workshop, 2003.
14. T. Gärtner, Q. V. Le, S. Burton, A. J. Smola, and S. V. N. Vishwanathan. Largescale multiclass transduction. Advances in Neural Information Processing Systems, 18: 411-418, 2006.
15. P. M. Gleiss and P. F. Stadler. Relevant cycles in biopolymers and random graph. In Proceedings of the 4th Slovene International Conference in Graph Theory, 1999.
16. T. Graepel. PAC-Bayesian pattern classification with kernels. Ph.D. thesis, TU Berlin, 2002.
17. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
18. T. Horváth. Cyclic pattern kernels revisited. In Proceedings of Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, Vol. 3518 of LNAI, pp. 791-801. Springer, Berlin, 2005.
19. T. Horváth, T. Gärtner, and S. Wrobel. Cyclic pattern kernels for predictive graph mining. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 158-167, 2004.
20. T. Joachims. Making large-scale SVM learning practical. In B. Schölkopf, C. J. C. Burges, and A. J. Smola, eds. Advances in Kernel Methods-Support Vector Learning, pp. 169-184, MIT Press, Cambridge, MA, 1999.
21. T. Joachims. Learning to Classify Text Using Support Vector Machines: Methods, Theory, and Algorithms. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic, Boston, 2002.
22. M. I. Jordan, Z. Ghahramani, Tommi S. Jaakkola, and L. K. Saul. An introduction to variational methods for graphical models. Machine Learning, 37(2):183-233, 1999.
23. J. Kandola, J. Shawe-Taylor, and N. Cristianini. Learning semantic similarity. In Advances in Neural Information Processing Systems, Vol. 15. MIT Press, Cambridge, MA, 2003.
24. I. R. Kondor and J. D. Lafferty. Diffusion kernels on graphs and other discrete structures. In Proceedings of the 19th International Conference on Machine Learning, pp. 315-312, 2002.
25. S. Kramer, L. De Raedt, and C. Helma. Molecular feature mining in HIV data. In Proceedings and the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 136-143, 2002.
26. S. L. Lauritzen. Graphical Models. Oxford University Press, Oxford, 1996.
27. J. W. Lloyd. Logic for Learning. Springer, Berlin, 2003.
28. M. Plotkin. Mathematical basis of ring-finding algorithms at CIDS. J. Chem. Doc., 11:60-63, 1971.
29. R. C. Read and R. E. Tarjan. Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks, 5(3):237-252, 1975.
30. M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002.
31. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7(3):309-322, 1986.
32. B. Schölkopf and A. J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
33. A. J. Smola and I. R. Kondor. Kernels and regularization on graphs. In B. Schölkopf and M. K. Warmuth, eds. Proceedings of the Annual Conference on Computational Learning Theory, Lecture Notes in Computer Science. Springer, Berlin, 2003.
34. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
35. V. Vapnik. Statistical Learning Theory. Wiley, New York, 1998.
36. S. V. N. Vishwanathan and A. J. Smola. Fast kernels for string and tree matching. In K. Tsuda, B. Schölkopf, and J.P. Vert, eds. Kernels and Bioinformatics, MIT Press, Cambridge, MA, 2004.
37. P. Vismara. Union of all the minimum cycle bases of a graph. Electronic Journal of Combinatorics, 4(1):73-87, 1997.
38. C. K. I. Williams and D. Barber. Bayesian classification with Gaussian processes. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI, 20(12):1342-1351, 1998.
39. M. Zaki. Efficiently mining frequent trees in a forest. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 71-80, ACM Press, New York, 2002.
40. D. Zhou, J. Huang, and B. Schölkopf. Learning from labeled and unlabeled data on a directed graph. In International Conference on Machine Learning, 2005.
41. X. Zhu, J. Lafferty, and Z. Ghahramani. Semi-supervised learning using gaussian fields and harmonic functions. In International Conference on Machine Learning ICML'03, 2003.