{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T01:21:28Z","timestamp":1783473688626,"version":"3.55.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030676605","type":"print"},{"value":"9783030676612","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67661-2_34","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T07:06:46Z","timestamp":1614150406000},"page":"577-592","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Graph Diffusion Wasserstein Distances"],"prefix":"10.1007","author":[{"given":"Am\u00e9lie","family":"Barbe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Sebban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paulo","family":"Gon\u00e7alves","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Borgnat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00e9mi","family":"Gribonval","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/100788860","volume":"33","author":"A Al-Mohy","year":"2011","unstructured":"Al-Mohy, A., Higham, N.: Computing the action of the matrix exponential, with an application to exponential integrators. SIAM J. Sci. Comp. 33(2), 488\u2013511 (2011)","journal-title":"SIAM J. Sci. Comp."},{"issue":"5","key":"34_CR2","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TPAMI.2009.57","volume":"32","author":"L Bruzzone","year":"2010","unstructured":"Bruzzone, L., Marconcini, M.: Domain adaptation problems: a DASVM classification technique and a circular validation strategy. IEEE Trans. Pattern Anal. Mach. Intell. 32(5), 770\u2013787 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"50","key":"34_CR3","doi-asserted-by":"publisher","first-page":"19735","DOI":"10.1073\/pnas.0708838104","volume":"104","author":"F Chung","year":"2007","unstructured":"Chung, F.: The heat kernel as the pagerank of a graph. Proc. Nat. Acad. Sci. 104(50), 19735\u201319740 (2007)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-662-44848-9_18","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"N Courty","year":"2014","unstructured":"Courty, N., Flamary, R., Tuia, D.: Domain adaptation with regularized optimal transport. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8724, pp. 274\u2013289. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44848-9_18"},{"issue":"9","key":"34_CR5","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1109\/TPAMI.2016.2615921","volume":"39","author":"N Courty","year":"2017","unstructured":"Courty, N., Flamary, R., Tuia, D., Rakotomamonjy, A.: Optimal transport for domain adaptation. Trans. Pattern Anal. Mach. Intell. 39(9), 1853\u20131865 (2017)","journal-title":"Trans. Pattern Anal. Mach. Intell."},{"key":"34_CR6","doi-asserted-by":"publisher","unstructured":"Defferrard, M., Martin, L., Pena, R., Perraudin, N.: Pygsp: graph signal processing in python, October 2017. https:\/\/doi.org\/10.5281\/zenodo.1003158","DOI":"10.5281\/zenodo.1003158"},{"key":"34_CR7","unstructured":"Deshpande, Y., Sen, S., Montanari, A., Mossel, E.: Contextual stochastic block models. In: NeurIPS 2018, Montr\u00e9al, Canada, pp. 8590\u20138602 (2018)"},{"key":"34_CR8","unstructured":"Flamary, R., Courty, N.: Pot python optimal transport library (2017), https:\/\/github.com\/rflamary\/POT"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Hammond, D.K., Gur, Y., Johnson, C.R.: Graph diffusion distance: A difference measure for weighted graphs based on the graph Laplacian exponential kernel. In: GlobalSIP, pp. 419\u2013422. IEEE (2013)","DOI":"10.1109\/GlobalSIP.2013.6736904"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Networks 5(2), 109\u2013137 (1983)","journal-title":"Soc. Networks"},{"key":"34_CR11","first-page":"199","volume":"37","author":"L Kantorovich","year":"1942","unstructured":"Kantorovich, L.: On the translocation of masses. Doklady Acad. Sci. USSR 37, 199\u2013201 (1942)","journal-title":"Doklady Acad. Sci. USSR"},{"issue":"1","key":"34_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0195-3","volume":"5","author":"NM Kriege","year":"2019","unstructured":"Kriege, N.M., Johansson, F.D., Morris, C.: A survey on graph kernels. Appl. Network Sci. 5(1), 1\u201342 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0195-3","journal-title":"Appl. Network Sci."},{"key":"34_CR13","unstructured":"Maretic, H.P., Gheche, M.E., Chierchia, G., Frossard, P.: GOT: an optimal transport framework for graph comparison. CoRR abs\/1906.02085 (2019)"},{"key":"34_CR14","unstructured":"Maretic, H.P., Gheche, M.E., Minder, M., Chierchia, G., Frossard, P.: Wasserstein-based graph alignment. cs.LG abs\/2003.06048 (2020)"},{"key":"34_CR15","unstructured":"Monge, G.: M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Acad\u00e9mie royale des sciences de Paris (1781)"},{"issue":"4","key":"34_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","volume":"11","author":"F M\u00e9moli","year":"2011","unstructured":"M\u00e9moli, F.: Gromov-Wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11(4), 417\u2013487 (2011)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"34_CR17","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1109\/JPROC.2018.2820126","volume":"106","author":"A Ortega","year":"2018","unstructured":"Ortega, A., Frossard, P., Kova\u010devi\u0107, J., Moura, J., Vandergheynst, P.: Graph signal processing: overview, challenges, and applications. Proc. IEEE 106(5), 808\u2013828 (2018)","journal-title":"Proc. IEEE"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Peyr\u00e9, G., Cuturi, M.: Computational Optimal Transport. arXiv, March 2018","DOI":"10.1561\/9781680835519"},{"key":"34_CR19","first-page":"2664","volume":"48","author":"G Peyr\u00e9","year":"2016","unstructured":"Peyr\u00e9, G., Cuturi, M., Solomon, J.: Gromov-Wasserstein averaging of kernel and distance matrices. Int. Conf. on Mach. Learn. 48, 2664\u20132672 (2016)","journal-title":"Int. Conf. on Mach. Learn."},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Redko, I., Morvant, E., Habrard, A., Sebban, M., Bennani, Y.: Advances in Domain Adaptation Theory, p. 187, Elsevier, Amsterdam, August 2019. ISBN 978-1-78-548236-6","DOI":"10.1016\/B978-1-78548-236-6.50001-5"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Thanou, D., Dong, X., Kressner, D., Frossard, P.: Learning heat diffusion graphs. IEEE Trans. Sig. Info. Proc. Over Networks 3(3), 484\u2013499 (2017)","DOI":"10.1109\/TSIPN.2017.2731164"},{"key":"34_CR22","unstructured":"Tremblay, N., Puy, G., Gribonval, R., Vandergheynst, P.: Compressive spectral clustering. In: 33rd International Conference on Machine Learning, New York, USA, June 2016"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A., M\u00fcller, E.: Netlsd: Hearing the shape of a graph. In: ACM International Conference on Knowledge Discovery and Data Mining, London (UK), pp. 2347\u20132356, New York, USA (2018)","DOI":"10.1145\/3219819.3219991"},{"key":"34_CR24","first-page":"6275","volume":"97","author":"T Vayer","year":"2019","unstructured":"Vayer, T., Courty, N., Tavenard, R., Chapel, L., Flamary, R.: Optimal transport for structured data with application on graphs. Int. Conf. on Mach. Learn. 97, 6275\u20136284 (2019)","journal-title":"Int. Conf. on Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67661-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T23:02:52Z","timestamp":1740351772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67661-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030676605","9783030676612"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67661-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd2020.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"945","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"195","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}