{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:08:15Z","timestamp":1725556095711},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642136719"},{"type":"electronic","value":"9783642136726"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_37","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T14:38:17Z","timestamp":1274193497000},"page":"374-385","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive Matching Based Kernels for Labelled Graphs"],"prefix":"10.1007","author":[{"given":"Adam","family":"Wo\u017anica","sequence":"first","affiliation":[]},{"given":"Alexandros","family":"Kalousis","sequence":"additional","affiliation":[]},{"given":"Melanie","family":"Hilario","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J. Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T. G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T.: A survey of kernels for structured data. SIGKDD Explor. Newsl.\u00a05(1), 49\u201358 (2003)","journal-title":"SIGKDD Explor. Newsl."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T., Flach, P., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In: Proceedings of COLT 16 and the 7th Kernel Workshop (2003)","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"37_CR4","unstructured":"Ramon, J., G\u00e4rtner, T.: Expressivity versus efficiency of graph kernels. In: First International Workshop on Mining Graphs, Trees and Sequences (held with ECML\/PKDD\u201903) (2003)"},{"key":"37_CR5","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: ICML, Washington, DC (2003)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Mah\u00e9, P., Ueda, N., Akutsu, T., Perret, J.L., Vert, J.P.: Extensions of marginalized graph kernels. In: ICML (2004)","DOI":"10.1145\/1015330.1015446"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1093\/bioinformatics\/bti1007","volume":"21","author":"K.M. Borgwardt","year":"2005","unstructured":"Borgwardt, K.M., Ong, C.S., Sch\u00f6nauer, S., Vishwanathan, S., Smola, A.J., Kriegel, H.P.: Protein function prediction via graph kernels. Bioinformatics\u00a021(1), i47\u2013i56 (2005)","journal-title":"Bioinformatics"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Ralaivola, L., Swamidass, S.J., Saigo, H., Baldi, P.: Graph kernels for chemical informatics. Neural Networks, 1093\u20131110 (2005)","DOI":"10.1016\/j.neunet.2005.07.009"},{"key":"37_CR9","unstructured":"Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: ICDM (2005)"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Fr\u00f6hich, H., Wegner, J., Sieker, F., Zell, A.: Optimal assignment kernels for attributed molecular graphs. In: ICML (2005)","DOI":"10.1145\/1102351.1102380"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., G\u00e4rtner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: KDD (2004)","DOI":"10.1145\/1014052.1014072"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Menchetti, S., Costa, F., Frasconi, P.: Weighted decomposition kernels. In: ICML (2005)","DOI":"10.1145\/1102351.1102425"},{"key":"37_CR13","unstructured":"Sherashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: 12th AISTATS (2009)"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1162\/153244303321897681","volume":"3","author":"S. Ben-David","year":"2002","unstructured":"Ben-David, S., Eiron, N., Simon, H.: Limitations of learning via embeddings in euclidean half spaces. Journal of Machine Learning Research\u00a03, 441\u2013461 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Collins, M., Duffy, N.: Convolution kernels for natural language. In: NIPS (2002)","DOI":"10.7551\/mitpress\/1120.003.0085"},{"key":"37_CR16","unstructured":"Cumby, C., Roth, D.: On Kernel Methods for Relational Learning. In: ICML (2003)"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Wo\u017anica, A., Kalousis, A., Hilario, M.: Distances and (indefinite) kernels for sets of objects. In: ICDM (2006)","DOI":"10.1109\/ICDM.2006.60"},{"key":"37_CR18","unstructured":"Vert, J.P.: The optimal assignment kernel is not positive definite (2008)"},{"key":"37_CR19","unstructured":"Lanckriet, G., Cristianini, N., Bartlett, P.L., Ghaoui, L.E., Jordan, M.: Learning the kernel matrix with semi-definite programming. Journal of Machine Learning Research\u00a05 (2004)"},{"key":"37_CR20","volume-title":"Foundations and Applications","author":"E. Pekalska","year":"2005","unstructured":"Pekalska, E., Duin, R.: The Dissimilarity Representation for Pattern Recognition. In: Foundations and Applications. World Scientific Publishing Company, Singapore (2005)"},{"key":"37_CR21","volume-title":"NIPS","author":"J. Goldberger","year":"2005","unstructured":"Goldberger, J., Roweis, S., Hinton, G., Salakhutdinov, R.: Neighbourhood component analysis. In: NIPS. MIT Press, Cambridge (2005)"},{"key":"37_CR22","unstructured":"Wo\u017anica, A., Kalousis, A., Hilario, M.: Matching based kernels for labeled graphs. In: Mining and Learning with Graphs (MLG 2006), with ECML\/PKDD, Berlin, Germany (2006)"},{"issue":"10","key":"37_CR23","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/PL00013304","volume":"37","author":"J. Ramon","year":"2001","unstructured":"Ramon, J., Bruynooghe, M.: A polynomial time computable metric between point sets. Acta Informatica\u00a037(10), 765\u2013780 (2001)","journal-title":"Acta Informatica"},{"issue":"3","key":"37_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/B:MACH.0000039777.23772.30","volume":"57","author":"T. G\u00e4rtner","year":"2004","unstructured":"G\u00e4rtner, T., Lloyd, J.W., Flach, P.A.: Kernels and distances for structured data. Mach. Learn.\u00a057(3), 205\u2013232 (2004)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T21:01:39Z","timestamp":1711486899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}