{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:58Z","timestamp":1725807898613},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126395"},{"type":"electronic","value":"9783319126401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12640-1_12","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T20:14:56Z","timestamp":1413836096000},"page":"93-100","source":"Crossref","is-referenced-by-count":1,"title":["Graph Kernels Exploiting Weisfeiler-Lehman Graph Isomorphism Test Extensions"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Da San Martino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00f2","family":"Navarin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Sperduti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Borgwardt, K.M., Kriegel, H.-P.: Shortest-Path Kernels on Graphs. In: ICDM, pp. 74\u201381 (2005)"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01305232","volume":"12","author":"J.-Y. Cai","year":"1992","unstructured":"Cai, J.-Y., Furer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica\u00a012(4), 389\u2013410 (1992)","journal-title":"Combinatorica"},{"key":"12_CR3","unstructured":"Costa, F., De Grave, K.: Fast neighborhood subgraph pairwise distance kernel. In: ICML (2010)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Da San Martino, G., Navarin, N., Sperduti, A.: A memory efficient graph kernel. In: The 2012 International Joint Conference on Neural Networks (IJCNN). IEEE (June 2012)","DOI":"10.1109\/IJCNN.2012.6252831"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Da San Martino, G., Navarin, N., Sperduti, A.: A Tree-Based Kernel for Graphs. In: SDM, pp. 975\u2013986 (2012)","DOI":"10.1137\/1.9781611972825.84"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.endm.2005.05.050","volume":"19","author":"M. de Oliveira Oliveira","year":"2005","unstructured":"de Oliveira Oliveira, M., Greve, F.: A new refinement procedure for graph isomorphism algorithms. Electronic Notes in Discrete Mathematics\u00a019, 373\u2013379 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/S0022-2836(03)00628-4","volume":"330","author":"P.D. Dobson","year":"2003","unstructured":"Dobson, P.D., Doig, A.J.: Distinguishing Enzyme Structures from Non-enzymes Without Alignments. Journal of Molecular Biology\u00a0330(4), 771\u2013783 (2003)","journal-title":"Journal of Molecular Biology"},{"key":"12_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","volume-title":"Learning Theory and Kernel Machines","author":"T. Gartner","year":"2003","unstructured":"Gartner, T., Flach, P., Wrobel, S.: On Graph Kernels: Hardness Results and Efficient Alternatives. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 129\u2013143. Springer, Heidelberg (2003)"},{"key":"12_CR9","unstructured":"Heinonen, M., V\u00e4lim\u00e4ki, N., M\u00e4kinen, V., Rousu, J.: Efficient Path Kernels for Reaction Function Prediction. Bioinformatics Models, Methods and Algorithms (2012)"},{"issue":"4","key":"12_CR10","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1021\/ci034254q","volume":"44","author":"C. Helma","year":"2004","unstructured":"Helma, C., Cramer, T., Kramer, S., De Raedt, L.: Data mining and machine learning techniques for the identification of mutagenicity inducing substructures and structure activity relationships of noncongeneric compounds. Journal of Chemical Information and Computer Sciences\u00a044(4), 1402\u20131411 (2004)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"12_CR11","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: ICML, pp. 321\u2013328. AAAI Press (2003)"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-008-5086-2","volume":"75","author":"P. Mah\u00e9","year":"2008","unstructured":"Mah\u00e9, P., Vert, J.-P.: Graph kernels based on tree patterns for molecules. Machine Learning\u00a075(1), 3\u201335 (2008)","journal-title":"Machine Learning"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Miyazaki, T.: The complexity of McKay\u2019s canonical labeling algorithm. In: Groups and Computation II (1997)","DOI":"10.1090\/dimacs\/028\/14"},{"key":"12_CR14","unstructured":"Shervashidze, N., Borgwardt, K.: Fast subtree kernels on graphs. In: NIPS, pp. 1660\u20131668 (2009)"},{"key":"12_CR15","first-page":"488","volume":"5","author":"N. Shervashidze","year":"2009","unstructured":"Shervashidze, N., Mehlhorn, K., Petri, T.H., Vishwanathan, S.V.N., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. AISTATS\u00a05, 488\u2013495 (2009)","journal-title":"AISTATS"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Vishwanathan, S.V.N., Borgwardt, K.M., Schraudolph, N.N.: Fast Computation of Graph Kernels. In: NIPS, pp. 1449\u20131456 (2006)","DOI":"10.7551\/mitpress\/7503.003.0186"},{"key":"12_CR17","unstructured":"Vishwanathan, S.V.N., Smola, A.J.: Fast Kernels for String and Tree Matching. In: Becker, S., Thrun, S., Obermayer, K. (eds.) NIPS, pp. 569\u2013576. MIT Press (2002)"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N. Wale","year":"2008","unstructured":"Wale, N., Watson, I., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. Knowledge and Information Systems\u00a014(3), 347\u2013375 (2008)","journal-title":"Knowledge and Information Systems"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Weisfeiler, B.: On construction and identification of graphs. Lecture Notes in Mathematics (1976)","DOI":"10.1007\/BFb0089374"},{"issue":"8","key":"12_CR20","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1093\/jnci\/81.8.577","volume":"81","author":"O.S. Weislow","year":"1989","unstructured":"Weislow, O.S., Kiser, R., Fine, D.L., Bader, J., Shoemaker, R.H., Boyd, M.R.: New soluble-formazan assay for HIV-1 cytopathic effects: application to high-flux screening of synthetic and natural products for AIDS-antiviral activity. Journal of the National Cancer Institute\u00a081(8), 577\u2013586 (1989)","journal-title":"Journal of the National Cancer Institute"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12640-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T11:29:52Z","timestamp":1689593392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12640-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126395","9783319126401"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12640-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}