{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T11:15:38Z","timestamp":1781435738070,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T00:00:00Z","timestamp":1147046400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10994-006-8258-y","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T12:45:29Z","timestamp":1147092329000},"page":"91-119","source":"Crossref","is-referenced-by-count":25,"title":["Graph kernels and Gaussian processes for relational reinforcement learning"],"prefix":"10.1007","volume":"64","author":[{"given":"Kurt","family":"Driessens","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"G\u00e4rtner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,8]]},"reference":[{"key":"8258_CR1","unstructured":"Barnett, S. (1979). Matrix Methods for Engineers and Scientists. MacGraw-Hill."},{"key":"8258_CR2","doi-asserted-by":"crossref","unstructured":"Cortes, C., Haffner, P., & Mohri, M. (2003). Positive Definite Rational Kernels. In Proceedings of the 16th Annual Conference on Computational Learning Theory and the 7th Kernel Workshop.","DOI":"10.1007\/978-3-540-45167-9_5"},{"key":"8258_CR3","unstructured":"Dearden, R., Friedman, N., & Russell, S. (1998). Bayesian Q-learning. In Proceedings of AAAI-98\/IAAI-98, (pp. 761\u2013768)."},{"key":"8258_CR4","volume-title":"Technical Report MIT-LCS-TR-865","author":"E. Demaine","year":"2002","unstructured":"Demaine, E., Hohenberger, S., & Liben-Nowell, D. (2002). Tetris is Hard, Even to Approximate. Technical Report MIT-LCS-TR-865, Massachussets Institue of Technology, Boston."},{"key":"8258_CR5","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Kuramochi, M., & Karypis, G. (2002). Automated Approaches for Classifying Structures. In Proceedings of the 2nd ACM SIGKDD Workshop on Data Mining in Bioinformatics.","DOI":"10.21236\/ADA439498"},{"key":"8258_CR6","unstructured":"Diestel, R. (2000). Graph Theory. Springer-Verlag."},{"key":"8258_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1120.001.0001","volume-title":"Advances in Neural Information Processing Systems","author":"T. Dietterich","year":"2002","unstructured":"Dietterich, T., & Wang, X. (2002). Batch value function approximation via support vectors. In T. G. Dietterich, S. Becker, & Z. Ghahramani (Eds.), Advances in Neural Information Processing Systems, vol. 14, Cambridge, MA, The MIT Press."},{"key":"8258_CR8","unstructured":"Driessens, K., & D\u017eeroski, S. (2002). Integrating experimentation and guidance in relational reinforcement learning. In C. Sammut, & A. Hoffmann (Eds.), Proceedings of the Nineteenth International Conference on Machine Learning (pp. 115\u2013122). Morgan Kaufmann Publishers, Inc."},{"key":"8258_CR9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/B:MACH.0000039779.47329.3a","volume":"57","author":"K. Driessens","year":"2004","unstructured":"Driessens, K., & D\u017eeroski, S. (2004). Integrating guidance into relational reinforcement learning. Machine Learning, 57, 271\u2013304.","journal-title":"Machine Learning"},{"key":"8258_CR10","unstructured":"Driessens, K., & Ramon, J. (2003). Relational instance based regression for relational reinforcement learning. In Proceedings of the Twentieth International Conference on Machine Learning (pp. 123\u2013130). AAAI Press."},{"key":"8258_CR11","unstructured":"Driessens, K., Ramon, J., & Blockeel, H. (2001). Speeding up Relational Reinforcement Learning Through the Use of an Incremental First Order Decision Tree Learner. In L. De Raedt, & P. Flach (Eds.), Proceedings of the 13th European Conference on Machine Learning, vol. 2167 of Lecture Notes in Artificial Intelligence (pp. 97\u2013108). Springer-Verlag."},{"key":"8258_CR12","doi-asserted-by":"crossref","unstructured":"D\u017eeroski, S., De Raedt, L., & Blockeel, H. (1998). Relational reinforcement Learning. In Proceedings of the 15th International Conference on Machine Learning (pp. 136\u2013143). Morgan Kaufmann.","DOI":"10.1007\/BFb0027307"},{"key":"8258_CR13","unstructured":"Engel, Y., Mannor, S., & Meir, R. (2003). Bayes meets Bellman: The gaussian process approach to temporal difference learning. In Proceedings of the Twentieth International Conference on Machine Learning (ICML 2003) (pp. 154\u2013161). Morgan Kaufmann."},{"key":"8258_CR14","unstructured":"G\u00e4rtner, T. (2002). Exponential and Geometric Kernels for Graphs. In NIPS Workshop on Unreal Data: Principles of Modeling Nonvectorial Data."},{"issue":"1","key":"8258_CR15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T. G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T. (2003). A survey of kernels for structured data. SIGKDD Explorations, 5(1), 49\u201358.","journal-title":"SIGKDD Explorations"},{"key":"8258_CR16","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T., Driessens, K., & Ramon, J. (2003a). Graph kernels and Gaussian processes for relational reinforcement learning. In Inductive Logic Programming, 13th International Conference, ILP 2003, Proceedings, vol. 2835 of Lecture Notes in Computer Science (pp. 146\u2013163). Springer.","DOI":"10.1007\/978-3-540-39917-9_11"},{"key":"8258_CR17","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T., Flach, P., & Wrobel, S. (2003b). On graph kernels: Hardness Results and Efficient Alternatives. In M. W. B. Sch\u00f6lkopf (Ed.), Proceedings of the 16th Annual Conference on Computational Learning Theory and the 7th Kernel Workshop (129\u2013143).","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"8258_CR18","unstructured":"Gibbs, M. (1997). Bayesian Gaussian Processes for Regression and Classification. Ph.D. thesis, University of Cambridge."},{"key":"8258_CR19","unstructured":"Golub, G. H., & Van Loan, C. F. (1996). Matrix computations. Johns Hopkins Series in the Mathematical Sciences. The Johns Hopkins University Press."},{"key":"8258_CR20","unstructured":"Graepel, T. (2002). PAC-Bayesian Pattern Classification with Kernels. Ph.D. thesis, TU Berlin."},{"key":"8258_CR21","doi-asserted-by":"crossref","unstructured":"Horvath, T., G\u00e4rtner, T., & Wrobel, S. (2004). Cyclic Pattern Kernels for Predictive Graph Mining. In Proceedings of the International Conference on Knowledge Discovery and Data Mining.","DOI":"10.1145\/1014052.1014072"},{"key":"8258_CR22","unstructured":"Imrich, W., & Klav\u017ear, S. (2000). Product Graphs: Structure and Recognition. John Wiley."},{"key":"8258_CR23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"L. Kaelbling","year":"1996","unstructured":"Kaelbling, L., Littman, M., & Moore, A. (1996). Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4, 237\u2013285.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"8258_CR24","unstructured":"Kashima, H., & Inokuchi, A. (2002). Kernels for Graph Classification. In ICDM Workshop on Active Mining."},{"key":"8258_CR25","unstructured":"Kashima, H., Tsuda, K., & Inokuchi, A. (2003). Marginalized kernels Between Labeled Graphs. In Proceedings of the 20th International Conference on Machine Learning."},{"key":"8258_CR26","doi-asserted-by":"crossref","unstructured":"Korte, B., & Vygen, J. (2002). Combinatorial Optimization: Theory and Algorithms. Springer-Verlag.","DOI":"10.1007\/978-3-662-21711-5"},{"key":"8258_CR27","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., & Karypis, G. (2001). Frequent subgraph discovery. In Proceedings of the IEEE International Conference on Data Mining.","DOI":"10.1109\/ICDM.2001.989534"},{"key":"8258_CR28","unstructured":"MacKay, D. (1997a) Introduction to Gaussian processes. Aavailable at http:\/\/wol.ra.phy.cam.ac.uk\/mackay ."},{"key":"8258_CR29","unstructured":"MacKay, D. J. C. (1997b). Introduction to Gaussian processes. Available at http:\/\/wol.ra.phy.cam.ac.uk\/mackay ."},{"key":"8258_CR30","unstructured":"Mitchell, T. (1997). Machine Learning. McGraw-Hill."},{"key":"8258_CR31","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1017928328829","volume":"49","author":"D. Ormoneit","year":"2002","unstructured":"Ormoneit, D., & Sen, S. (2002). Kernel-based reinforcement learning. Machine Learning, 49, 161\u2013178.","journal-title":"Machine Learning"},{"key":"8258_CR32","unstructured":"Rasmussen, C. E., & Kuss, M. (2004). Gaussian Processes in Reinforcement Learning. In Advances in Neural Information Processing Systems, vol. 16. MIT Press."},{"key":"8258_CR33","unstructured":"Rifkin, R. M. (2002). Everything old is new again: A fresh Look at Historical Approaches to Machine Learning. Ph.D. thesis, MIT."},{"key":"8258_CR34","unstructured":"Saunders, C., Gammerman, A., & Vovk, v. (1998). Ridge Regression Learning Algorithm in Dual Variables. In Proceedings of the Fifteenth International Conference on Machine Learning. Morgan Kaufmann."},{"key":"8258_CR35","first-page":"288","volume-title":"Proceedings of the IEEE International Conference on Robotics and Automation","author":"S. Schaal","year":"2000","unstructured":"Schaal, S., Atkeson, C. G., & Vijayakumar, S. (2000). Real-Time Robot Learning with Locally Weighted Statistical Learning. In Proceedings of the IEEE International Conference on Robotics and Automation (pp. 288\u2013293). IEEE Press, Piscataway, N.J."},{"key":"8258_CR36","unstructured":"Sch\u00f6lkopf, B., & Smola, A. J. (2002). Learning with kernels. MIT Press."},{"key":"8258_CR37","unstructured":"Smart, W. D., & Kaelbling, L. P. (2000). Practical Reinforcement Learning in Continuous Spaces. In Proceedings of the 17th International Conference on Machine Learning (pp. 903\u2013910). Morgan Kaufmann."},{"key":"8258_CR38","volume-title":"Reinforcement Learning: An introduction","author":"R. Sutton","year":"1998","unstructured":"Sutton, R., & Barto, A. (1998). Reinforcement Learning: An introduction. Cambridge, MA: The MIT Press."},{"key":"8258_CR39","doi-asserted-by":"crossref","unstructured":"Vapnik, V. (1995). The Nature of Statistical Learning Theory. Springer-Verlag.","DOI":"10.1007\/978-1-4757-2440-0"},{"key":"8258_CR40","unstructured":"Watkins, C. (1989). Learning from Delayed Rewards. Ph.D. thesis, King\u2019s College, Cambridge."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-8258-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-006-8258-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-8258-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:21Z","timestamp":1559338821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-006-8258-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,8]]},"references-count":40,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["8258"],"URL":"https:\/\/doi.org\/10.1007\/s10994-006-8258-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,8]]}}}