{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:10Z","timestamp":1750221010472,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"MEXT KAKENHI","award":["16H06538 17H00758 16H06538 17H04694"],"award-info":[{"award-number":["16H06538 17H00758 16H06538 17H04694"]}]},{"name":"PRESTO","award":["JPMJPR15N2"],"award-info":[{"award-number":["JPMJPR15N2"]}]},{"name":"JST CREST","award":["JPMJCR1302 JPMJCR1502"],"award-info":[{"award-number":["JPMJCR1302 JPMJCR1502"]}]},{"name":"Collaborative Research Program of Institute for Chemical Research Kyoto University","award":["grant #2018-33"],"award-info":[{"award-number":["grant #2018-33"]}]},{"name":"MI2I project of the Support Program for Starting Up Innovation Hub from JST"},{"name":"RIKEN Center for AIP"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330845","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"1026-1036","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning Interpretable Metric between Graphs"],"prefix":"10.1145","author":[{"given":"Tomoki","family":"Yoshida","sequence":"first","affiliation":[{"name":"Nagoya Institute of Technology, Nagoya, Japan"}]},{"given":"Ichiro","family":"Takeuchi","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology & National Institute for Material Science & RIKEN Center for Advanced Intelligence Project, Nagoya, Japan"}]},{"given":"Masayuki","family":"Karasuyama","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology & National Institute for Material Science & Japan Science and Technology Agency, Nagoya, Japan"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"B. Adhikari Y. Zhang N. Ramakrishnan and B. A. Prakash. 2018. Sub2Vec: Feature Learning for Subgraphs. In PAKDD. Springer 170--182.  B. Adhikari Y. Zhang N. Ramakrishnan and B. A. Prakash. 2018. Sub2Vec: Feature Learning for Subgraphs. In PAKDD. Springer 170--182.","DOI":"10.1007\/978-3-319-93037-4_14"},{"key":"e_1_3_2_1_2_1","unstructured":"J. Atwood and D. Towsley. 2016. Diffusion-convolutional neural networks. In Advances in NIPS. 1993--2001.   J. Atwood and D. Towsley. 2016. Diffusion-convolutional neural networks. In Advances in NIPS. 1993--2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-012-5293-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497425"},{"volume-title":"Proc. of the 27th ICML. Omnipress, 255--262","author":"Costa F.","key":"e_1_3_2_1_6_1","unstructured":"F. Costa and K. D. Grave . 2010. Fast neighborhood subgraph pairwise distance kernel . In Proc. of the 27th ICML. Omnipress, 255--262 . F. Costa and K. D. Grave. 2010. Fast neighborhood subgraph pairwise distance kernel. In Proc. of the 27th ICML. Omnipress, 255--262."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273523"},{"key":"e_1_3_2_1_8_1","unstructured":"D. K. Duvenaud D. Maclaurin J. Iparraguirre R. Bombarell T. Hirzel A. Aspuru-Guzik and R. P. Adams. 2015. Convolutional Networks on Graphs for Learning Molecular Fingerprints. In Advances in NIPS. Curran Associates Inc. 2224--2232.   D. K. Duvenaud D. Maclaurin J. Iparraguirre R. Bombarell T. Hirzel A. Aspuru-Guzik and R. P. Adams. 2015. Convolutional Networks on Graphs for Learning Molecular Fingerprints. In Advances in NIPS. Curran Associates Inc. 2224--2232."},{"key":"e_1_3_2_1_9_1","first-page":"1871","article-title":"LIBLINEAR","volume":"9","author":"Fan R.-E.","year":"2008","unstructured":"R.-E. Fan , K.-W. Chang , C.-J. Hsieh , X.-R. Wang , and C.-J. Lin . 2008 . LIBLINEAR : A Library for Large Linear Classification. JMLR , Vol. 9 (2008), 1871 -- 1874 . R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin. 2008. LIBLINEAR: A Library for Large Linear Classification. JMLR, Vol. 9 (2008), 1871--1874.","journal-title":"A Library for Large Linear Classification. JMLR"},{"key":"e_1_3_2_1_10_1","unstructured":"A. Feragen N. Kasenburg J. Petersen M. de Bruijne and K. Borgwardt. 2013. Scalable kernels for graphs with continuous attributes. In Advances in NIPS. 216--224.   A. Feragen N. Kasenburg J. Petersen M. de Bruijne and K. Borgwardt. 2013. Scalable kernels for graphs with continuous attributes. In Advances in NIPS. 216--224."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"T. G\"artner P. Flach and S. Wrobel. 2003. On graph kernels: Hardness results and efficient alternatives. In Learning Theory and Kernel Machines. Springer 129--143.  T. G\"artner P. Flach and S. Wrobel. 2003. On graph kernels: Hardness results and efficient alternatives. In Learning Theory and Kernel Machines. Springer 129--143.","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"e_1_3_2_1_13_1","unstructured":"L. E. Ghaoui V. Viallon and T. Rabbani. 2010. Safe feature elimination for the lasso and sparse supervised learning problems. arXiv:1009.4219 (2010).  L. E. Ghaoui V. Viallon and T. Rabbani. 2010. Safe feature elimination for the lasso and sparse supervised learning problems. arXiv:1009.4219 (2010)."},{"key":"e_1_3_2_1_14_1","unstructured":"K. Kersting N. M. Kriege C. Morris P. Mutzel and M. Neumann. 2016. Benchmark Data Sets for Graph Kernels. http:\/\/graphkernels.cs.tu-dortmund.de.  K. Kersting N. M. Kriege C. Morris P. Mutzel and M. Neumann. 2016. Benchmark Data Sets for Graph Kernels. http:\/\/graphkernels.cs.tu-dortmund.de."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390219"},{"key":"e_1_3_2_1_16_1","unstructured":"R. Kondor and H. Pan. 2016. The multiscale laplacian graph kernel. In Advances in NIPS. 2990--2998.   R. Kondor and H. Pan. 2016. The multiscale laplacian graph kernel. In Advances in NIPS. 2990--2998."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553443"},{"key":"e_1_3_2_1_18_1","unstructured":"N. Kriege and P. Mutzel. 2012. Subgraph matching kernels for attributed graphs. arXiv preprint arXiv:1206.6483 (2012).   N. Kriege and P. Mutzel. 2012. Subgraph matching kernels for attributed graphs. arXiv preprint arXiv:1206.6483 (2012)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219980"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2018.06.003"},{"volume-title":"Data Mining (ICDM), 2016 IEEE 16th International Conference on. IEEE, 1095--1100","author":"Morris C.","key":"e_1_3_2_1_21_1","unstructured":"C. Morris , N. M. Kriege , K. Kersting , and P. Mutzel . 2016. Faster kernels for graphs with continuous attributes via hashing . In Data Mining (ICDM), 2016 IEEE 16th International Conference on. IEEE, 1095--1100 . C. Morris, N. M. Kriege, K. Kersting, and P. Mutzel. 2016. Faster kernels for graphs with continuous attributes via hashing. In Data Mining (ICDM), 2016 IEEE 16th International Conference on. IEEE, 1095--1100."},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. of the 35th ICML","volume":"80","author":"Morvan M. L.","year":"2018","unstructured":"M. L. Morvan and J.-P. Vert . 2018 . WHInter: A Working set algorithm for High-dimensional sparse second order Interaction models . In Proc. of the 35th ICML , Vol. 80 . PMLR, 3635--3644. M. L. Morvan and J.-P. Vert. 2018. WHInter: A Working set algorithm for High-dimensional sparse second order Interaction models. In Proc. of the 35th ICML, Vol. 80. PMLR, 3635--3644."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939844"},{"volume-title":"Proc. of 13th MLGWorkshop .","author":"Narayanan A.","key":"e_1_3_2_1_24_1","unstructured":"A. Narayanan , M. Chandramohan , R. Venkatesan , L. Chen , Y. Liu , and S. Jaiswal . 2017. graph2vec: Learning Distributed Representations of Graphs . In Proc. of 13th MLGWorkshop . A. Narayanan, M. Chandramohan, R. Venkatesan, L. Chen, Y. Liu, and S. Jaiswal. 2017. graph2vec: Learning Distributed Representations of Graphs. In Proc. of 13th MLGWorkshop ."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.02.013"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_45"},{"volume-title":"Proc. of the 33rd ICML. 2014--2023","author":"Niepert M.","key":"e_1_3_2_1_27_1","unstructured":"M. Niepert , M. Ahmed , and K. Kutzkov . 2016. Learning convolutional neural networks for graphs . In Proc. of the 33rd ICML. 2014--2023 . M. Niepert, M. Ahmed, and K. Kutzkov. 2016. Learning convolutional neural networks for graphs. In Proc. of the 33rd ICML. 2014--2023."},{"key":"e_1_3_2_1_28_1","first-page":"377","article-title":"Supervised Descriptive Rule Discovery: A Unifying Survey of Contrast Set","volume":"10","author":"Novak P. K.","year":"2009","unstructured":"P. K. Novak , N. Lavravc , and G. I. Webb . 2009 . Supervised Descriptive Rule Discovery: A Unifying Survey of Contrast Set , Emerging Pattern and Subgroup Mining. JRML , Vol. 10 (2009), 377 -- 403 . P. K. Novak, N. Lavravc, and G. I. Webb. 2009. Supervised Descriptive Rule Discovery: A Unifying Survey of Contrast Set, Emerging Pattern and Subgroup Mining. JRML, Vol. 10 (2009), 377--403.","journal-title":"Emerging Pattern and Subgroup Mining. JRML"},{"volume-title":"Proc. of the 24th IJCAI. 3756--3762","author":"Orsini F.","key":"e_1_3_2_1_29_1","unstructured":"F. Orsini , P. Frasconi , and L. De Raedt . 2015. Graph invariant kernels . In Proc. of the 24th IJCAI. 3756--3762 . F. Orsini, P. Frasconi, and L. De Raedt. 2015. Graph invariant kernels. In Proc. of the 24th IJCAI. 3756--3762."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5089-z"},{"key":"e_1_3_2_1_31_1","unstructured":"N. Shervashidze and K. M. Borgwardt. 2009. Fast subtree kernels on graphs. In Advances in NIPS. 1660--1668.   N. Shervashidze and K. M. Borgwardt. 2009. Fast subtree kernels on graphs. In Advances in NIPS. 1660--1668."},{"key":"e_1_3_2_1_32_1","volume-title":"JMLR","volume":"12","author":"Shervashidze N.","year":"2011","unstructured":"N. Shervashidze , P. Schweitzer , E. J. v. Leeuwen , K. Mehlhorn , and K. M. Borgwardt . 2011. Weisfeiler-lehman graph kernels . JMLR , Vol. 12 , Sep ( 2011 ), 2539--2561. N. Shervashidze, P. Schweitzer, E. J. v. Leeuwen, K. Mehlhorn, and K. M. Borgwardt. 2011. Weisfeiler-lehman graph kernels. JMLR, Vol. 12, Sep (2011), 2539--2561."},{"key":"e_1_3_2_1_33_1","unstructured":"N. Shervashidze S. Vishwanathan T. Petri K. Mehlhorn and K. Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In AIStats. 488--495.  N. Shervashidze S. Vishwanathan T. Petri K. Mehlhorn and K. Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In AIStats. 488--495."},{"volume-title":"Proc. CVPR .","author":"Simonovsky M.","key":"e_1_3_2_1_34_1","unstructured":"M. Simonovsky and N. Komodakis . 2017. Dynamic edge-conditioned filters in convolutional neural networks on graphs . In Proc. CVPR . M. Simonovsky and N. Komodakis. 2017. Dynamic edge-conditioned filters in convolutional neural networks on graphs. In Proc. CVPR ."},{"volume-title":"Proc. of the 2016 SDM. SIAM, 486--494","author":"Su Y.","key":"e_1_3_2_1_35_1","unstructured":"Y. Su , F. Han , R. E. Harang , and X. Yan . 2016. A fast kernel for attributed graphs . In Proc. of the 2016 SDM. SIAM, 486--494 . Y. Su, F. Han, R. E. Harang, and X. Yan. 2016. A fast kernel for attributed graphs. In Proc. of the 2016 SDM. SIAM, 486--494."},{"key":"e_1_3_2_1_36_1","unstructured":"M. Sugiyama and K. Borgwardt. 2015. Halting in random walk kernels. In Advances in NIPS. 1639--1647.   M. Sugiyama and K. Borgwardt. 2015. Halting in random walk kernels. In Advances in NIPS. 1639--1647."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1868843.1868844"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"A. J.-P. Tixier G. Nikolentzos P. Meladianos and M. Vazirgiannis. 2018. Graph Classification with 2D Convolutional Neural Networks. (2018).  A. J.-P. Tixier G. Nikolentzos P. Meladianos and M. Vazirgiannis. 2018. Graph Classification with 2D Convolutional Neural Networks. (2018).","DOI":"10.1007\/978-3-030-01418-6_3"},{"key":"e_1_3_2_1_39_1","unstructured":"S. Verma and Z.-L. Zhang. 2017. Hunt For The Unique Stable Sparse And Fast Feature Learning On Graphs. In Advances in NIPS. 88--98.   S. Verma and Z.-L. Zhang. 2017. Hunt For The Unique Stable Sparse And Fast Feature Learning On Graphs. In Advances in NIPS. 88--98."},{"key":"e_1_3_2_1_40_1","volume-title":"JMLR","volume":"11","author":"Vishwanathan S. V. N.","year":"2010","unstructured":"S. V. N. Vishwanathan , N. N. Schraudolph , R. Kondor , and K. M. Borgwardt . 2010. Graph kernels . JMLR , Vol. 11 , Apr ( 2010 ), 1201--1242. S. V. N. Vishwanathan, N. N. Schraudolph, R. Kondor, and K. M. Borgwardt. 2010. Graph kernels. JMLR, Vol. 11, Apr (2010), 1201--1242."},{"key":"e_1_3_2_1_41_1","volume-title":"JMLR","volume":"10","author":"Weinberger K. Q.","year":"2009","unstructured":"K. Q. Weinberger and L. K. Saul . 2009. Distance metric learning for large margin nearest neighbor classification . JMLR , Vol. 10 , Feb ( 2009 ), 207--244. K. Q. Weinberger and L. K. Saul. 2009. Distance metric learning for large margin nearest neighbor classification. JMLR, Vol. 10, Feb (2009), 207--244."},{"volume-title":"Proc. of the 2nd ICDM. IEEE, 721--724","author":"Yan X.","key":"e_1_3_2_1_42_1","unstructured":"X. Yan and J. Han . 2002. gspan: Graph-based substructure pattern mining . In Proc. of the 2nd ICDM. IEEE, 721--724 . X. Yan and J. Han. 2002. gspan: Graph-based substructure pattern mining. In Proc. of the 2nd ICDM. IEEE, 721--724."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220037"},{"volume-title":"Proc. of 32nd AAAI .","author":"Zhang M.","key":"e_1_3_2_1_45_1","unstructured":"M. Zhang , Z. Cui , M. Neumann , and Y. Chen . 2018. An end-to-end deep learning architecture for graph classification . In Proc. of 32nd AAAI . M. Zhang, Z. Cui, M. Neumann, and Y. Chen. 2018. An end-to-end deep learning architecture for graph classification. In Proc. of 32nd AAAI ."},{"key":"e_1_3_2_1_46_1","unstructured":"Z. Zhang M. Wang Y. Xiang Y. Huang and A. Nehorai. 2018. RetGK: Graph Kernels based on Return Probabilities of Random Walks. In Advances in NIPS. 3968--3978.   Z. Zhang M. Wang Y. Xiang Y. Huang and A. Nehorai. 2018. RetGK: Graph Kernels based on Return Probabilities of Random Walks. In Advances in NIPS. 3968--3978."}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330845","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330845","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:02Z","timestamp":1750206362000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330845"}},"subtitle":["Convex Formulation and Computation with Graph Mining"],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":46,"alternative-id":["10.1145\/3292500.3330845","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330845","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}