{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T15:50:52Z","timestamp":1790265052222,"version":"4.1.0"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T00:00:00Z","timestamp":1623801600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T00:00:00Z","timestamp":1623801600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"MEXT KAKENHI","award":["16H06538"],"award-info":[{"award-number":["16H06538"]}]},{"name":"MEXT KAKENHI","award":["17H00758"],"award-info":[{"award-number":["17H00758"]}]},{"name":"MEXT KAKENHI","award":["17H04694"],"award-info":[{"award-number":["17H04694"]}]},{"name":"JST CREST","award":["JPMJCR1302"],"award-info":[{"award-number":["JPMJCR1302"]}]},{"name":"JST CREST","award":["JPMJCR1502"],"award-info":[{"award-number":["JPMJCR1502"]}]},{"DOI":"10.13039\/501100009023","name":"PRESTO","doi-asserted-by":"crossref","award":["JPMJPR15N2"],"award-info":[{"award-number":["JPMJPR15N2"]}],"id":[{"id":"10.13039\/501100009023","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Collaborative Research Program of Institute for Chemical Research, Kyoto University","award":["grant #2018-33"],"award-info":[{"award-number":["grant #2018-33"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10994-021-06009-3","type":"journal-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T20:02:30Z","timestamp":1623873750000},"page":"1765-1811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Distance metric learning for graph structured data"],"prefix":"10.1007","volume":"110","author":[{"given":"Tomoki","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ichiro","family":"Takeuchi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6177-3686","authenticated-orcid":false,"given":"Masayuki","family":"Karasuyama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"key":"6009_CR1","doi-asserted-by":"crossref","unstructured":"Adhikari, B., Zhang, Y., Ramakrishnan, N., & Prakash, B.\u00a0A. (2018). Sub2vec: Feature learning for subgraphs. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, (pp. 170\u2013182). Springer.","DOI":"10.1007\/978-3-319-93037-4_14"},{"key":"6009_CR2","unstructured":"Agrawal, R., Srikant, R., et\u00a0al. (1994). Fast algorithms for mining association rules. In Proceedings of 20th international conference on very large data bases, VLDB (vol. 1215, pp. 487\u2013499)."},{"key":"6009_CR3","unstructured":"Atwood, J., & Towsley, D. (2016). Diffusion-convolutional neural networks. In Advances in Neural Information Processing Systems (pp. 1993\u20132001)."},{"issue":"1\u20132","key":"6009_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10994-012-5293-8","volume":"89","author":"A Bellet","year":"2012","unstructured":"Bellet, A., Habrard, A., & Sebban, M. (2012). Good edit similarity learning by loss minimization. Machine Learning, 89(1\u20132), 5\u201335.","journal-title":"Machine Learning"},{"key":"6009_CR5","doi-asserted-by":"crossref","unstructured":"Borgwardt, K.\u00a0M., & Kriegel, H.-P. (2005). Shortest-path kernels on graphs. In Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM 2005) (pp. 74\u201381). IEEE Computer Society.","DOI":"10.1109\/ICDM.2005.132"},{"issue":"6","key":"6009_CR6","doi-asserted-by":"publisher","first-page":"4159","DOI":"10.1529\/biophysj.105.064485","volume":"89","author":"K Brinda","year":"2005","unstructured":"Brinda, K., & Vishveshwara, S. (2005). A network representation of protein structures: Implications for protein stability. Biophysical Journal, 89(6), 4159\u20134170.","journal-title":"Biophysical Journal"},{"key":"6009_CR7","doi-asserted-by":"crossref","unstructured":"Chang, C.-C. and Lin, C.-J. (2011). LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology, 2:27:1\u201327:27. Software available at http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm.","DOI":"10.1145\/1961189.1961199"},{"key":"6009_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J., & Philip, S.\u00a0Y. (2008). Direct discriminative pattern mining for effective classification. In 2008 IEEE 24th International Conference on Data Engineering (pp. 169\u2013178). IEEE.","DOI":"10.1109\/ICDE.2008.4497425"},{"key":"6009_CR9","doi-asserted-by":"crossref","unstructured":"Cho, M., Lee, J., & Lee, K.\u00a0M. (2010). Reweighted random walks for graph matching. In European conference on Computer vision (pp. 492\u2013505). Springer.","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"6009_CR10","unstructured":"Costa, F., & Grave, K.\u00a0D. (2010). Fast neighborhood subgraph pairwise distance kernel. In Proceedings of the 27th International Conference on International Conference on Machine Learning (pp. 255\u2013262). Omnipress."},{"key":"6009_CR11","doi-asserted-by":"crossref","unstructured":"Davis, J.\u00a0V., Kulis, B., Jain, P., Sra, S., & Dhillon, I.\u00a0S. (2007). Information-theoretic metric learning. In Proceedings of the 24th international conference on Machine learning (pp. 209\u2013216). ACM.","DOI":"10.1145\/1273496.1273523"},{"key":"6009_CR12","unstructured":"Dua, D., & Graff, C. (2017). UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml."},{"key":"6009_CR13","unstructured":"Duvenaud, D.\u00a0K., Maclaurin, D., Iparraguirre, J., Bombarell, R., Hirzel, T., Aspuru-Guzik, A., & Adams, R.\u00a0P. (2015). Convolutional networks on graphs for learning molecular fingerprints. In Advances in neural information processing systems (pp. 2224\u20132232). Curran Associates, Inc."},{"key":"6009_CR14","first-page":"1871","volume":"9","author":"R-E Fan","year":"2008","unstructured":"Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., & Lin, C.-J. (2008). LIBLINEAR: A library for large linear classification. Journal of machine learning research, 9, 1871\u20131874.","journal-title":"Journal of machine learning research"},{"key":"6009_CR15","unstructured":"Feragen, A., Kasenburg, N., Petersen, J., de\u00a0Bruijne, M., & Borgwardt, K. (2013). Scalable kernels for graphs with continuous attributes. In Advances in Neural Information Processing Systems (pp. 216\u2013224)."},{"issue":"2","key":"6009_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman, J., Hastie, T., H\u00f6fling, H., & Tibshirani, R. (2007). Pathwise coordinate optimization. The Annals of Applied Statistics, 1(2), 302\u2013332.","journal-title":"The Annals of Applied Statistics"},{"issue":"1","key":"6009_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., & Li, X. (2010). A survey of graph edit distance. Pattern Analysis and applications, 13(1), 113\u2013129.","journal-title":"Pattern Analysis and applications"},{"key":"6009_CR18","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T., Flach, P., & Wrobel, S. (2003). On graph kernels: Hardness results and efficient alternatives. In Learning Theory and Kernel Machines (pp. 129\u2013143). Springer.","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"6009_CR19","unstructured":"Ghaoui, L.\u00a0E., Viallon, V., & Rabbani, T. (2010). Safe feature elimination for the lasso and sparse supervised learning problems. arXiv:1009.4219."},{"issue":"4","key":"6009_CR20","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum-flow problem. Journal of the ACM (JACM), 35(4), 921\u2013940.","journal-title":"Journal of the ACM (JACM)"},{"issue":"7","key":"6009_CR21","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/TPAMI.2005.138","volume":"27","author":"M Gori","year":"2005","unstructured":"Gori, M., Maggini, M., & Sarti, L. (2005). Exact and approximate graph matching using random walks. IEEE transactions on pattern analysis and machine intelligence, 27(7), 1100\u20131111.","journal-title":"IEEE transactions on pattern analysis and machine intelligence"},{"issue":"1","key":"6009_CR22","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/A:1012427100071","volume":"46","author":"C-W Hsu","year":"2002","unstructured":"Hsu, C.-W., & Lin, C.-J. (2002). A simple decomposition method for support vector machines. Machine Learning, 46(1), 291\u2013314.","journal-title":"Machine Learning"},{"key":"6009_CR23","doi-asserted-by":"crossref","unstructured":"Huang, X., Li, J., & Hu, X. (2017). Label informed attributed network embedding. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining (pp. 731\u2013739).","DOI":"10.1145\/3018661.3018667"},{"key":"6009_CR24","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.ins.2012.07.008","volume":"220","author":"U Kang","year":"2013","unstructured":"Kang, U., Hebert, M., & Park, S. (2013). Fast and scalable approximate spectral graph matching for correspondence problems. Information Sciences, 220, 306\u2013318.","journal-title":"Information Sciences"},{"key":"6009_CR25","unstructured":"Kersting, K., Kriege, N.\u00a0M., Morris, C., Mutzel, P., & Neumann, M. (2016). Benchmark data sets for graph kernels. http:\/\/graphkernels.cs.tu-dortmund.de."},{"key":"6009_CR26","doi-asserted-by":"crossref","unstructured":"Kondor, R., & Borgwardt, K.\u00a0M. (2008). The skew spectrum of graphs. In Proceedings of the 25th international conference on Machine learning (pp. 496\u2013503). ACM.","DOI":"10.1145\/1390156.1390219"},{"key":"6009_CR27","unstructured":"Kondor, R., & Pan, H. (2016). The multiscale laplacian graph kernel. In Advances in Neural Information Processing Systems (pp. 2990\u20132998)."},{"key":"6009_CR28","doi-asserted-by":"crossref","unstructured":"Kondor, R., Shervashidze, N., & Borgwardt, K.\u00a0M. (2009). The graphlet spectrum. In Proceedings of the 26th Annual International Conference on Machine Learning (pp. 529\u2013536). ACM.","DOI":"10.1145\/1553374.1553443"},{"key":"6009_CR29","unstructured":"Kriege, N., & Mutzel, P. (2012). Subgraph matching kernels for attributed graphs. arXiv preprint arXiv:1206.6483."},{"key":"6009_CR30","unstructured":"Kuksa, P., Huang, P.-H., & Pavlovic, V. (2008). A fast, large-scale learning method for protein sequence classification. In 8th Int. Workshop on Data Mining in Bioinformatics (pp. 29\u201337)."},{"key":"6009_CR31","doi-asserted-by":"crossref","unstructured":"Lee, J.\u00a0B., Rossi, R., & Kong, X. (2018). Graph classification using structural attention. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1666\u20131674). ACM.","DOI":"10.1145\/3219819.3219980"},{"issue":"1","key":"6009_CR32","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","volume":"96","author":"M Leordeanu","year":"2012","unstructured":"Leordeanu, M., Sukthankar, R., & Hebert, M. (2012). Unsupervised learning for graph matching. International journal of computer vision, 96(1), 28\u201345.","journal-title":"International journal of computer vision"},{"key":"6009_CR33","doi-asserted-by":"crossref","unstructured":"Leslie, C., Eskin, E., & Noble, W.\u00a0S. (2001). The spectrum kernel: A string kernel for svm protein classification. In Biocomputing 2002 (pp. 564\u2013575). World Scientific.","DOI":"10.1142\/9789812799623_0053"},{"issue":"Nov","key":"6009_CR34","first-page":"1435","volume":"5","author":"C Leslie","year":"2004","unstructured":"Leslie, C., & Kuang, R. (2004). Fast string kernels using inexact matching for protein sequences. Journal of Machine Learning Research, 5(Nov), 1435\u20131455.","journal-title":"Journal of Machine Learning Research"},{"issue":"4","key":"6009_CR35","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1093\/bioinformatics\/btg431","volume":"20","author":"CS Leslie","year":"2004","unstructured":"Leslie, C. S., Eskin, E., Cohen, A., Weston, J., & Noble, W. S. (2004). Mismatch string kernels for discriminative protein classification. Bioinformatics, 20(4), 467\u2013476.","journal-title":"Bioinformatics"},{"key":"6009_CR36","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.neunet.2018.06.003","volume":"105","author":"D Li","year":"2018","unstructured":"Li, D., & Tian, Y. (2018). Survey and experimental study on metric learning methods. Neural Networks, 105, 447\u2013462.","journal-title":"Neural Networks"},{"key":"6009_CR37","doi-asserted-by":"crossref","unstructured":"Morris, C., Kriege, N.\u00a0M., Kersting, K., & Mutzel, P. (2016). Faster kernels for graphs with continuous attributes via hashing. In Data Mining (ICDM), 2016 IEEE 16th International Conference on (pp. 1095\u20131100). IEEE.","DOI":"10.1109\/ICDM.2016.0142"},{"key":"6009_CR38","doi-asserted-by":"crossref","unstructured":"Morris, C., Ritzert, M., Fey, M., Hamilton, W.\u00a0L., Lenssen, J.\u00a0E., Rattan, G., & Grohe, M. (2019). Weisfeiler and leman go neural: Higher-order graph neural networks. In The Thirty-Third AAAI Conference on Artificial Intelligence (pp. 4602\u20134609). AAAI Press.","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"6009_CR39","unstructured":"Morvan, M.\u00a0L., & Vert, J.-P. (2018). WHInter: A working set algorithm for high-dimensional sparse second order interaction models. In Proceedings of the 35th International Conference on Machine Learning (vol.\u00a080, pp. 3635\u20133644). PMLR."},{"key":"6009_CR40","doi-asserted-by":"crossref","unstructured":"Nakagawa, K., Suzumura, S., Karasuyama, M., Tsuda, K., & Takeuchi, I. (2016). Safe pattern pruning: An efficient approach for predictive pattern mining. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1785\u20131794). ACM.","DOI":"10.1145\/2939672.2939844"},{"key":"6009_CR41","unstructured":"Narayanan, A., Chandramohan, M., Venkatesan, R., Chen, L., Liu, Y., & Jaiswal, S. (2017). graph2vec: Learning distributed representations of graphs. CoRR, abs\/1707.05005."},{"issue":"1","key":"6009_CR42","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus, M., & Bunke, H. (2007). Automatic learning of cost functions for graph edit distance. Information Sciences, 177(1), 239\u2013247.","journal-title":"Information Sciences"},{"key":"6009_CR43","doi-asserted-by":"crossref","unstructured":"Nguyen, P.\u00a0C., Ohara, K., Mogi, A., Motoda, H., & Washio, T. (2006). Constructing decision trees for graph-structured data by chunkingless graph-based induction. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (pp. 390\u2013399). Springer.","DOI":"10.1007\/11731139_45"},{"key":"6009_CR44","unstructured":"Niepert, M., Ahmed, M., & Kutzkov, K. (2016). Learning convolutional neural networks for graphs. In International conference on machine learning (pp. 2014\u20132023)."},{"key":"6009_CR45","first-page":"377","volume":"10","author":"PK Novak","year":"2009","unstructured":"Novak, P. K., Lavra\u010d, N., & Webb, G. I. (2009). Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining. Journal of Machine Learning Research, 10, 377\u2013403.","journal-title":"Journal of Machine Learning Research"},{"key":"6009_CR46","unstructured":"Orsini, F., Frasconi, P., & De\u00a0Raedt, L. (2015). Graph invariant kernels. In Proceedings of the Twenty-fourth International Joint Conference on Artificial Intelligence (pp. 3756\u20133762)."},{"key":"6009_CR47","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2001). Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings 17th international conference on data engineering (pp. 215\u2013224). IEEE."},{"issue":"1","key":"6009_CR48","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1186\/1471-2105-15-235","volume":"15","author":"SP Pissis","year":"2014","unstructured":"Pissis, S. P. (2014). Motex-ii: structured motif extraction from large-scale datasets. BMC bioinformatics, 15(1), 235.","journal-title":"BMC bioinformatics"},{"key":"6009_CR49","doi-asserted-by":"crossref","unstructured":"Pissis, S.\u00a0P., Stamatakis, A., & Pavlidis, P. (2013). Motex: A word-based hpc tool for motif extraction. In Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics (p.\u00a013). ACM.","DOI":"10.1145\/2506583.2506587"},{"issue":"1","key":"6009_CR50","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10994-008-5089-z","volume":"75","author":"H Saigo","year":"2009","unstructured":"Saigo, H., Nowozin, S., Kadowaki, T., Kudo, T., & Tsuda, K. (2009). Gboost: a mathematical programming approach to graph classification and regression. Machine Learning, 75(1), 69\u201389.","journal-title":"Machine Learning"},{"key":"6009_CR51","doi-asserted-by":"crossref","unstructured":"Schreiber, F., & Schw\u00f6bbermeyer, H. (2005). Frequency concepts and pattern detection for the analysis of motifs in networks. In Transactions on computational systems biology III (pp. 89\u2013104). Springer.","DOI":"10.1007\/11599128_7"},{"issue":"2","key":"6009_CR52","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/TNNLS.2013.2275170","volume":"25","author":"C Shen","year":"2014","unstructured":"Shen, C., Kim, J., Liu, F., Wang, L., & Van Den Hengel, A. (2014). Efficient dual approach to distance metric learning. IEEE transactions on neural networks and learning systems, 25(2), 394\u2013406.","journal-title":"IEEE transactions on neural networks and learning systems"},{"key":"6009_CR53","unstructured":"Shervashidze, N., & Borgwardt, K.\u00a0M. (2009). Fast subtree kernels on graphs. In Advances in neural information processing systems (pp. 1660\u20131668)."},{"issue":"Sep","key":"6009_CR54","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., Leeuwen, EJv., Mehlhorn, K., & Borgwardt, K. M. (2011). Weisfeiler-lehman graph kernels. Journal of Machine Learning Research, 12(Sep), 2539\u20132561.","journal-title":"Journal of Machine Learning Research"},{"key":"6009_CR55","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., & Borgwardt, K. (2009). Efficient graphlet kernels for large graph comparison. In Artificial Intelligence and Statistics (pp. 488\u2013495)."},{"key":"6009_CR56","doi-asserted-by":"crossref","unstructured":"Simonovsky, M., & Komodakis, N. (2017). Dynamic edge-conditioned filters in convolutional neural networks on graphs. In: Proc. CVPR.","DOI":"10.1109\/CVPR.2017.11"},{"key":"6009_CR57","doi-asserted-by":"crossref","unstructured":"Su, Y., Han, F., Harang, R.\u00a0E., & Yan, X. (2016). A fast kernel for attributed graphs. In Proceedings of the 2016 SIAM International Conference on Data Mining (pp. 486\u2013494). SIAM.","DOI":"10.1137\/1.9781611974348.55"},{"key":"6009_CR58","unstructured":"Sugiyama, M., & Borgwardt, K. (2015). Halting in random walk kernels. In Advances in neural information processing systems (pp. 1639\u20131647)."},{"key":"6009_CR59","unstructured":"Takeuchi, I., & Sugiyama, M. (2011). Target neighbor consistent feature weighting for nearest neighbor classification. In Advances in Neural Information Processing Systems (vol.\u00a024, pp. 576\u2013584). Curran Associates, Inc."},{"issue":"5","key":"6009_CR60","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1002\/sam.10084","volume":"3","author":"M Thoma","year":"2010","unstructured":"Thoma, M., Cheng, H., Gretton, A., Han, J., Kriegel, H.-P., Smola, A., et al. (2010). Discriminative frequent subgraph mining with optimality guarantees. Statistical Analysis and Data Mining: The ASA Data Science Journal, 3(5), 302\u2013318.","journal-title":"Statistical Analysis and Data Mining: The ASA Data Science Journal"},{"key":"6009_CR61","unstructured":"Titouan, V., Courty, N., Tavenard, R., Laetitia, C., & Flamary, R. (2019). Optimal transport for structured data with application on graphs. In Proceedings of the 36th International Conference on Machine Learning (vol.\u00a097, pp. 6275\u20136284). PMLR."},{"key":"6009_CR62","doi-asserted-by":"crossref","unstructured":"Tixier, A. J.-P., Nikolentzos, G., Meladianos, P., & Vazirgiannis, M. (2018). Graph classification with 2d convolutional neural networks.","DOI":"10.1007\/978-3-030-30493-5_54"},{"key":"6009_CR63","unstructured":"Verma, S., & Zhang, Z.-L. (2017). Hunt for the unique, stable, sparse and fast feature learning on graphs. In Advances in Neural Information Processing Systems (pp. 88\u201398)."},{"issue":"Apr","key":"6009_CR64","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan, S. V. N., Schraudolph, N. N., Kondor, R., & Borgwardt, K. M. (2010). Graph kernels. Journal of Machine Learning Research, 11(Apr), 1201\u20131242.","journal-title":"Journal of Machine Learning Research"},{"issue":"Feb","key":"6009_CR65","first-page":"207","volume":"10","author":"KQ Weinberger","year":"2009","unstructured":"Weinberger, K. Q., & Saul, L. K. (2009). Distance metric learning for large margin nearest neighbor classification. Journal of Machine Learning Research, 10(Feb), 207\u2013244.","journal-title":"Journal of Machine Learning Research"},{"key":"6009_CR66","doi-asserted-by":"publisher","first-page":"145301","DOI":"10.1103\/PhysRevLett.120.145301","volume":"120","author":"T Xie","year":"2018","unstructured":"Xie, T., & Grossman, J. C. (2018). Crystal graph convolutional neural networks for an accurate and interpretable prediction of material properties. Physical Review Letters, 120, 145301.","journal-title":"Physical Review Letters"},{"key":"6009_CR67","doi-asserted-by":"crossref","unstructured":"Yan, J., Yin, X.-C., Lin, W., Deng, C., Zha, H., & Yang, X. (2016). A short survey of recent advances in graph matching. In Proceedings of the 2016 ACM on International Conference on Multimedia Retrieval (pp. 167\u2013174).","DOI":"10.1145\/2911996.2912035"},{"key":"6009_CR68","unstructured":"Yan, X., & Han, J. (2002). gspan: Graph-based substructure pattern mining. In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on (pp. 721\u2013724). IEEE."},{"key":"6009_CR69","doi-asserted-by":"crossref","unstructured":"Yanardag, P., & Vishwanathan, S. (2015). Deep graph kernels. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1365\u20131374). ACM.","DOI":"10.1145\/2783258.2783417"},{"key":"6009_CR70","doi-asserted-by":"crossref","unstructured":"Yoshida, T., Takeuchi, I., & Karasuyama, M. (2018). Safe triplet screening for distance metric learning. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 2653\u20132662).","DOI":"10.1145\/3219819.3220037"},{"key":"6009_CR71","doi-asserted-by":"crossref","unstructured":"Yoshida, T., Takeuchi, I., & Karasuyama, M. (2019a). Learning interpretable metric between graphs: Convex formulation and computation with graph mining. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1026\u20131036).","DOI":"10.1145\/3292500.3330845"},{"issue":"12","key":"6009_CR72","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.1162\/neco_a_01240","volume":"31","author":"T Yoshida","year":"2019","unstructured":"Yoshida, T., Takeuchi, I., & Karasuyama, M. (2019b). Safe triplet screening for distance metric learning. Neural Computation, 31(12), 2432\u20132491.","journal-title":"Neural Computation"},{"key":"6009_CR73","doi-asserted-by":"crossref","unstructured":"Zhang, M., Cui, Z., Neumann, M., & Chen, Y. (2018a). An end-to-end deep learning architecture for graph classification. In Proceedings of AAAI Conference on Artificial Inteligence.","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"6009_CR74","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Liu, Y., Jing, X., & Yan, J. (2007). ACIK: association classifier based on itemset kernel. In International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (pp. 865\u2013875). Springer.","DOI":"10.1007\/978-3-540-73325-6_86"},{"issue":"1","key":"6009_CR75","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/1748-7188-1-21","volume":"1","author":"Y Zhang","year":"2006","unstructured":"Zhang, Y., & Zaki, M. J. (2006). Exmotif: efficient structured motif extraction. Algorithms for Molecular Biology, 1(1), 21.","journal-title":"Algorithms for Molecular Biology"},{"key":"6009_CR76","unstructured":"Zhang, Z., Wang, M., Xiang, Y., Huang, Y., & Nehorai, A. (2018b). Retgk: Graph kernels based on return probabilities of random walks. In Advances in Neural Information Processing Systems (pp. 3968\u20133978)."},{"issue":"2","key":"6009_CR77","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., & Hastie, T. (2005). Regularization and variable selection via the elastic net. Journal of the royal statistical society: series B (statistical methodology), 67(2), 301\u2013320.","journal-title":"Journal of the royal statistical society: series B (statistical methodology)"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06009-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06009-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06009-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T11:55:56Z","timestamp":1672487756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06009-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,16]]},"references-count":77,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["6009"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06009-3","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,16]]},"assertion":[{"value":"4 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}