Kernels for Structured Data

Kernels for Structured Data

Volumn , Issue , 2008, Pages 1-197

  Gärtner, Thomas ^a  

^a FRAUNHOFER IAIS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85131997221     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/6855     Document Type: Book

References (186)

1. Aldea, E., Atif, J. and Bloch, I. (2007a). Image classification using marginalized kernels for graphs, in Graph Based Representation for Pattern Recognition, pp. 103–113.
2. Aldea, E., Fouquier, G., Atif, J. and Bloch, I. (2007b). Kernel fusion for image classification using fuzzy structural information, in Advances in Visual Computing, pp. II: 307–317.
3. Alt, H., Fuchs, U. and Kriegel, K. (1999). On the number of simple cycles in planar graphs, Combinatorics, Probability & Computing 8, 5, pp. 397–405.
4. Andrews, S., Tsochantaridis, I. and Hofmann, T. (2003). Support vector machines for multiple-instance learning, in Advances in Neural Information Processing Systems, Vol. 15 (MIT Press).
5. Aronszajn, N. (1950). Theory of reproducing kernels, Transactions of the American Mathematical Society 68.
6. Asai, T., Arimura, H., Uno, T. and Nakano, S. (2003). Discovering frequent substructures in large unordered trees, in ICDS: International Conference on Data Discovery, DS (LNCS).
7. Auer, P. (1997). On learning from multi-instance examples: Empirical evalutaion of a theoretical approach, in Proceedings of the 14th International Conference on Machine Learning (Morgan Kaufmann), pp. 21–29.
8. Auer, P., Long, P. and Srinivasan, A. (1997). Approximating hyper-rectangles: learning and pseudo-random sets, in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (ACM Press), pp. 314–323.
9. Baldi, P. and Ralaivola, L. (2004). Graph kernels for molecular classification and prediction of mutagenicity, toxicity, and anti-cancer activity, Presentated at the Computational Biology Workshop of NIPS.
10. Barnett, S. (1979). Matrix Methods for Engineers and Scientists (MacGraw-Hill).
11. Bennett, K. and Campbell, C. (2000). Support vector machines: Hype or hallelujah? SIGKDD Explorations 2, 2.
12. Blaschko, M. B. and Hofmann, T. (2006). Conformal multi-instance kernels, in NIPS 2006 Workshop on Learning to Compare Examples.
13. Blockeel, H. and De Raedt, L. (1998). Top-down induction of first order logical decision trees, Artificial Intelligence 101, 1-2, pp. 285–297.
14. Blum, A. and Kalai, A. (1998). A note on learning from multiple-instance examples, Machine Learning 30, 1, pp. 23–29.
15. Borgelt, C. and Berthold, M. R. (2002). Mining molecular fragments: Finding relevant substructures of molecules, in Proc. of the 2002 IEEE International Conference on Data Mining (IEEE Computer Society).
16. Borgwardt, K., Böttger, S. and Kriegel, H. P. (2006a). Vgm: visual graph mining, in Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pp. 733–735.
17. Borgwardt, K. M. and Kriegel, H. P. (2005). Shortest-path kernels on graphs, in Int. Conf on Data Mining, 0, Vol. 7481.
18. Borgwardt, K. M., Kriegel, H.-P., Vishwanathan, S. V. N. and Schraudolph, N. (2006b). Graph kernels for disease outcome prediction from protein-protein interaction networks, in Biocomputing 2007-Proceedings of the Pacific Symposium.
19. Borgwardt, K. M., Ong, C. S., Schonauer, S., Vishwanathan, S. V. N., Smola, A. J. and Kriegel, H. P. (2005). Protein function prediction via graph kernels, Bioinformatics 21, pp. i47–i56.
20. Borgwardt, K. M., Petri, T., Vishwanathan, S. V. N. and Kriegel, H.-P. (2007). An efficient sampling scheme for comparison of large graphs, in P. Frasconi, K. Kersting and K. Tsuda (eds.), Mining and Learning with Graphs, MLG 2007, Firence, Italy, August 1-3, 2007, Proceedings.
21. Boser, B. E., Guyon, I. M. and Vapnik, V. N. (1992). A training algorithm for optimal margin classifiers, in D. Haussler (ed.), Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory (ACM Press), ISBN 0-89791-498-8, pp. 144–152.
22. Bunescu, R. C. and Mooney, R. J. (2007). Multiple instance learning for sparse positive bags, in Proceedings of the 24th international conference on Machine learning, pp. 105–112.
23. Bunke, H. and Allerman, G. (1983). Inexact graph matching for structural pattern recognition, Pattern Recognition Letters 4.
24. Bunke, H. and Riesen, K. (2007). A family of novel graph kernels for structural pattern recognition, in Iberoamerican Congress on Pattern Recognition, pp. 20–31.
25. Cantor, G. (1895). Beiträge zur Begründung der transfiniten Mengelehre, Math-ematische Annalen XLVI.
26. Cherkassky, V. and Mulier, F. (1998). Learning from Data — Concepts, Theory and Methods (John Wiley & Sons, New York).
27. Chevaleyre, Y. and Zucker, J.-D. (2001). A framework for learning rules from multiple instance data, in L. De Raedt and P. Flach (eds.), Proceedings of the 12th European Conference on Machine Learning (Springer-Verlag).
28. Collins, M. and Duffy, N. (2002). Convolution kernels for natural language, in T. G. Dietterich, S. Becker and Z. Ghahramani (eds.), Advances in Neural Information Processing Systems, Vol. 14 (MIT Press).
29. Cristianini, N. and Shawe-Taylor, J. (2000). An Introduction to Support Vector Machines (and Other Kernel-Based Learning Methods). (Cambridge University Press).
30. Cumby, C. and Roth, D. (2003). On kernel methods for relational learning, in Proceedings of ICML03.
31. De Raedt, L. and Van Laer, W. (1995). Inductive constraint logic, in K. Jantke, T. Shinohara and T. Zeugmann (eds.), Proceedings of the 6th International Workshop on Algorithmic Learning Theory, LNAI, Vol. 997 (Springer Ver-lag), ISBN 3-540-60454-5, pp. 80–94.
32. Deshpande, M., Kuramochi, M. and Karypis, G. (2002). Automated approaches for classifying structures, in Proceedings of the 2nd ACM SIGKDD Workshop on Data Mining in Bioinformatics.
33. Deshpande, M., Kuramochi, M. and Karypis, G. (2003). Frequent sub-structure based approaches for classifying chemical compounds, in Proc. of the 2003 IEEE International Conference on Data Mining (IEEE Computer Society).
34. Diestel, R. (2000). Graph Theory (Springer-Verlag).
35. Dietterich, T. G., Lathrop, R. H. and Lozano-Pérez, T. (1997). Solving the multiple instance problem with axis-parallel rectangles, Artificial Intelligence 89, 1–2, pp. 31–71.
36. Driessens, K. (2004). Relational Reinforcement Learning, Ph.D. thesis, K. U. Leuven.
37. Driessens, K. and Džeroski, S. (2002). Integrating experimentation and guidance in relational reinforcement learning, in C. Sammut and A. Hoffmann (eds.), Proceedings of the Nineteenth International Conference on Machine Learning (Morgan Kaufmann Publishers, Inc), pp. 115–122, URL http://www.cs.kuleuven.ac.be/cgi-bin-dtai/publ\_info.pl?id=38%637.
38. Driessens, K. and Ramon, J. (2003). Relational instance based regression for relational reinforcement learning, in Proceedings of the 20th International Conference on Machine Learning (to be published).
39. Driessens, K., Ramon, J. and Blockeel, H. (2001). Speeding up relational reinforcement learning through the use of an incremental first order decision tree learner, in L. De Raedt and P. Flach (eds.), Proceedings of the 13th European Conference on Machine Learning, Lecture Notes in Artificial Intelligence, Vol. 2167 (Springer-Verlag), pp. 97–108.
40. Durbin, R., Eddy, S., Krogh, A. and Mitchison, G. (1998). Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. (Cambridge University Press).
41. Džeroski, S., De Raedt, L. and Blockeel, H. (1998a). Relational reinforcement learning, in Proceedings of the 15th International Conference on Machine Learning (Morgan Kaufmann), pp. 136–143.
42. 13 C NMR spectra with inductive logic programming, Applied Artificial Intelligence 12, 5, pp. 363–383, special Issue on First-Order Knowledge Discovery in Databases.
43. Eckert, H. and Bajorath, J. (2007). Molecular similarity analysis in virtual screening: foundations, limitations and novel approaches, Drug discovery today 12, pp. 225–33, pMID: 17331887.
44. Eiter, T. and Mannila, H. (1997). Distance measures for point sets and their computation, Acta Informatica 34.
45. Emde, W. and Wettschereck, D. (1996). Relational instance-based learning, in Proceedings of the 13th International Conference on Machine Learning (Morgan Kaufmann), pp. 122–130.
46. Faulon, J. L., Misra, M., Martin, S., Sale, K. and Sapra, R. (2008). Genome scale enzyme metabolite and drug target interaction predictions using the signature molecular descriptor, Bioinformatics 24, p. 225.
47. Fayyad, U., Haussler, D. and Stolorz, P. (1996). Mining scientific data, Communications of the ACM 39, 11, pp. 51–57.
48. Fischer, R. A. and Fischer, M. J. (1974). The string-to-string correction problem, Journal of the Association for Computing Machinery 21, 1.
49. Flach, P. A. (2003). The geometry of ROC space: understanding machine learning metrics through ROC isometrics, in Proc. 20th International Conference on Machine Learning (AAAI Press).
50. Flach, P. A. and Lachiche, N. (2004). Naïve bayesian classification of structured data, Machine Learning Submitted.
51. Florencio, C. C. (2007). Unsupervised learning of graph languages using kernels: New results, in LNVD.
52. Forbes, J. and Andre, D. (2002). Representations for learning control policies, in E. de Jong and T. Oates (eds.), Proceedings of the ICML-2002 Workshop on Development of Representations (The University of New South Wales, Sydney), pp. 7–14.
53. Frohlich, H., Wegner, J. K., Sieker, F. and Zell, A. (2005). Optimal assignment kernels for attributed molecular graphs, pp. 225–232.
54. Fung, G. and Mangasarian, O. L. (2001). Proximal support vector machines, in Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM).
55. Fürer, M. (1995). Graph isomorphism testing without numberics for graphs of bounded eigenvalue multiplicity, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms.
56. Gärtner, T., Flach, P. A., Kowalczyk, A. and Smola, A. J. (2002a). Multi-instance kernels, in Proceedings of the 19th International Conference on Machine Learning (Morgan Kaufmann).
57. Gärtner, T., Lloyd, J. W. and Flach, P. A. (2002b). Kernels for structured data, in Proceedings of the 12th International Conference on Inductive Logic Programming (Springer-Verlag).
58. Gauss, C. F. (1880). Theoria combinationis observationum erroribus minimis obnoxiae, pars prior, in Werke, IV (Königlichen Gesellschaft der Wis-senschaften zu Göttingen), pp. 1–26, first published in 1821.
59. Geppert, H., Horváth, T., Gärtner, T., Wrobel, S. and Bajorath, J. (2008). Support-vector-machine-based ranking significantly improves the effectiveness of similarity searching using 2d fingerprints and multiple reference compounds, Journal of Chemical Information and Modeling.
60. Gower, J. C. (1971). A general coefficient of similarity and some of its properties, Biometrics 27, pp. 857–871.
61. Graepel, T. (2002). PAC-Bayesian Pattern Classification with Kernels, Ph.D. thesis, TU Berlin.
62. Graettinger, T. (1999). Digging up dollars with data mining, The Data Administration Newsletter 10.
63. Gray, R. M. (1987). Probability, Random Processes, and Ergodic Properties (Springer-Verlag).
64. Harchaoui, Z. and Bach, F. (2007). Image classification with segmentation graph kernels, in IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR).
65. Haussler, D. (1999). Convolution kernels on discrete structures, Tech. rep., Department of Computer Science, University of California at Santa Cruz.
66. Horváth, T. (2005). Cyclic pattern kernels revisited, in Proc. of Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, LNAI, Vol. 3518 (Springer Verlag), pp. 791–801.
67. Imrich, W. and Klavžar, S. (2000). Product Graphs: Structure and Recognition (John Wiley).
68. Jaakkola, T. S., Diekhans, M. and Haussler, D. (2000). A discriminative framework for detecting remote protein homologies, Journal of Computational Biology 7, 1, 2.
69. Jaakkola, T. S. and Haussler, D. (1999a). Exploiting generative models in discriminative classifiers, in Advances in Neural Information Processing Systems, Vol. 10.
70. Jaakkola, T. S. and Haussler, D. (1999b). Probabilistic kernel regression models, in Proceedings of the 1999 Conference on AI and Statistics.
71. Jacob, L., de Paris, E. M. and Vert, J. P. (2007). Kernel methods for in silico chemogenomics, eprint arXiv: 0709.3931.
72. Jain, B. J., Geibel, P. and Wysotzki, F. (2004). Combining recurrent neural networks and support vector machines for structural pattern recognition, in KI 2004: 27th Annual German Conference on AI, KI 2004, Ulm, Germany, September 20-24, 2004: Proceedings.
73. Jain, B. J., Geibel, P. and Wysotzki, F. (2005). Svm learning with the schur–hadamard inner product for graphs, Neurocomputing 64, pp. 93–105.
74. Joachims, T. (1999). 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 (MIT Press).
75. Joachims, T. (2002). Learning to Classify Text using Support Vector Machines (Kluwer Academic Publishers).
76. Jones, S. P. and Hughes, J. (eds.) (1998). Haskell98: A Non-Strict Purely Functional Language, URL http://haskell.org/.
77. Jorissen, R. N. and Gilson, M. K. (2005). Virtual screening of molecular databases using a support vector machine, Journal of Chemical Information and Modeling 45, 3, pp. 549–561.
78. Kaelbling, L., Littman, M. and Moore, A. (1996). Reinforcement learning: A survey. Journal of Artificial Intelligence Research 4, pp. 237–285.
79. Kandola, J., Shawe-Taylor, J. and Christianini, N. (2003). Learning semantic similarity, in S. Becker, S. Thrun and K. Obermayer (eds.), Advances in Neural Information Processing Systems, Vol. 15 (MIT Press).
80. Karchin, R., Karplus, K. and Haussler, D. (2002). Classifying g-protein coupled receptors with support vector machines, Bioinformatics 18, 1, pp. 147–159.
81. Kashima, H. and Koyanagi, T. (2002). Kernels for semi-structured data, in C. Sammut and A. Hoffmann (eds.), Proceedings of the 19th International Conference on Machine Learning (Morgan Kaufmann).
82. Kashima, H., Tsuda, K. and Inokuchi, A. (2003). Marginalized kernels between labeled graphs, in T. Fawcett and N. Mishra (eds.), Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), August 21-24, 2003, Washington, DC, USA (AAAI Press), pp. 321–328.
83. Keeler, J. D., Rumelhart, D. E. and Leow, W.-K. (1991). Integrated segmentation and recognition of hand-printed numerals, in R. Lippmann, J. Moody and D. Touretzky (eds.), Advances in Neural Information Processing Systems, Vol. 3 (Morgan Kaufmann), pp. 557–563.
84. Khardon, R., Roth, D. and Servedio, R. (2002). Efficiency versus convergence of boolean kernels for on-line learning algorithms, in T. Dietterich, S. Becker and Z. Ghahramani (eds.), Advances in Neural Information Processing Systems, Vol. 14 (MIT Press).
85. King, R. D., Srinivasan, A. and Sternberg, M. J. E. (1995). Relating chemical activity to structure: an examination of ilp successes, New Gen. Comput..
86. Klebe, G. (2006). Virtual ligand screening: strategies, perspectives and limitations, Drug discovery today 11, pp. 580–94, pMID: 16793526.
87. Knobbe, A., Siebes, A. and Marseille, B. (2002). Involving Aggregate Functions in Multi-relational Search, pp. 145–168, URL http://dx.doi.org/10.1007/3-540-45681-3\_24.
88. Köbler, J., Schöning, U. and Toràn, J. (1993). The Graph Isomorphism Problem: Its Structural Complexity, Progress in Theoretical Computer Science (Birkhäuser).
89. Kolmogorov, A. N. and Fomin, S. V. (1960a). Elements of the Theory of Functions and Functional Analysis: Measure, Lebesgue Integrals, and Hilbert Space, Vol. 2 (Academic Press).
90. Kolmogorov, A. N. and Fomin, S. V. (1960b). Elements of the Theory of Functions and Functional Analysis: Metric and Normed Spaces, Vol. 1 (Academic Press).
91. Kondor, R. I. and Lafferty, J. (2002). Diffusion kernels on graphs and other discrete input spaces, in C. Sammut and A. Hoffmann (eds.), Proceedings of the 19th International Conference on Machine Learning (Morgan Kaufmann), pp. 315–322.
92. Korte, B. and Vygen, J. (2002). Combinatorial Optimization: Theory and Algorithms (Springer-Verlag).
93. Kowalczyk, A., Smola, A. J. and Williamson, R. C. (2002). Kernel machines and boolean functions, in T. Dietterich, S. Becker and Z. Ghahramani (eds.), Advances in Neural Information Processing Systems, Vol. 14 (MIT Press).
94. Kramer, S., De Raedt, L. and Helma, C. (2001a). Molecular feature mining in HIV data, in F. Provost and R. Srikant (eds.), Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 136–143.
95. Kramer, S., Lavrač, N. and Flach, P. A. (2001b). Propositionalization approaches to relational data mining, in Relational Data Mining, chap. 11 (Springer-Verlag).
96. Krogel, M.-A. and Wrobel, S. (2001). Transformation-based learning using mul-tirelational aggregation, in C. Rouveirol and M. Sebag (eds.), Proceedings of the 11th International Conference on Inductive Logic Programming (Springer-Verlag).
97. Kuramochi, M. and Karypis, G. (2001). Frequent subgraph discovery, in Proceedings of the IEEE International Conference on Data Mining.
98. Kwok, J. and Cheung, P. M. (2007). Marginalized multi-instance kernels, in Proc. of Int. Joint Conf. on Aritificial Intelligence, p. 901–906.
99. Landwehr, N., Passerini, A., Raedt, L. D. and Frasconi, P. (2006). kfoil: Learning simple relational kernels, in Proceedings of the 21st National Conference on Artificial Intelligence.
100. Leslie, C., Eskin, E. and Noble, W. (2002). The spectrum kernel: A string kernel for SVM protein classification, in Proceedings of the Pacific Symposium on Biocomputing, pp. 564–575.
101. Leslie, C., Eskin, E., Weston, J. and Noble, W. (2003). Mismatch string kernels for SVM protein classification, in S. Becker, S. Thrun and K. Obermayer (eds.), Advances in Neural Information Processing Systems, Vol. 15 (MIT Press).
102. Lloyd, J. W. (2003). Logic for Learning (Springer-Verlag).
103. Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N. and Watkins, C. (2002). Text classification using string kernels, Journal of Machine Learning Research 2.
104. Lodhi, H., Shawe-Taylor, J., Christianini, N. and Watkins, C. (2001). Text classification using string kernels, in T. Leen, T. Dietterich and V. Tresp (eds.), Advances in Neural Information Processing Systems, Vol. 13 (MIT Press).
105. MacKay, D. J. C. (1997). Introduction to Gaussian processes, Available at http://wol.ra.phy.cam.ac.uk/mackay.
106. Mahe, P., de Paris, E. M. and Vert, J. P. (2006). Graph kernels based on tree patterns for molecules, Arxiv preprint q-bio.QM/0609024.
107. Mahé, P., Ueda, N., Akutsu, T., Perret, J.-L. and Vert, J.-P. (2004). Extensions of marginalized graph kernels, in C. E. Brodley (ed.), Machine Learning, Proceedings of the Twenty-first International Conference (ICML 2004), Banff, Alberta, Canada, July 4-8, 2004, Vol. 69 (ACM).
108. Mahé, P., Ralaivola, L., Stoven, V. and Vert, J. P. (2006). The pharmacophore kernel for virtual screening with support vector machines, Arxiv preprint q-bio.QM/0603006.
109. Maron, O. and Lozano-Pérez, T. (1998). A framework for multiple-instance learning, in M. I. Jordan, M. J. Kearns and S. A. Solla (eds.), Advances in Neural Information Processing Systems, Vol. 10 (MIT Press).
110. Mavroeidis, D. and Flach, P. A. (2003). Improved distances for structured data, in Proceedings of the 13th International Conference on Inductive Logic Programming (Springer-Verlag).
111. Menchetti, S., Costa, F. and Frasconi, P. (2005). Weighted decomposition kernels, in Proceedings of the 22nd international conference on Machine learning, pp. 585–592.
112. Meschkowski, H. (1960). Hilbertsche Räume mit Kernfunktion (Springer Verlag).
113. Messmer, B. T. (1995). Graph Matching Algorithms and Applications, Ph.D. thesis, University of Bern.
114. Michie, D., Muggleton, S., Page, D. and Srinivasan, A. (1994). To the international computing community: A new eastwest challenge, Tech. rep., Oxford University Computing laboratory, Oxford, UK.
115. Mitchell, T. M. (1996). Machine learning (McGraw Hill, New York, US).
116. Müller, K.-R., Rätsch, G., Sonnenburg, S., Mika, S., Grimm, M. and Heinrich, N. (2005). Classifying ’drug-likeness’ with kernel-based learning methods, Journal of Chemical Information and Modeling 45, 2, pp. 249–253, URL http://dx.doi.org/10.1021/ci049737o.
117. Neuhaus, M. and Bunke, H. (2006a). A convolution edit kernel for error-tolerant graph matching, in International Conference on Pattern Recognition, pp. IV: 220–223.
118. Neuhaus, M. and Bunke, H. (2006b). A random walk kernel derived from graph edit distance, p. 191.
119. Neumaier, A. (1998). Solving ill-conditioned and singular linear systems: A tutorial on regularization, SIAM Review 40, 3, pp. 636–666, URL http://dx.doi.org/10.1137/S0036144597321909.
120. Ng, K. (2005). Learning Comprehensible Theories from Structured Data, Ph.D. thesis, Australian National University.
121. Ng, K. and Lloyd, J. W. (2008). Probabilistic reasoning in a classical logic, Journal of Applied Logic To appear.
122. Novikoff, A. (1963). On convergence proofs for perceptrons, in Proceedings of the Symposium on the Mathematical Theory of Automata, Vol. 12, pp. 615–622.
123. Ormoneit, D. and Sen, S. (2002). Kernel-based reinforcement learning, Machine Learning 49, pp. 161–178.
124. Paass, G., Leopold, E., Larson, M., Kindermann, J. and Eickeler, S. (2002). SVM classification using sequences of phonemes and syllables, in T. Elomaa, H. Mannila and H. Toivonen (eds.), Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery (Springer-Verlag).
125. Pahikkala, T., Tsivtsivadze, E., Boberg, J. and Salakoski, T. (2006). Graph kernels versus graph representations: a case study in parse ranking, in MLG, Vol. 6.
126. Passerini, A., Frasconi, P. and Raedt, L. D. (2006). Kernels on prolog proof trees: Statistical learning in the ilp setting, The Journal of Machine Learning Research 7, pp. 307–342.
127. Pavlidis, P., Furey, T., Liberto, M., Haussler, D. and Grundy, W. (2001). Promoter region-based classification of genes, in Proceedings of the Pacific Symposium on Biocomputing, pp. 151–163.
128. Perlich, C. and Provost, F. (2006). Distribution-based aggregation for relational learning with identifier attributes, Mach. Learn. 62, pp. 65–105, URL http://portal.acm.org/citation.cfm?id=1113913.
129. Platt, J. C. (1999). Fast training of support vector machines using sequential minimal optimization, in B. Schölkopf, C. J. C. Burges and A. J. Smola (eds.), Advances in kernel methods: support vector learning (MIT Press).
130. Poggio and Smale (2003). The mathematics of learning: Dealing with data, Notices of the American Mathematical Society 50.
131. Provost, F. and Fawcett, T. (2000). Robust classification for imprecise environments, Machine Learing 42, 3.
132. Provost, F., Fawcett, T. and Kohavi, R. (1998). The case against accuracy estimation for comparing induction algorithms, in Proceedings of the 15th International Conf. on Machine Learning (Morgan Kaufmann).
133. Quinlan, J. R. (1990). Learning logical definitions from relations. Machine Learning 5, 3, pp. 239–266.
134. Rabiner, L. R. (1989). A tutorial on hidden Markov models and selected applications in speech recognition, Proceedings of the IEEE 77, 2, pp. 257–285.
135. Raedt, L. D. (1998). Attribute value learning versus inductive logic programming: The missing links (extended abstract), in Proceedings of the 8th International Conference on Inductive Logic Programming (Springer-Verlag).
136. Ramon, J. and De Raedt, L. (2000). Multi instance neural networks, in Attribute-Value and Relational Learning: Crossing the Boundaries. A Workshop at the Seventeenth International Conference on Machine Learning (ICML-2000).
137. Ramon, J. and Gärtner, T. (2003). Expressivity versus efficiency of graph kernels, in First International Workshop on Mining Graphs, Trees and Sequences.
138. Read, R. C. and Tarjan, R. E. (1975). Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks 5, 3, pp. 237–252.
139. Rifkin, R. M. (2002). Everything Old is new again: A fresh Look at Historical Approaches to Machine Learning, Ph.D. thesis, MIT.
140. Rosenblatt, F. (1957). The perceptron: A perceiving and recognizing automaton, Tech. rep., Project PARA, Cornell Aeronautical Laboratory.
141. Ruffo, G. (2001). Learning Single and Multiple Instance Decision Trees for Computer Securtity Applications, Ph.D. thesis, Università di Torino.
142. Sadohara, K. (2001). Learning of boolean functions using support vector machines, in N. Abe, R. Khardon and T. Zeugmann (eds.), Proceedings of the 12th Conference on Algorithmic Learning Theory (Springer-Verlag), pp. 106–118.
143. Saigo, H., Kadowaki, T. and Tsuda, K. (2006). A linear programming approach for molecular qsar analysis, in International Workshop on Mining and Learning with Graphs (MLG), p. 85–96.
144. Saunders, C., Gammerman, A. and Vovk, V. (1998). Ridge regression learning algorithm in dual variables, in Proceedings of the Fifteenth International Conference on Machine Learning (Morgan Kaufmann).
145. Saunders, C., Shawe-Taylor, J. and Vinokourov, A. (2003). String kernels, fisher kernels and finite state automata, in S. Becker, S. Thrun and K. Obermayer (eds.), Advances in Neural Information Processing Systems, Vol. 15 (MIT Press).
146. Schaal, S., Atkeson, C. G. and Vijayakumar, S. (2000). Real-time robot learning with locally weighted statistical learning, in Proceedings of the IEEE International Conference on Robotics and Automation (IEEE Press, Piscataway, N.J.), pp. 288–293.
147. Schoelkopf, B., Smola, A. J. and Mueller, K.-R. (1997). Kernel principal component analysis, Lecture Notes in Computer Science 1327.
148. Schölkopf, B., Herbrich, R. and Smola, A. J. (2001). A generalized representer theorem, in Proceedings of the 14th annual conference on learning theory.
149. Schölkopf, B. and Smola, A. J. (2002). Learning with Kernels (MIT Press).
150. Skiena, S. (1997). The Algorithm Design Manual (Springer-Verlag).
151. Smart, W. D. and Kaelbling, L. P. (2000). Practical reinforcement learning in continuous spaces. in Proceedings of the 17th International Conference on Machine Learning (Morgan Kaufmann), pp. 903–910.
152. Smith, N. and Gales, M. (2002). Speech recognition using SVMs, in T. Dietterich, S. Becker and Z. Ghahramani (eds.), Advances in Neural Information Processing Systems, Vol. 14 (MIT Press).
153. Smola, A., Schölkopf, B., Williamson, R. and Bartlett, P. (2000). New support vector algorithms, Neural Computation 12, 5.
154. Smola, A. J. and Kondor, R. (2003). Kernels and regularization on graphs, in Proceedings of the 16th Annual Conference on Computational Learning Theory and the 7th Kernel Workshop.
155. Srinivasan, A., King, R. D. and Muggleton, S. (1999). The role of background knowledge: using a problem from chemistry to examine the performance of an ilp program, Tech. rep., Oxford University Computing Laboratory.
156. Srinivasan, A., Muggleton, S. H., Sternberg, M. J. E. and King, R. (1996). Theories for mutagenicity: a study in first-order and feature-based induction, Artificial Intelligence 85, pp. 277–299.
157. Sutton, R. and Barto, A. (1998). Reinforcement Learning: an introduction (The MIT Press, Cambridge, MA).
158. Suykens, J. A. K. (2000). Least squares support vector machines for classification and nonlinear modelling, Neural Network World 10.
159. Swamidass, S. J., Chen, J., Bruand, J., Phung, P., Ralaivola, L. and Baldi, P. (2005). Kernels for small molecules and the prediction of mutagenicity, toxicity and anti-cancer activity, Bioinformatics 21, pp. i359–i368.
160. Tan, S. M. and Fox, C. (2005). Inverse problems, University of Auckland Lecture Notes.
161. Tao, Q., Scott, S., Vinodchandran, N. V., Osugi, T. and Mueller, B. (2007). Kernels for generalized multiple-instance learning, IEEE Transactions on Pattern Analysis and Machine Intelligence 27.
162. Tikhonov, A. N. (1963). Solution of incorrectly formulated problems and the regularization method, Soviet Math. Dokl. 4, pp. 1035–1038.
163. Tikhonov, A. N. and Arsenin, V. Y. (1977). Solutions of Ill-posed problems (W.H. Winston).
164. Tsuda, K., Kawanabe, M., Rätsch, G., Sonnenburg, S. and Müller, K.-R. (2002a). A new discriminative kernel from probabilistic models, in T. Dietterich, S. Becker and Z. Ghahramani (eds.), Advances in Neural Information Processing Systems, Vol. 14 (MIT Press).
165. Tsuda, K., Kin, T. and Asai, K. (2002b). Marginalized kernels for biological sequences, in ISMB (Supplement of Bioinformatics), pp. 268–275.
166. Vapnik, V. N. (1995). The Nature of Statistical Learning Theory (Springer-Verlag).
167. Vapnik, V. N. (1999). An overview of statistical learning theory, IEEE Transaction on Neural Networks 10, 5, p. 988.
168. Vert, J.-P. (2002). A tree kernel to analyse phylogenetic profiles, in ISMB (Sup-plement of Bioinformatics), pp. 276–284.
169. Vert, J.-P. and Kanehisa, M. (2003). Graph driven features extraction from mi-croarray data using diffusion kernels and kernel CCA, in S. Becker, S. Thrun and K. Obermayer (eds.), Advances in Neural Information Processing Systems, Vol. 15 (MIT Press).
170. Vishwanathan, S. V. N., Borgwardt, K. and Schraudolph, N. N. (2007a). Fast computation of graph kernels, in Advances in Neural Information Processing Systems, Vol. 19.
171. Vishwanathan, S. V. N. and Smola, A. J. (2003). Fast kernels for string and tree matching, in S. Becker, S. Thrun and K. Obermayer (eds.), Advances in Neural Information Processing Systems, Vol. 15 (MIT Press).
172. Vishwanathan, S. V. N. and Smola, A. J. (2004). Binet-cauchy kernels, in Advances in Neural Information Processing Systems, Vol. 17.
173. Vishwanathan, S. V. N., Smola, A. J. and Vidal, R. (2007b). Binet-cauchy kernels on dynamical systems and its application to the analysis of dynamic scenes, International Journal of Computer Vision 73, pp. 95–119.
174. Wachman, G. and Khardon, R. (2007). Learning from interpretations: a rooted kernel for ordered hypergraphs, Proceedings of the 24th international conference on Machine learning, pp. 943–950.
175. Wahba, G. (1990). Spline Models for Observational Data, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 59 (SIAM, Philadelphia).
176. Wang, J. and Zucker, J.-D. (2000). Solving the multiple-instance problem: A lazy learning approach, in Proceedings of the 17th International Conference on Machine Learning (Morgan Kaufmann), pp. 1119–1125.
177. Watkins, C. (1989). Learning from Delayed Rewards, Ph.D. thesis, King’s College, Cambridge.
178. Watkins, C. (1999a). Dynamic alignment kernels, Tech. rep., Department of Computer Science, Royal Holloway, University of London.
179. Watkins, C. (1999b). Kernels from matching operations, Tech. rep., Department of Computer Science, Royal Holloway, University of London.
180. Witten, I. H. and Frank, E. (2000). Data Mining: Practical Machine Learning Tools and Techniques with Java implementations (Morgan Kaufmann).
181. Wolpert, D. H. and Macready, W. G. (1995). No free lunch theorems for search, Tech. rep., Santa Fe Institute.
182. Wolpert, D. H. and Macready, W. G. (1997). No free lunch theorem for optimization, IEEE Transactions on Evolutionary Computation 1, 1.
183. Woznica, A., Kalousis, A. and Hilario, M. (2006). Matching based kernels for labeled graphs, in MLG.
184. Zaki, M. (2002). Efficiently mining frequent trees in a forest, in Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-02) (ACM Press, New York), pp. 71–80.
185. Zhang, Q. and Goldman, S. (2002). EM-DD: An improved multiple-instance learning technique, in T. Dietterich, S. Becker and Z. Ghahramani (eds.), Advances in Neural Information Processing Systems, Vol. 14 (MIT Press).
186. Zien, A., Ratsch, G., Mika, S., Schölkopf, B., Lengauer, T. and Muller, K.-R. (2000). Engineering support vector machine kernels that recognize translation initiation sites, Bioinformatics 16, 9, pp. 799–807.