{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T16:07:47Z","timestamp":1790525267289,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T00:00:00Z","timestamp":1439164800000},"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":[[2015,8,10]]},"DOI":"10.1145\/2783258.2783341","type":"proceedings-article","created":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T15:38:27Z","timestamp":1438961907000},"page":"467-476","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Learning with Similarity Functions on Graphs using Matchings of Geometric Embeddings"],"prefix":"10.1145","author":[{"given":"Fredrik D.","family":"Johansson","sequence":"first","affiliation":[{"name":"Chalmers University of Technology, G\u00f6teborg, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Devdatt","family":"Dubhashi","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, G\u00f6teborg, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,8,10]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591844"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5059-5"},{"key":"e_1_3_2_2_3_1","first-page":"1871","volume-title":"Proceedings of the 29th International Conference on Machine Learning (ICML-12), ICML '12","author":"Bellet Aurelien","year":"2012","unstructured":"Aurelien Bellet , Amaury Habrard , and Marc Sebban . Similarity learning for provably accurate sparse linear classification. In John Langford and Joelle Pineau, editors , Proceedings of the 29th International Conference on Machine Learning (ICML-12), ICML '12 , pages 1871 -- 1878 , New York, NY, USA , July 2012 . Omnipress. Aurelien Bellet, Amaury Habrard, and Marc Sebban. Similarity learning for provably accurate sparse linear classification. In John Langford and Joelle Pineau, editors, Proceedings of the 29th International Conference on Machine Learning (ICML-12), ICML '12, pages 1871--1878, New York, NY, USA, July 2012. Omnipress."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"e_1_3_2_2_7_1","first-page":"2808","volume-title":"Proceedings of ISIT","author":"Hubert Chan T.-H.","year":"2009","unstructured":"T.-H. Hubert Chan , Kevin L. Chang , and Rajiv Raman . An sdp primal-dual algorithm for approximating the lov\u00e1sz-theta function . In Proceedings of ISIT , pages 2808 -- 2812 , Piscataway, NJ, USA , 2009 . IEEE Press. T.-H. Hubert Chan, Kevin L. Chang, and Rajiv Raman. An sdp primal-dual algorithm for approximating the lov\u00e1sz-theta function. In Proceedings of ISIT, pages 2808--2812, Piscataway, NJ, USA, 2009. IEEE Press."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2529989"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1568639"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200003)16:2%3C195::AID-RSA5%3E3.0.CO;2-A"},{"key":"e_1_3_2_2_12_1","first-page":"216","volume-title":"NIPS","author":"Feragen Aasa","year":"2013","unstructured":"Aasa Feragen , Niklas Kasenburg , Jens Petersen , Marleen de Bruijne , and Karsten M. Borgwardt . Scalable kernels for graphs with continuous attributes . In NIPS , pages 216 -- 224 , 2013 . Aasa Feragen, Niklas Kasenburg, Jens Petersen, Marleen de Bruijne, and Karsten M. Borgwardt. Scalable kernels for graphs with continuous attributes. In NIPS, pages 216--224, 2013."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102380"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959248"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614315"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198510581.001.0001"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.2298\/BMAT0429015G"},{"key":"e_1_3_2_2_19_1","volume-title":"Technical report, Department of Computer Science","author":"Haussler David","year":"1999","unstructured":"David Haussler . Convolution kernels on discrete structures. Technical report , Technical report, Department of Computer Science , University of California at Santa Cruz , 1999 . David Haussler. Convolution kernels on discrete structures. Technical report, Technical report, Department of Computer Science, University of California at Santa Cruz, 1999."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.1.107"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505565"},{"key":"e_1_3_2_2_22_1","first-page":"3495","article-title":"Lovasz theta function, svms and finding dense subgraphs","volume":"14","author":"Jethava Vinay","year":"2014","unstructured":"Vinay Jethava , Anders Martinsson , Chiranjib Bhattacharyya , and Devdatt Dubhashi . Lovasz theta function, svms and finding dense subgraphs . Journal of Machine Learning Research , 14 : 3495 -- 3536 , 2014 . Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, and Devdatt Dubhashi. Lovasz theta function, svms and finding dense subgraphs. Journal of Machine Learning Research, 14:3495--3536, 2014.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_23_1","volume-title":"Proceedings of the 31st International Conference on Machine Learning (ICML), pages 694--702. JMLR Workshop and Conference Proceedings","author":"Johansson Fredrik D.","year":"2014","unstructured":"Fredrik D. Johansson , Vinay Jethava , Devdatt Dubhashi , and Chiranjib Bhattacharyya . Global graph kernels using geometric embeddings. In Tony Jebara and Eric P. Xing, editors , Proceedings of the 31st International Conference on Machine Learning (ICML), pages 694--702. JMLR Workshop and Conference Proceedings , 2014 . Fredrik D. Johansson, Vinay Jethava, Devdatt Dubhashi, and Chiranjib Bhattacharyya. Global graph kernels using geometric embeddings. In Tony Jebara and Eric P. Xing, editors, Proceedings of the 31st International Conference on Machine Learning (ICML), pages 694--702. JMLR Workshop and Conference Proceedings, 2014."},{"key":"e_1_3_2_2_24_1","first-page":"1998","volume-title":"Advances in neural information processing systems","author":"Kar Purushottam","year":"2011","unstructured":"Purushottam Kar and Prateek Jain . Similarity-based learning via data driven embeddings . In Advances in neural information processing systems , pages 1998 -- 2006 , 2011 . Purushottam Kar and Prateek Jain. Similarity-based learning via data driven embeddings. In Advances in neural information processing systems, pages 1998--2006, 2011."},{"key":"e_1_3_2_2_25_1","first-page":"215","volume-title":"Advances in neural information processing systems","author":"Kar Purushottam","year":"2012","unstructured":"Purushottam Kar and Prateek Jain . Supervised learning with similarity functions . In Advances in neural information processing systems , pages 215 -- 223 , 2012 . Purushottam Kar and Prateek Jain. Supervised learning with similarity functions. In Advances in neural information processing systems, pages 215--223, 2012."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/089"},{"key":"e_1_3_2_2_27_1","series-title":"Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics","volume-title":"Lectures on the coupling method","author":"Lindvall Torgny","year":"1992","unstructured":"Torgny Lindvall . Lectures on the coupling method . Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics . John Wiley & Sons, Inc., New York , 1992 . A Wiley-Interscience Publication . Torgny Lindvall. Lectures on the coupling method. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics. John Wiley & Sons, Inc., New York, 1992. A Wiley-Interscience Publication."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104429181"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00024-7"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.05.007"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","volume-title":"Learning with kernels: Support vector machines, regularization, optimization, and beyond","author":"Sch\u00f6lkopf Bernhard","year":"2001","unstructured":"Bernhard Sch\u00f6lkopf and Alexander J Smola . Learning with kernels: Support vector machines, regularization, optimization, and beyond . MIT press , 2001 . Bernhard Sch\u00f6lkopf and Alexander J Smola. Learning with kernels: Support vector machines, regularization, optimization, and beyond. MIT press, 2001."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0420-4"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553494"},{"key":"e_1_3_2_2_35_1","first-page":"1660","volume-title":"Proceedings of NIPS","author":"Shervashidze Nino","year":"2009","unstructured":"Nino Shervashidze and Karsten Borgwardt . Fast subtree kernels on graphs . In Proceedings of NIPS , pages 1660 -- 1668 . 2009 . Nino Shervashidze and Karsten Borgwardt. Fast subtree kernels on graphs. In Proceedings of NIPS, pages 1660--1668. 2009."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078187"},{"key":"e_1_3_2_2_37_1","volume-title":"Proceedings of AISTATS","author":"Shervashidze Nino","year":"2009","unstructured":"Nino Shervashidze , SVN Vishwanathan , Tobias Petri , Kurt Mehlhorn , and Karsten M Borgwardt . Efficient graphlet kernels for large graph comparison . In Proceedings of AISTATS , 2009 . Nino Shervashidze, SVN Vishwanathan, Tobias Petri, Kurt Mehlhorn, and Karsten M Borgwardt. Efficient graphlet kernels for large graph comparison. In Proceedings of AISTATS, 2009."},{"key":"e_1_3_2_2_38_1","volume-title":"stationarity, and regeneration. Probability and its Applications (New York)","author":"Thorisson Hermann","year":"2000","unstructured":"Hermann Thorisson . Coupling , stationarity, and regeneration. Probability and its Applications (New York) . Springer-Verlag , New York , 2000 . Hermann Thorisson. Coupling, stationarity, and regeneration. Probability and its Applications (New York). Springer-Verlag, New York, 2000."},{"key":"e_1_3_2_2_39_1","volume-title":"The optimal assignment kernel is not positive definite. CoRR, abs\/0801.4061","author":"Vert Jean-Philippe","year":"2008","unstructured":"Jean-Philippe Vert . The optimal assignment kernel is not positive definite. CoRR, abs\/0801.4061 , 2008 . Jean-Philippe Vert. The optimal assignment kernel is not positive definite. CoRR, abs\/0801.4061, 2008."},{"key":"e_1_3_2_2_40_1","volume-title":"American Mathematical Soc.","author":"Villani C\u00e9dric","year":"2003","unstructured":"C\u00e9dric Villani . Topics in optimal transportation. Number 58 . American Mathematical Soc. , 2003 . C\u00e9dric Villani. Topics in optimal transportation. Number 58. American Mathematical Soc., 2003."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1859891"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0103-5"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273621"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13672-6_37"}],"event":{"name":"KDD '15: The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Sydney NSW Australia","acronym":"KDD '15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783341","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2783258.2783341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:57Z","timestamp":1750227417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,10]]},"references-count":44,"alternative-id":["10.1145\/2783258.2783341","10.1145\/2783258"],"URL":"https:\/\/doi.org\/10.1145\/2783258.2783341","relation":{},"subject":[],"published":{"date-parts":[[2015,8,10]]},"assertion":[{"value":"2015-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}