{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T21:50:48Z","timestamp":1766267448795,"version":"3.28.0"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"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":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737411","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:35:56Z","timestamp":1560818156000},"page":"1360-1368","source":"Crossref","is-referenced-by-count":16,"title":["Disentangled Network Alignment with Matching Explainability"],"prefix":"10.1109","author":[{"given":"Fan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijing","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goce","family":"Trajcevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunpeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"On the convergence of adam and beyond","author":"reddi","year":"2018","journal-title":"ICLRE"},{"key":"ref38","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"NIPS"},{"key":"ref33","article-title":"Distance, dissimilarity index, and network community structure","volume":"67","author":"zou","year":"2003","journal-title":"Physical Review E"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v31i1.10839","article-title":"Matching node embeddings for graph similarity","author":"nikolentzos","year":"2017","journal-title":"AAAI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783341"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/058"},{"key":"ref37","article-title":"The kernel trick for distances","author":"scholkopf","year":"2000","journal-title":"NIPS"},{"key":"ref36","article-title":"Variational graph auto-encoders","author":"kipf","year":"2016","journal-title":"ArXiv"},{"key":"ref35","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"ICLRE"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883038"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661985"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.144"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783268"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref15","article-title":"Aligning users across social networks using network embedding","author":"liu","year":"2016","journal-title":"IJCAI"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1980.10486199"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1002\/9781118186435","author":"hampel","year":"2005","journal-title":"Robust Statistics The Approach Based on Influence Functions"},{"key":"ref28","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488428"},{"key":"ref27","article-title":"Integrated anchor and social link predictions across social networks","author":"zhang","year":"2015","journal-title":"IJCAI"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v30i1.10001","article-title":"Little is much: Bridging cross-platform behaviors through overlapped crowds","author":"jiang","year":"2016","journal-title":"AAAI"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486231"},{"key":"ref29","article-title":"Understanding black-box predictions via influence functions","author":"koh","year":"2017","journal-title":"ICML"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939849"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588559"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3068777.3068781"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505531"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp203"},{"key":"ref20","article-title":"Predict anchor links across social networks via an embedding approach","author":"man","year":"2016","journal-title":"IJCAI"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2017.11.002"},{"key":"ref21","article-title":"Graph kernels","author":"vishwanathan","year":"2010","journal-title":"JMLR"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v28i1.8720","article-title":"Mapping users across networks by manifold alignment on hypergraph","author":"tan","year":"2014","journal-title":"AAAI"},{"key":"ref23","article-title":"Weisfeiler-lehman graph kernels","author":"shervashidze","year":"2011","journal-title":"JMLR"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2485222"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2747880"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","start":{"date-parts":[[2019,4,29]]},"location":"Paris, France","end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737411.pdf?arnumber=8737411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:07:17Z","timestamp":1663718837000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737411\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737411","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}