{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:52:08Z","timestamp":1778860328615,"version":"3.51.4"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106271"],"award-info":[{"award-number":["62106271"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Outstanding Young Scientist Program","award":["BJJWZYJH012019100020098"],"award-info":[{"award-number":["BJJWZYJH012019100020098"]}]},{"name":"Tencent AI Lab Rhino-Bird Joint Research Program"},{"name":"Beijing Key Laboratory of Big Data Management and Analysis Methods"},{"name":"Intelligent Social Governance Platform"},{"name":"Major Innovation & Planning Interdisciplinary Platform"},{"name":"Public Policy and Decision-making Research Lab of RUC"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102031"],"award-info":[{"award-number":["62102031"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Scholar Program of Beijing Institute of Technology","award":["XSQD-202107001"],"award-info":[{"award-number":["XSQD-202107001"]}]},{"name":"Technology Innovation Program of BIT","award":["2021CX11007"],"award-info":[{"award-number":["2021CX11007"]}]},{"name":"Technology Innovation Program of BIT","award":["2020YFF0305200"],"award-info":[{"award-number":["2020YFF0305200"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023,1,1]]},"DOI":"10.1109\/tpami.2022.3153126","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:37:25Z","timestamp":1645648645000},"page":"999-1016","source":"Crossref","is-referenced-by-count":16,"title":["Representing Graphs via Gromov-Wasserstein Factorization"],"prefix":"10.1109","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4192-5360","authenticated-orcid":false,"given":"Hongteng","family":"Xu","sequence":"first","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8786-4885","authenticated-orcid":false,"given":"Jiachang","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1136-8903","authenticated-orcid":false,"given":"Dixin","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing Institute of Technology, Haidian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Carin","sequence":"additional","affiliation":[{"name":"Provost, King Abdullah University of Science & Technology (KAUST), Thuwal, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref72","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","author":"niepert","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref70","first-page":"2990","article-title":"The multiscale laplacian graph kernel","author":"kondor","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref74","first-page":"88","article-title":"Hunt for the unique, stable, sparse and fast feature learning on graphs","author":"verma","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref39","article-title":"Graph clustering with dynamic embedding","author":"yang","year":"2017"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2618795"},{"key":"ref33","first-page":"283","article-title":"Generalized nonnegative matrix approximations with bregman divergences","author":"dhillon","year":"2005","journal-title":"Proc 18th Int Conf Neural Inf Process Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/14786440109462720"},{"key":"ref30","article-title":"Variational graph auto-encoders","author":"kipf","year":"2016"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0247-2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020480"},{"key":"ref35","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1142\/SMPAI"},{"key":"ref62","article-title":"Benchmark data sets for graph kernels","author":"kersting","year":"2016"},{"key":"ref61","first-page":"6412","article-title":"Graph convolutional policy network for goal-directed molecular graph generation","author":"you","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW50498.2020.00429"},{"key":"ref28","first-page":"5812","article-title":"Graph contrastive learning with augmentations","author":"you","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref64","first-page":"8024","article-title":"PyTorch: An imperative style, high-performance deep learning library","author":"paszke","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","first-page":"1","article-title":"InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","author":"sun","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref65","first-page":"291","article-title":"Subgraph matching kernels for attributed graphs","author":"kriege","year":"2012","journal-title":"Proc 29th Int Cof Mach Learn"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref29","article-title":"Adversarial graph augmentation to improve graph contrastive learning","author":"suresh","year":"2021"},{"key":"ref67","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref68","article-title":"Fast graph representation learning with pytorch geometric","author":"fey","year":"2019"},{"key":"ref69","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"girvan","year":"2002","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref1","author":"barab\u00e1si","year":"2016","journal-title":"Network Science"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10814"},{"key":"ref21","first-page":"4805","article-title":"Hierarchical graph representation learning with differentiable pooling","author":"ying","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref24","article-title":"graph2vec: Learning distributed representations of graphs","author":"narayanan","year":"2017"},{"key":"ref23","first-page":"297","article-title":"Noise-contrastive estimation: A new estimation principle for unnormalized statistical models","author":"gutmann","year":"2010","journal-title":"Proc 13th Int Conf Artif Intell Statist"},{"key":"ref26","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93037-4_14"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925918"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/17M1140431"},{"key":"ref59","first-page":"14 753","article-title":"Sliced gromov-wasserstein","author":"titouan","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2659647"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.343"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925903"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132967"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00393"},{"key":"ref52","first-page":"1723","article-title":"Distilled wasserstein learning for word embedding and topic modeling","author":"xu","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9093-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz026"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1214"},{"key":"ref12","first-page":"2664","article-title":"Gromov-wasserstein averaging of kernel and distance matrices","author":"peyr\u00e9","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref13","first-page":"3052","article-title":"Scalable gromov-wasserstein learning for graph partitioning and matching","author":"xu","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"2816","article-title":"Bregman alternating direction method of multipliers","author":"wang","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0120037"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1093\/bioinformatics\/btl301","article-title":"Biological network comparison using graphlet degree distribution","volume":"23","author":"pr\u017eulj","year":"2007","journal-title":"Bioinformatics"},{"key":"ref17","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","author":"shervashidze","year":"2009","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref18","first-page":"321","article-title":"Marginalized kernels between labeled graphs","author":"kashima","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"vishwanathan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref4","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","author":"duvenaud","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","article-title":"On graph kernels: Hardness results and efficient alternatives","author":"g\u00e4rtner","year":"2003","journal-title":"Learning Theory and Kernel Machines"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1021\/acs.chemmater.9b01294"},{"key":"ref8","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref7","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref49","first-page":"630","article-title":"Fast dictionary learning with a smoothed wasserstein loss","author":"rolet","year":"2016","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref9","first-page":"1","article-title":"How powerful are graph neural networks?","author":"xu","year":"2018","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6120"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13244"},{"key":"ref48","first-page":"1","article-title":"Online matrix factorization for markovian data and applications to network dictionary learning","volume":"21","author":"lyu","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref47","first-page":"10564","article-title":"Online graph dictionary learning","author":"vincent-cuaz","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref42","volume":"338","author":"villani","year":"2008","journal-title":"Optimal Transport Old and New"},{"key":"ref41","first-page":"6275","article-title":"Optimal transport for structured data with application on graphs","author":"titouan","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref44","first-page":"6932","article-title":"Gromov-wasserstein learning for graph matching and node embedding","author":"xu","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","first-page":"851","article-title":"Learning generative models across incomparable spaces","author":"bunne","year":"2019","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9970415\/09720092.pdf?arnumber=9720092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:12:01Z","timestamp":1672081921000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9720092\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,1]]},"references-count":74,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2022.3153126","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,1]]}}}