{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:41:52Z","timestamp":1757544112559,"version":"3.37.3"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsipn.2022.3169632","type":"journal-article","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T19:39:03Z","timestamp":1651001943000},"page":"353-363","source":"Crossref","is-referenced-by-count":5,"title":["Wasserstein-Based Graph Alignment"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7780-9244","authenticated-orcid":false,"given":"Hermina Petric","family":"Maretic","sequence":"first","affiliation":[{"name":"EPFL, Rte Cantonale, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mireille El","family":"Gheche","sequence":"additional","affiliation":[{"name":"Sony AI, Sony Europe B.V., Schlieren, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Minder","sequence":"additional","affiliation":[{"name":"EPFL, Rte Cantonale, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5899-689X","authenticated-orcid":false,"given":"Giovanni","family":"Chierchia","sequence":"additional","affiliation":[{"name":"Université Gustave Eiffel, LIGM (UMR 8049), ESIEE Paris, Noisy-le-Grand, CNRS, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4010-714X","authenticated-orcid":false,"given":"Pascal","family":"Frossard","sequence":"additional","affiliation":[{"name":"EPFL, Rte Cantonale, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0228728"},{"key":"ref2","first-page":"853","article-title":"Generalizing graph matching beyond quadratic assignment model","volume-title":"Advances in Neural Information Processing Systems","author":"Yu","year":"2018"},{"key":"ref3","first-page":"3046","article-title":"Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Luo","year":"2019"},{"key":"ref4","first-page":"13876","article-title":"Got: An optimal transport framework for graph comparison","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Petric","year":"2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"ref6","first-page":"3187","article-title":"Graph matching via multiplicative update algorithm","volume-title":"Advances in Neural Information Processing Systems","author":"Jiang","year":"2017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11815921_17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1265866"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0044"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11585978_12"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1401651112"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iav002"},{"issue":"6","key":"ref13","first-page":"1","article-title":"DS++ A flexible, scalable and provably tight relaxation for matching problems","volume-title":"ACM Trans. Graph. (TOG)","volume":"36","author":"Dym","year":"2017"},{"key":"ref14","article-title":"KerGM: Kernelized graph matching","volume":"32","author":"Zhang","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref15","article-title":"On valid optimal assignment kernels and applications to graph classification","volume":"29","author":"Kriege","year":"2016","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2501802"},{"key":"ref18","article-title":"Learning latent permutations with gumbel-sinkhorn networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Mena","year":"2018"},{"article-title":"Learning permutations with sinkhorn policy gradient","year":"2018","author":"Emami","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"ref21","article-title":"Optimal transport with Laplacian regularization","volume-title":"Proc. Workshop Optimal Transp. Mach. Learn.","author":"Flamary","year":"2014"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.04.011"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10839"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9093-5"},{"key":"ref25","first-page":"2664","article-title":"Gromov-wasserstein averaging of kernel and distance matrices","volume-title":"Proc. Int. Conf. Mach. Learn., ser. Proc. Mach. Learn. Res.","volume":"48","author":"Peyr","year":"2016"},{"key":"ref26","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Advances in Neural Information Processing Systems","author":"Cuturi","year":"2013"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1214"},{"key":"ref28","first-page":"6275","article-title":"Optimal transport for structured data with application on graphs","volume-title":"Int. Conf. Mach. Learn.","author":"Titouan","year":"2019"},{"key":"ref29","first-page":"6932","article-title":"Gromov-wasserstein learning for graph matching and node embedding","volume-title":"Int. Conf. Mach. Learn.","author":"Xu","year":"2019"},{"first-page":"2021","article-title":"Representing graphs through data with learning and optimal transport","author":"Maretic","key":"ref30"},{"key":"ref31","first-page":"19327","article-title":"COPT: Coordinated optimal transport on graphs","volume-title":"Adv. Neural Inform. Process. Syst.","volume":"33","author":"Dong","year":"2020"},{"article-title":"Graph optimal transport with transition couplings of random walks","year":"2021","author":"OConnor","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67661-2_34"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0249624"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20738"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2969\/aspm\/05710463"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1201\/9780203492024"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2602809"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2307\/2528966"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2887284"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.322"},{"key":"ref43","first-page":"912","article-title":"Semi-supervised learning using Gaussian fields and harmonic functions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhu","year":"2003"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15939-8_33"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9940-7_3"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1983.10477029"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1080\/02331930008844513"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"ref49","first-page":"5859","article-title":"Differential properties of sinkhorn approximation for learning with wasserstein distance","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Luise","year":"2018"},{"key":"ref50","first-page":"1608","article-title":"Learning generative models with sinkhorn divergences","volume-title":"Proc. 21st Int. Conf. Artif. Intell. Statist., ser. Mach. Learn. Res.","volume":"84","author":"Genevay Peyr","year":"2018"},{"article-title":"Auto-encoding variational bayes","year":"2014","author":"Kingma","key":"ref51"},{"key":"ref52","first-page":"441","article-title":"Implicit reparameterization gradients","volume-title":"Advances in Neural Information Processing Systems","volume":"31","author":"Figurnov","year":"2018"},{"article-title":"Variational adaptive-newton method for explorative learning","year":"2017","author":"Khan","key":"ref53"},{"issue":"136","key":"ref54","first-page":"1","article-title":"Convergence rates for the stochastic gradient descent method for non-convex objective functions","volume":"21","author":"Fehrman","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.5244\/C.31.117"},{"key":"ref56","article-title":"On the convergence of adam and beyond","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Reddi","year":"2018"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"ref59","first-page":"1114","article-title":"An Integer Projected Fixed Point Method for Graph Matching and Map Inference","volume-title":"Advances in Neural Information Processing Systems","volume":"22","author":"Leordeanu","year":"2009"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219991"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6884276\/9666472\/09762998.pdf?arnumber=9762998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T20:53:58Z","timestamp":1705956838000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9762998\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/tsipn.2022.3169632","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"type":"electronic","value":"2373-776X"},{"type":"electronic","value":"2373-7778"}],"subject":[],"published":{"date-parts":[[2022]]}}}