{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T19:09:10Z","timestamp":1791486550454,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,20]]},"DOI":"10.1145\/1273496.1273615","type":"proceedings-article","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T13:06:52Z","timestamp":1223384812000},"page":"943-950","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Learning from interpretations"],"prefix":"10.1145","author":[{"given":"Gabriel","family":"Wachman","sequence":"first","affiliation":[{"name":"Tufts University, Medford, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roni","family":"Khardon","sequence":"additional","affiliation":[{"name":"Tufts University, Medford, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/toxsci\/54.1.138"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/jn\/132.4.658"},{"key":"e_1_3_2_1_3_1","unstructured":"Cristianini N. & Shawe-Taylor J. (2000). An introduction to support vector machines. Cambridge University Press. Cristianini N. & Shawe-Taylor J. (2000). An introduction to support vector machines . Cambridge University Press."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90112-0"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Deshpande M. Kuramochi M. & Karypis G. (2003). Frequent sub-structure-based approaches for classifying chemical compounds. ICDM (pp. 35--42). Deshpande M. Kuramochi M. & Karypis G. (2003). Frequent sub-structure-based approaches for classifying chemical compounds. ICDM (pp. 35--42).","DOI":"10.21236\/ADA439580"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1021\/tx000208y"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102380"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-84628-284-5_4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner T. Flach P. A. & Wrobel S. (2003). On graph kernels: Hardness results and efficient alternatives. COLT (pp. 129--143). G\u00e4rtner T. Flach P. A. & Wrobel S. (2003). On graph kernels: Hardness results and efficient alternatives. COLT (pp. 129--143).","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014072"},{"key":"e_1_3_2_1_11_1","unstructured":"Kashima H. Tsuda K. & Inokuchi A. (2003). Marginalized kernels between labeled graphs. ICML (pp. 321--328). Kashima H. Tsuda K. & Inokuchi A. (2003). Marginalized kernels between labeled graphs. ICML (pp. 321--328)."},{"key":"e_1_3_2_1_12_1","first-page":"227","article-title":"Noise tolerant variants of the perceptron algorithm","volume":"8","author":"Khardon R.","year":"2007","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_13_1","unstructured":"Kramer S. & De Raedt L. (2001). Feature construction with version spaces for biochemical applications. ICML (pp. 258--265). Kramer S. & De Raedt L. (2001). Feature construction with version spaces for biochemical applications. ICML (pp. 258--265)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/20\/11\/013"},{"key":"e_1_3_2_1_15_1","unstructured":"Landwehr N. Passerini A. De Raedt L. & Frasconi P. (2006). kfoil: Learning simple relational kernels. AAAI. Landwehr N. Passerini A. De Raedt L. & Frasconi P. (2006). kfoil: Learning simple relational kernels. AAAI ."},{"key":"e_1_3_2_1_16_1","volume-title":"International Conference on Machine Learning (pp. 379--386)","author":"Li Y.","year":"2002"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Mah\u00e9 P. Ueda N. Akutsu T. Perret J.-L. & Vert J.-P. (2004). Extensions of marginalized graph kernels. ICML. Mah\u00e9 P. Ueda N. Akutsu T. Perret J.-L. & Vert J.-P. (2004). Extensions of marginalized graph kernels. ICML .","DOI":"10.1145\/1015330.1015446"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037227"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022699322624"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.07.009"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00122-0"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143964"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Vishwanathan S. V. N. Borgwardt K. M. & Schraudolph N. (2006). Fast computation of graph kernels. NIPS 19. Vishwanathan S. V. N. Borgwardt K. M. & Schraudolph N. (2006). Fast computation of graph kernels. NIPS 19 .","DOI":"10.7551\/mitpress\/7503.003.0186"}],"event":{"name":"ICML '07 & ILP '07: The 24th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","location":"Corvalis Oregon USA","acronym":"ICML '07 & ILP '07","sponsor":["Machine Learning Journal"]},"container-title":["Proceedings of the 24th international conference on Machine learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273615","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273496.1273615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:01Z","timestamp":1750258681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273615"}},"subtitle":["a rooted kernel for ordered hypergraphs"],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":24,"alternative-id":["10.1145\/1273496.1273615","10.1145\/1273496"],"URL":"https:\/\/doi.org\/10.1145\/1273496.1273615","relation":{},"subject":[],"published":{"date-parts":[[2007,6,20]]},"assertion":[{"value":"2007-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}